Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. Via anarchaia.
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. Via anarchaia.
No comments
Comments feed for this article
Trackback link: http://tony.thompson.name/2008/04/skip-graphs/trackback/