Abstract

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. They are designed for use in searching peer-to-peer systems, and by providing the ability to perform queries based on key ordering, they improve on existing search tools that provide only hash table functionality. Unlike skip lists or other tree data structures, skip graphs are highly resilient, tolerating a large fraction of failed nodes without losing connectivity. In addition, simple and straightforward algorithms can be used to construct a skip graph, insert new nodes into it, search it, and detect and repair errors in a skip graph introduced due to node failures.

Citations

773	Freenet: a distributed anonymous information storage and retrieval system,” in International workshop on Designing privacy enhancing technologies - Clarke, Sandberg, et al. - 2001
304	Secure routing for structured peer-to-peer overlay networks - Castro, Druschel, et al. - 2002
260	Viceroy: A Scalable and Dynamic Emulation of the Butterfly - Malkhi, Naor, et al. - 2002
253	SkipNet: A scalable overlay network with practical locality properties - Harvey, Jones, et al. - 2003
218	Trie Memory - Fredkin - 1962
167	The art of computer programming. In: Sorting and Searching - Knuth - 1997
155	Distributed object location in a dynamic network - Hildrum, Kubiatowicz, et al. - 2002
144	Complex queries in DHT-based peer-to-peer networks - Harren, Hellerstein, et al. - 2002
123	Finding nearest neighbors in growth-restricted metrics - Karger, Ruhl
49	Fault-tolerant routing in peer-to-peer systems - Aspnes, Diamadi, et al. - 2002
35	resistant peer-to-peer content addressable networks - Fiat, Saia - 2002
29	Fault-tolerant data structures - Aumann, Bender - 1996
29	Active and Concurrent Topology Maintenance - Li, J, et al. - 2004
23	The path length of random skip lists - Kirschenhofer, Prodinger - 1994
19	Fast construction of overlay networks - Angluin, Aspnes, et al. - 2005
17	Peer-to-peer systems for prefix search - Awerbuch, Scheideler - 2003
16	File searching using variable length keys - BRIANDAIS, R - 1959
16	A limit theory for random skip lists - Devroye - 1992
16	A design of a parallel dictionary using skip lists. Theoretical ComputerScience - Gabarro, Martinez, et al. - 1996
12	Butterflies and peer-to-peer networks - Datar - 2002
11	Analysis of an optimized search algorithm for skip lists - Kirschenhofer, Martínez, et al. - 1995
9	The expansion and mixing time of skip graphs with applications - Aspnes, Wieder - 2005
5	A unified approach to concurrent and parallel algorithms on balanced data structures - Gabarr'o, Messeguer - 1997
5	A Distributed, Replicated, Data-balanced Search Structure - Johnson, Colbrook - 1994
2	Skip B-trees - Abraham, Aspnes, et al. - 2005
2	Fault Tolerance And Storage Reduction - Munro, Poblete - 1984
1	Family Trees - Harvey, Zatloukal - 2004