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.
2018
2018
Adaptive Skip Graph Framework for Peer-to-Peer Networks: Search Time Complexity Analysis
With the enormous growth of number of nodes in a peer-to-peer (P2P) network, establishing a direct connection between two… 
2016
2016
A virtual replica node-based flash crowds alleviation method for sensor overlay networks
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… 
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… 
2010
2010
Balance and Proximity-Aware Skip Graph Construction
A skip graph is a valuable overlay network for searching for keys in a peer-to-peer application. A problem with the construction… 
2010
2010
Aggregation Skip Graph: A Skip Graph Extension for Efficient Aggregation Query
—Skip graphs are a structured overlay network that allows range queries. In this article, we propose a skip graph extension… 
2007
2007
Attribute-based Overlay Network for Non-DHT Structured Peer-to-peer Lookup
Most DHT-based P2P search systems assume implicitly that the participating peers contain multiple objects. The distributed hash… 
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)