Mio - a distributed Skip Graph based orderd KVS
We published Mio - a distributed Skip Graph based orderd KVS at github.
In short, mio is memcached + "range search".
You can issue a range search query to Mio using memcached client.
For more detailed information, see README and following slides I used on Erlang Tokyo Workshop #4.
Mio - a distributed Skip Graph based orderd KVS
View more presentations from higepon.
--
Taro Minowa(Higepon)
Comments