8 search results - page 1 / 2 » Fully dynamic distributed search trees can be balanced in O(... |
JPDC
2002
13 years 4 months ago
2002
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
CCGRID
2006
IEEE
13 years 10 months ago
2006
IEEE
— In DHT based P2P systems, various issues such as peer heterogeneity, network topology, and diverse file popularity, may affect the DHT system efficiency. In this paper, we pr...
SPAA
1990
ACM
13 years 8 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...