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
Reduced memory space for multi-dimensional search trees
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Space-time tradeoffs for orthogonal range queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
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
Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract)
Proceedings of the 11th Colloquium on Automata, Languages and Programming
The Nearest Neighbor Problem on Bounded Domains
Proceedings of the 12th Colloquium on Automata, Languages and Programming
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
Algorithms in a restricted universe
Algorithms in a restricted universe
Implicit data structures for the weighted dictionary problem
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Slimming down search structures: A functional approach to algorithm design
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
Quasi-Valid range querying and its implications for nearest neighbor problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
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
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Algorithms and theory of computation handbook
| Hi-index | 0.00 |
We propose a new search technique, called the Shear-Based Format, which shows that Yao's lower bound on the time-space tradeoff for orthogonal range queries is either optimal or nearly optimal [Ya82, Ya85]. Shearing is also a very pragmatic technique.