Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,797,568 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Adversary model
Data structure
Distributed computing
Distributed hash table
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Locally Self-Adjusting Skip Graphs
Sikder Huq
,
Sukumar Ghosh
IEEE International Conference on Distributed…
2017
Corpus ID: 750097
We present a distributed self-adjusting algorithm for skip graphs that minimizes the average routing costs between arbitrary…
Expand
2014
2014
SKIP+: A Self-Stabilizing Skip Graph
R. Jacob
,
A. Richa
,
C. Scheideler
,
S. Schmid
,
Hanjo Täubig
JACM
2014
Corpus ID: 210123
Peer-to-peer systems rely on a scalable overlay network that enables efficient routing between its members. Hypercubic topologies…
Expand
Review
2013
Review
2013
A short survey of Advantages and Applications of Skip Graphs
Shalini Batra
,
Amritpal Singh
2013
Corpus ID: 17353689
Although the enormous growth of Internet, Social Network, Cloud Computing, etc. has brought the world closer and faster, major…
Expand
2011
2011
Corona: A stabilizing deterministic message-passing skip list
Rizal Bin Mohd. Nor
,
Mikhail Nesterenko
,
C. Scheideler
Theoretical Computer Science
2011
Corpus ID: 1355181
2011
2011
Building self-stabilizing overlay networks with the transitive closure framework
Andrew Berns
,
Sukumar Ghosh
,
S. Pemmaraju
Theoretical Computer Science
2011
Corpus ID: 2206359
2007
2007
Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network
Gregory J. Brault
,
Christopher J. Augeri
,
B. Mullins
,
R. Baldwin
,
Christopher B. Mayer
IEEE International Symposium on Network Computing…
2007
Corpus ID: 10928140
A skip graph is a resilient application-layer routing structure that supports range queries of distributed k-dimensional data. By…
Expand
2007
2007
Attribute-based Overlay Network for Non-DHT Structured Peer-to-peer Lookup
Ming-Tsung Sun
,
C. King
,
Wen-Hung Sun
,
Chiu-Ping Chang
International Conference on Parallel Processing
2007
Corpus ID: 14429104
Most DHT-based P2P search systems assume implicitly that the participating peers contain multiple objects. The distributed hash…
Expand
Highly Cited
2005
Highly Cited
2005
TSAR: a two tier sensor storage architecture using interval skip graphs
Peter Desnoyers
,
Deepak Ganesan
,
Prashant J. Shenoy
ACM International Conference on Embedded…
2005
Corpus ID: 2545134
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features…
Expand
Highly Cited
2004
Highly Cited
2004
One torus to rule them all: multi-dimensional queries in P2P systems
Prasanna Ganesan
,
Beverly Yang
,
H. Garcia-Molina
International Workshop on the Web and Databases
2004
Corpus ID: 3539432
Peer-to-peer systems enable access to data spread over an extremely large number of machines. Most P2P systems support only…
Expand
Highly Cited
2003
Highly Cited
2003
Skip graphs
J. Aspnes
,
Gauri Shah
ACM-SIAM Symposium on Discrete Algorithms
2003
Corpus ID: 2912929
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree…
Expand
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)
ACCEPT & CONTINUE