Filtering search: a new approach to query answering
SIAM Journal on Computing
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
Multidimensional divide-and-conquer
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
On the exact worst case query complexity of planar point location
Journal of Algorithms
Distribution-sensitive point location in convex subdivisions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A data structure for orthogonal range queries
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The expected query time for this data structure, when queries are drawn according to D, matches, to within a constant factor, that of the optimal comparison tree for S and D. The memory and preprocessing requirements of the data structure are O(n log n).