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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2003-2017
0520032017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this work, we study the problem of feature representation learning for graphstructured data. Many of the existing work in the… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2015
2015
Skip Graph, as a distributed hash table (DHT) based data structure, plays a key role in peer-to-peer (P2P) storage systems… (More)
Is this relevant?
2014
2014
Peer-to-peer systems rely on a scalable overlay network that enables efficient routing between its members. Hypercubic topologies… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2010
2010
In the Skip Graph, which is a structured overlay network that supports range retrievals, a key is supposed to consist of a single… (More)
  • figure 1
  • figure 3
  • figure 4
  • table I
  • table III
Is this relevant?
2010
2010
A skip graph is a valuable overlay network for searching for keys in a peer-to-peer application. A problem with the construction… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2009
2009
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
This paper presents the design of SNet system, which is a P2P overlay for Semantic Web Services discovery. SNet differs from… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2005
2005
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?