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
Parallel update and search in skip lists
Proceedings of the 13th international conference on Computer science 2 : research and applications: research and applications
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)
A design of a parallel dictionary using skip lists
Theoretical Computer Science
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
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
Peer-to-peer systems for prefix search
Proceedings of the twenty-second annual symposium on Principles of distributed computing
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
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 hyperring: a low-congestion deterministic data structure for distributed environments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An indexing framework for peer-to-peer systems
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: prefix hash tree
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: degree: optimal deterministic routing for P2P systems
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A storage and indexing framework for p2p systems
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
P-tree: a p2p index for resource discovery applications
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Querying peer-to-peer networks using P-trees
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
How to spread adversarial nodes?: rotate!
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Guaranteeing correctness and availability in P2P range indices
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Routing complexity of faulty networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The expansion and mixing time of skip graphs with applications
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Decentralized algorithms using both local and random probes for P2P load balancing
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
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Strategies for peer-to-peer downloading
Information Processing Letters
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
TSAR: a two tier sensor storage architecture using interval skip graphs
Proceedings of the 3rd international conference on Embedded networked sensor systems
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Building and Querying a P2P Virtual World
Geoinformatica
Speeding up search in peer-to-peer networks with a multi-way tree structure
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
On scalability of the similarity search in the world of peers
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Computer Networks: The International Journal of Computer and Telecommunications Networking
CISS: An efficient object clustering framework for DHT-based peer-to-peer applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
SNet: skip graph based semantic web services discovery
Proceedings of the 2007 ACM symposium on Applied computing
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
PRESTO: a predictive storage architecture for sensor networks
HOTOS'05 Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10
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
DGRID: a DHT-based resource indexing and discovery scheme for computational grids
ACSW '07 Proceedings of the fifth Australasian symposium on ACSW frontiers - Volume 68
ACM Transactions on Algorithms (TALG)
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Optimal proactive caching in peer-to-peer network: analysis and application
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Routing complexity of faulty networks
Random Structures & Algorithms
Range queries on structured overlay networks
Computer Communications
Range queries over skip tree graphs
Computer Communications
Ranged hash functions and the price of churn
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approaching neighbor proximity and load balance for range query in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Contention-based performance evaluation of multidimensional range search in peer-to-peer networks
Proceedings of the 2nd international conference on Scalable information systems
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Squid: Enabling search in DHT-based systems
Journal of Parallel and Distributed Computing
A novel load balancing mechanism for P2P networking
Proceedings of the first international conference on Networks for grid applications
Scalability comparison of Peer-to-Peer similarity search structures
Future Generation Computer Systems
Design and implementation trade-offs for wide-area resource discovery
ACM Transactions on Internet Technology (TOIT)
Contention-based performance evaluation of multidimensional range search in peer-to-peer networks
Future Generation Computer Systems
Efficient Content Authentication in Peer-to-Peer Networks
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Distributed Approximation Algorithm for Resource Clustering
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Safe peer-to-peer self-downloading
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A skip-list approach for efficiently processing forecasting queries
Proceedings of the VLDB Endowment
GRaSP: generalized range search in peer-to-peer networks
Proceedings of the 3rd international conference on Scalable information systems
Scalable community-driven data sharing in e-science grids
Future Generation Computer Systems
ACM Transactions on Computer Systems (TOCS)
Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A grid middleware for data management exploiting peer-to-peer techniques
Future Generation Computer Systems
Degree 3 Suffices: A Large-Scale Overlay for P2P Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
A Distributed Algorithm for Resource Clustering in Large Scale Platforms
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Robust random number generation for peer-to-peer systems
Theoretical Computer Science
A Grid Information Services Architecture Based on Structured P2P Systems
Computer Supported Cooperative Work in Design IV
MINERVA∞: a scalable efficient peer-to-peer search engine
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Combining flexibility and scalability in a peer-to-peer publish/subscribe system
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
AVMEM - availability-aware overlays for management operations in non-cooperative distributed systems
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Investigating the existence and the regularity of Logarithmic Harary Graphs
Theoretical Computer Science
Parallel Load Balancing Strategies for Tree-Structured Peer-to-Peer Networks
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Efficient range queries in spatial databases over Peer-to-Peer Networks
International Journal of Internet Protocol Technology
Metric Index: An Efficient and Scalable Solution for Similarity Search
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Distributed and Parallel Databases
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
PIAX: toward a framework for sensor overlay network
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Building a web-scale image similarity search system
Multimedia Tools and Applications
Safe peer-to-peer self-downloading
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
SONMAS: a structured overlay network for multidimensional attribute space
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Implementing range queries with a decentralized balanced tree over distributed hash tables
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
MESSIF: metric similarity search implementation framework
DELOS'07 Proceedings of the 1st international conference on Digital libraries: research and development
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Range query optimization leveraging peer heterogeneity in DHT data networks
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Oscar: small-world overlay for realistic key distributions
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Optimal caching for first-order query load-balancing in decentralized index structures
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
MIME: a dynamic index scheme for multi-dimensional query in mobile p2p networks
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
AVMEM: availability-aware overlays for management operations in non-cooperative distributed systems
MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
Snap-stabilizing prefix tree for peer-to-peer systems
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Pampoo: an efficient skip-trie based query processing framework for P2P systems
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
An effective longest prefix matching algorithm for speeding up query routing in skip graphs
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Data structures with unpredictable timing
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Enabling portability in advanced information-centric services over structured peer-to-peer systems
Journal of Network and Computer Applications
Capability-aware object management based on skip list in large-scale heterogeneous P2P networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
Snap-stabilizing linear message forwarding
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Load Balancing and Range Queries in P2P Systems Using P-Ring
ACM Transactions on Internet Technology (TOIT)
Load balanced scalable Byzantine agreement through quorum building, with full information
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Robust architectures for open distributed systems and topological self-stabilization: invited paper
Proceedings of the Third International Workshop on Reliability, Availability, and Security
A new and effective hierarchical overlay structure for Peer-to-Peer networks
Computer Communications
Hashed patricia trie: efficient longest prefix matching in peer-to-peer systems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Supporting multi-dimensional queries in mobile P2P network
Information Sciences: an International Journal
HDOV: an overlay network for wide area spatial data collection
Proceedings of the 2011 ACM Symposium on Applied Computing
Re-Chord: a self-stabilizing chord overlay network
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
HD Tree: A novel data structure to support multi-dimensional range query for P2P networks
Journal of Parallel and Distributed Computing
A correlation-aware data placement strategy for key-value stores
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Building self-stabilizing overlay networks with the transitive closure framework
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Error-Resilient Routing for Supporting Multi-dimensional Range Query in HD Tree
DS-RT '11 Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications
A Read-Only Distributed Hash Table
Journal of Grid Computing
LinkNet: a new approach for searching in a large peer-to-peer system
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
A repair mechanism for fault-tolerance for tree-structured peer-to-peer systems
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Robust random number generation for peer-to-peer systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Clustering peers based on contents for efficient similarity search
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
Routing algorithm using skipnet and small-world for peer-to-peer system
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
PRoBe: multi-dimensional range queries in p2p networks
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Replication, load balancing and efficient range query processing in DHTs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Time complexity of distributed topological self-stabilization: the case of graph linearization
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
RAQ: a range-queriable distributed data structure
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Roogle: supporting efficient high-dimensional range queries in p2p systems
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
A self-repairing peer-to-peer system resilient to dynamic adversarial churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Brushwood: distributed trees in peer-to-peer systems
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Adapting the content native space for load balanced indexing
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Self-optimizing DHTs using request profiling
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Distributed balanced tables: a new approach
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Simple efficient load balancing algorithms for peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Design and analysis of a distributed grid resource discovery protocol
Cluster Computing
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Improving sender anonymity in a structured overlay with imprecise routing
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Dependable peer-to-peer systems withstanding dynamic adversarial churn
Dependable Systems
Reverse nearest neighbor search in peer-to-peer systems
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
MINERVA∞: a scalable efficient peer-to-peer search engine
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Combining flexibility and scalability in a peer-to-peer publish/subscribe system
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Building a network-aware and load-balanced peer-to-peer system for range queries
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tide: An effective and practical design for hierarchical-structured P2P model
Computer Communications
A self-adaptive resource index and discovery system in distributed computing environments
International Journal of Ad Hoc and Ubiquitous Computing
FoXtrot: Distributed structural and value XML filtering
ACM Transactions on the Web (TWEB)
A structured overlay for multi-dimensional range queries
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
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
Decentralized resource discovery mechanisms for distributed computing in peer-to-peer environments
ACM Computing Surveys (CSUR)
Building self-stabilizing overlay networks with the transitive closure framework
Theoretical Computer Science
| 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 elements are stored in separate nodes that may fail at any time. They are designed for use in searching peer-to-peer networks, 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 elements into, searching a skip graph and detecting and repairing errors in the data structure introduced by node failures can be done using simple and straight-forward algorithms.