Skip to search formSkip to main contentSkip to account menu

Skip graph

Skip graphs are a kind of distributed data structure based on skip lists. They were invented in 2003 by James Aspnes and Gauri Shah. They have the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Adversary modelData structureDistributed computingDistributed hash table

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
An Efficient Routing Method for Range Queries in Skip Graph
SUMMARY Skip Graph is a promising distributed data structure for large scale systems and known for its capability of range… 
2017
2017
PacketSkip: Skip Graph for Multidimensional Search in Structured Peer-to-Peer Systems
The Internet is ubiquitous and nodes participating in it are becoming increasingly diverse and heterogeneous. Especially is this… 
2017
2017
Self-refining skip graph: Skip graph approaching to an ideal topology
In Skip Graph, a structured overlay, each node constructs its routing table by choosing connected nodes based on its membership… 
2016
2016
FRT-Skip Graph: A Skip Graph-style structured overlay based on Flexible Routing Tables
Structured overlays enable a number of nodes to construct a logical network autonomously and search each other. Skip Graph, one… 
2016
2016
LARAS: Locality aware replication algorithm for the Skip Graph
Skip Graph, a member of the distributed hash table (DHT) family, has several benefits as an underlying structure in peer-to-peer… 
2015
2015
Locality Aware Skip Graph
Skip Graph, as a distributed hash table (DHT) based data structure, plays a key role in peer-to-peer (P2P) storage systems… 
Review
2013
Review
2013
A short survey of Advantages and Applications of Skip Graphs
Although the enormous growth of Internet, Social Network, Cloud Computing, etc. has brought the world closer and faster, major… 
2013
2013
Stabilizing Finite Churn in Peer-to-Peer Networks ?
We define and study the Finite Leave Problem which abstracts churn in peer-to-peer networks. In this problem, a process that… 
2009
2009
The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay Structure
We present a distributed data structure, which we call the rainbow skip graph. To our knowledge, this is the first peer-to-peer… 
2003
2003
Skip graphs
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)