Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
New data structures for orthogonal range queries
SIAM Journal on Computing
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
On the application of sheared retrieval to orthogonal range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Linear data structures for two types of range search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Filtering search: a new approach to query answering
SIAM Journal on Computing
Lower bounds for dynamic range query problems that permit subtraction
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Reduced memory space for multi-dimensional search trees
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Quintary trees: a file structure for multidimensional datbase sytems
ACM Transactions on Database Systems (TODS)
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
Dynamization of geometric data structures
SCG '85 Proceedings of the first annual symposium on Computational geometry
Multidimensional divide-and-conquer
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Efficient processing of relational calculus expressions using range query theory
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Fractional Cascading: A Data Structuring Technique with Geometric Applications
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A compendium of key search references
ACM SIGIR Forum
Quasilinear algorithms for processing relational calculus expressions (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Space efficient dynamic orthogonal range reporting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
| Hi-index | 0.00 |
An orthogonal query that asks to aggregate the set of records in k-dimensional box regions is studied, and it is shown that space O(N((log N)/(log log N))k-1) makes possible a combined time complexity O(logkN ) for retrievals, insertions, and deletions.