1888 search results - page 113 / 378 » Algorithms for Querying by Spatial Structure |
136
Voted
PODS
2000
ACM
15 years 9 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
140
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
166
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
126
click to vote
SAC
2002
ACM
15 years 4 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
150
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement about a range of applications broadly characterized as "location based services". Cu...