Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments
 

Summary: The Hyperring: A Low-Congestion Deterministic
Data Structure for Distributed Environments
Baruch Awerbuch
Christian Scheideler
Abstract
In this paper we study the problem of designing concurrent
searchable data structures with performance guarantees
that can be used in a distributed environment where data
elements are stored in a dynamically changing set of nodes.
Searchable data structures are data structures that provide
three basic operations: Insert, Delete, and Search. In
addition to searching for an exact match, we demand that
for a data structure to be called "searchable", Search also has
to be able to search for the closest successor or predecessor
of a data item. Such a property has a tremendous advantage
over just exact match, because it would allow to implement
many data base applications.
We are interested in finding a concurrent searchable
data structure that has (1) a low degree, (2) requires a small
amount of work for Insert and Delete operations, and

  

Source: Awerbuch, Baruch - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences