Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Analysis of the expected search cost in skip lists
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
The path length of random skip lists
Acta Informatica
Analysis of an optimized search algorithm for skip lists
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
A design of a parallel dictionary using skip lists
Theoretical Computer Science
Communications of the ACM
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Butterflies and Peer-to-Peer Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A unified approach to concurrent and parallel algorithms on balanced data structures
SCCC '97 Proceedings of the 17th International Conference of the Chilean Computer Science Society
Peer-to-peer systems for prefix search
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Fault tolerant data structures
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The expansion and mixing time of skip graphs with applications
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Self-Stabilizing Structured Ring Topology P2P Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Topology-aware routing in structured peer-to-peer overlay networks
Future directions in distributed computing
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
A Peer-to-Peer Information Sharing Method for RDF Triples Based on RDF Schema
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Virtual individual servers as privacy-preserving proxies for mobile devices
Proceedings of the 1st ACM workshop on Networking, systems, and applications for mobile handhelds
A hierarchically structured global data collection network
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Replica-aware, multi-dimensional range queries in Distributed Hash Tables
Computer Communications
Superchunk based fast search in P2P-VoD system
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
SkewCCC+: a heterogeneous distributed hash table
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Content-based video search on peer-to-peer networks
International Journal of Grid and Utility Computing
Corona: a stabilizing deterministic message-passing skip list
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
A large scale key-value store based on range-key skip graph and its applications
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Peer-to-peer data structures for cooperative traffic information systems
Pervasive and Mobile Computing
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
Simple dynamic load balancing mechanism for structured P2P network and its evaluation
International Journal of Grid and Utility Computing
Authenticated and persistent skip graph: a data structure for cloud based data-centric applications
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Optimization in a self-stabilizing service discovery framework for large scale systems
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Future Generation Computer Systems
| Hi-index | 0.00 |
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 within it introduced due to node failures.