Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
With the enormous growth of number of nodes in a peer-to-peer (P2P) network, establishing a direct connection between two… Expand
  • figure 1
  • figure 2
  • table I
  • figure 4
  • table II
Is this relevant?
2017
2017
We present a distributed self-adjusting algorithm for skip graphs that minimizes the average routing costs between arbitrary… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2011
2011
We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2009
2009
Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
A skip graph is a resilient application-layer routing structure that supports range queries of distributed k-dimensional data. By… Expand
  • 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… Expand
  • 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… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 5
Is this relevant?