15 search results - page 1 / 3 » Distributed Searching of k-Dimensional Data with Almost Cons... |
ADBIS
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
SIGMOD
1997
ACM
13 years 9 months ago
1997
ACM
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
ALGORITHMICA
2005
13 years 4 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
CORR
2012
Springer
12 years 16 days 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...