Sciweavers

30 search results - page 2 / 6
» Skip graphs
Sort
View
DASFAA
2010
IEEE
168views Database» more  DASFAA 2010»
13 years 6 months ago
A Large Scale Key-Value Store Based on Range-Key Skip Graph and Its Applications
An overlay network called Range-key Skip Graph (RKSG) has been proposed that can perform range-to-range search on peer-topeer network. In this paper, we propose a large scale key-v...
Susumu Takeuchi, Jun Shinomiya, Toru Shiraki, Yosh...
IPTPS
2004
Springer
13 years 10 months ago
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
Moni Naor, Udi Wieder
PODC
2009
ACM
14 years 5 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
SENSYS
2005
ACM
13 years 10 months ago
TSAR: a two tier sensor storage architecture using interval skip graphs
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
Peter Desnoyers, Deepak Ganesan, Prashant J. Sheno...
SODA
2003
ACM
79views Algorithms» more  SODA 2003»
13 years 6 months ago
Skip graphs
James Aspnes, Gauri Shah