1888 search results - page 48 / 378 » Algorithms for Querying by Spatial Structure |
260
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
198
click to vote
INFOSCALE
2007
ACM
15 years 8 months ago
2007
ACM
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
156
click to vote
COCOON
2005
Springer
16 years 2 days ago
2005
Springer
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
168
click to vote
ADBIS
1995
Springer
15 years 10 months ago
1995
Springer
One of the most important operations in spatial access needed systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. Th...
172
click to vote
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
We consider the general problem of tracking moving objects in sensor networks. The specific application we consider is that of tracking a chemical plume moving over a large infra...