3 search results - page 1 / 1 » Self-tuning Reactive Distributed Trees for Counting and Bala... |
OPODIS
2004
13 years 6 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
IPPS
1997
IEEE
13 years 8 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
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 ...