Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Skip Graphs JAMES ASPNES1
 

Summary: Skip Graphs
JAMES ASPNES1
Yale
and
GAURI SHAH2
Google
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.
Categories and Subject Descriptors: E.1 [Data]: Data Structures--Distributed Data Structures
General Terms: Algorithms
Additional Key Words and Phrases: Peer-to-peer, Skip lists, Overlay networks
1. INTRODUCTION
Peer-to-peer networks are distributed systems without any central authority that are used for efficient location

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences