Skip to search formSkip to main contentSkip to account menu

Skip-webs: efficient distributed data structures for multi-dimensional data sets

@inproceedings{Arge2005SkipwebsED,
  title={Skip-webs: efficient distributed data structures for multi-dimensional data sets},
  author={Lars Arge and David Eppstein and Michael T. Goodrich},
  booktitle={ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing},
  year={2005},
  url={https://api.semanticscholar.org/CorpusID:207272}
}
This work presents a framework for designing efficient distributed data structures for multi-dimensional data, which includes skip-webs, and applies to a general class of data querying scenarios, which include linear (one-dimensional) data, such as sorted sets, as well as multi- dimensional data,such as d-dimensional octrees and digital tries of character strings defined over a fixed alphabet.
View on ACM
[PDF] Semantic Reader
41 Citations
Highly Influential Citations
2
Background Citations
27
Methods Citations
11

Figures and Tables from this paper

41 Citations

The rainbow skip graph: a fault-tolerant constant-degree distributed data structure

This is the first peer-to-peer data structure that simultaneously achieves high fault-tolerance, constant-sized nodes, and fast update and query times for ordered data.

Large-scale indexing of spatial data in distributed repositories: the SD-Rtree

A flexible allocation protocol which allows to cope with a temporary shortage of storage resources through data storage balancing and the results justify the various design choices and the overall utility of the structure.

Write-Optimized Skip Lists

This work gives an external-memory skip list that achieves write-optimized bounds, and uses extremal-graph coloring to show that it is possible to decompose paths in the skip list into uncorrelated groups, regardless of the insertion/deletion pattern.

Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries

One of the main contributions is a data structure built on the way---a history-independent packed-memory array (PMA), which matches the asymptotic bounds of prior non-HI packed- memory arrays and sparse tables.

The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay Structure

To the knowledge, this is the first peer-to-peer data structure that simultaneously achieves high fault tolerance, constant-sized nodes, and fast update and query times for ordered data.

A scalable distributed skip list for range queries

In this paper we present a distributed, message passing implementation of a dynamic dictionary structure for range queries. The structure is based on a distributed fine-grain implementation of skip…

SONMAS: A Structured Overlay Network for Multidimensional Attribute Space

An attribute-based P2P interconnection strategy that uses the attributes to interconnect the peers instead of hash keys is introduced that can support range and KNN queries, guarantee lookup efficiency, and eliminate the need to maintain a directory.

Efficient range query processing over DHTs based on the balanced Kautz tree

This paper presents an efficient indexing structure called Balanced Kautz (BK) tree that uniformly maps the m‐dimensional data space onto DHT nodes, and proposes a BK tree‐based range query scheme called ERQ that processes range queries in a parallel fashion and guarantees to return the results in a bounded delay.

Distributed skip list in fine-grain message passing interface : implementation and analysis of a dictionary data structure that supports range queries

A shortcut mechanism that alleviates the bottleneck at the head and introduces semantic trade offs between performance and consistency is investigated and the performance of the skip list on a medium size cluster of two hundred cores with twenty thousand processes is reported.

A Service-oriented Scalable Dictionary in MPI

This paper presents a service-oriented approach to the design of distributed data structures in MPI where the skip list elements are active processes that have control over the list operations, and includes a novel skip list based range query operation.
...
...

23 References

The skip quadtree: a simple dynamic data structure for multidimensional data

This work presents a new multi-dimensional data structure, which it is called the skip quadtree or the skip octree, which has the well-defined "box"-shaped regions of region quadtrees and the logarithmic-height search and update hierarchical structure of skip lists.

Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time

A novel randomized data structure, called a family tree, is presented, which has optimal expected congestion, uses only a constant amount of state per node, and supports searches and node insertion/deletion in expected O(log n) time on a system with n nodes.

Skip graphs

Skip graphs are designed for use in searching peer-to-peer systems, and by providing the ability to perform queries based on key ordering, they improve on existing search tools that provide only hash table functionality.

Load balancing and locality in range-queriable data structures

Though this mechanism is specifically designed to improve the performance of skip graphs, it can be adapted to provide deterministic, locality-preserving load-balancing to any distributed data structure that orders machines in a ring or line.

Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks

Surprisingly, the NoN-greedy routing algorithm is able to diminish route-lengths to Θ(log n / log log n) hops, which is asymptotically optimal.

Koorde: A Simple Degree-Optimal Distributed Hash Table

Koorde is a new distributed hash table (DHT) based on Chord 15 and the de Bruijn graphs 2 that meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node.

Chord: A scalable peer-to-peer lookup service for internet applications

Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.

Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.

Making data structures persistent

This paper develops simple, systematic, and efficient techniques for making linked data structures persistent, and uses them to devise persistent forms of binary search trees with logarithmic access, insertion, and deletion times and O (1) space bounds for insertion and deletion.

Symphony: Distributed Hashing in a Small World

Symphony, a novel protocol for maintaining distributed hash tables in a wide area network that is scalable, flexible, stable in the presence of frequent updates and offers small average latency with only a handful of long distance links per node.
...
...
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)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.