Archive for the ‘Skip Graph’ Category

Mio- Distributed Skip Graph based ordered KVS

Sunday, February 20th, 2011

Mio- Distributed Skip Graph based ordered KVS by Taro Minowa.

From the slide deck:

Mio is…

  • a distributed orderd KVS
  • memcached + range search
  • Skip Graph based
  • Written in Erlang
  • http://github.com/higepon/mio
  • In alpha quality

On skip graphs, see James Aspnes:

Skip graphs, with Gauri Shah. ACM Transactions on Algorithms, 3(4):37, November 2007. An earlier version appeared in Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 2003, pp. 384–393. Available as: arXiv:cs.DS/0306043. [PDF]

Not going to be important in all cases but perhaps important to have in your tool kit.

It will be interesting to see as topic maps develop, the techniques that are successful in particular fields.

So those lessons can be applied in similar situations.

No patterns just yet but not excluding the possibility.