Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Computational geometry: an introduction
Computational geometry: an introduction
A log log n data structure for three-sided range queries
Information Processing Letters
Efficient data structures for range searching on a grid
Journal of Algorithms
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
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
ACM Computing Surveys (CSUR)
The rectangle enclosure and point-dominance problems revisited
Proceedings of the eleventh annual symposium on Computational geometry
Indexing for data models with constraints and classes
Journal of Computer and System Sciences
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient 3-D range searching in external memory
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Direction relations and two-dimensional range queries: optimisation techniques
Data & Knowledge Engineering
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
Efficient cross-trees for external memory
External memory algorithms
ACM Computing Surveys (CSUR)
A unifying look at data structures
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Benchmarking Spatial Join Operations with Spatial Output
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Optimal Redundancy in Spatial Database Systems
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Range Searching
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Spatio-Temporal Indexing for Large Multimedia Applications
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Efficient processing of 3-sided range queries with probabilistic guarantees
Proceedings of the 13th International Conference on Database Theory
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
We consider the 2-dimensional space with integer coordinates in the range [1, N] × [1, N]. We present the MPST (Modified Priority Search Tree) index structure which reports the k points that lie inside the quadrant query range (- ¥, b) × (- ¥, c) in optimal O(k) time. Our Index Scheme is simple, fast and it can be used in various geometric or spatial applications such as: (1) 2 D dominance reporting on a grid (2) 2D maximal elements on a grid. Then, based on structures of Gabow et al. [6] and Beam and Fich [31] we describe an index scheme, which handles in an efficient way window queries in spatial database applications. In the general case in which the plane has real coordinates the above time results are slowed down by adding a logarithmic factor due to the normalization technique.