220 search results - page 3 / 44 » The Forgiving Tree: A Self-Healing Distributed Data Structur... |
OPODIS
2004
13 years 9 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...
SDMW
2004
Springer
14 years 29 days ago
2004
Springer
With the increasing use of web services, many new challenges concerning data security are becoming critical. Data or applications can now be outsourced to powerful remote servers, ...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
SIAMSC
2011
12 years 10 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...