Skip Graphs

Details Skip Graphs Skip Graphs

2003-06-10

arxiv.org/abs/cs/0306043v1

Computer Science

Data Structures and Algorithms

36 pages, 12 figures. Full version of paper appearing in SODA 2003

Scientific paper

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, constructing, inserting new nodes into, searching a skip graph, and detecting and repairing errors in the data structure introduced by node failures can be done using simple and straightforward algorithms.

Affiliated with

Also associated with

No associations

Rating

Skip Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Skip Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Skip Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-458322