Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
The input/output complexity of sorting and related problems
Communications of the ACM
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
BLASTING through the information theoretic barrier with FUSION TREES
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Path caching (extended abstract): a technique for optimal external searching
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Algorithms for generalized halfspace range searching and other intersection searching problems
Computational Geometry: Theory and Applications
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Multidimensional divide-and-conquer
Communications of the ACM
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
New Upper Bounds for Generalized Intersection Searching Problems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Fully Dynamic Orthogonal Range Reporting on RAM
SIAM Journal on Computing
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
ACM Transactions on Algorithms (TALG)
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Information Processing Letters
External memory range reporting on a grid
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Colored range queries and document retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
I/O-efficient data structures for colored range and prefix reporting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Top-K color queries for document retrieval
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Space-Efficient and fast algorithms for multidimensional dominance reporting and counting
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
External memory orthogonal range reporting with fast updates
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Space-efficient range reporting for categorical data
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Efficient external memory structures for range-aggregate queries
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
In the orthogonal range-searching problem, we store a set of input points S in a data structure; the answer to a query Q is a piece of information about points in Q∩S, for example, the list of all points in Q∩S or the number of points in Q. In the colored (or categorical) range-searching problem, the set of input points is partitioned into categories; the answer to a query is a piece of information about categories of points in a query range. In this article, we describe several new results for one- and two-dimensional range-searching problems. We obtain an optimal adaptive data structure for counting the number of objects in a three-sided range and for counting categories of objects in a one-dimensional range. We also obtain new results on color range reporting in two dimensions, approximate color counting in one dimension, and some other related problems.