The hyperring: a low-congestion deterministic data structure for distributed environments

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 (3) is able to handle concurrent search requests with low congestion and dilation. We present the first deterministic concurrent data structure,...

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: Baruch Awerbuch, Christian Scheideler
• Keywords: Algorithms, Concurrent Searchable Data, Data Structure, Searchable Data Structure, SODA 2004