On R-trees with low query complexity

Authors:
M. de Berg;J. Gudmundsson;M. Hammar;M. Overmars
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands;Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands;Departmento di Informatica ed Applicazion, Universita di Salerno, Baronissi (SA) - 84081, Italy;Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands
Venue:
Computational Geometry: Theory and Applications
Year:
2003

Citing 12
Cited 5

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Analysis of object oriented spatial access methods

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The input/output complexity of sorting and related problems

Communications of the ACM
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
Multidimensional access methods

ACM Computing Surveys (CSUR)
Analysis of a bounding box heuristic for object intersection

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Direct spatial search on pictorial databases using packed R-trees

SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Implementation and Performance Analysis of Spatial Data Access Methods

Proceedings of the Fifth International Conference on Data Engineering
Enclosing Many Boxes by an Optimal Pair of Boxes

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Spatial Data Structures: Concepts and Design Choices

Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
External memory data structures

Handbook of massive data sets

Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science
Efficient c-oriented range searching with DOP-trees

Computational Geometry: Theory and Applications
Fast regridding of large, complex geospatial datasets

Proceedings of the 2nd International Conference on Computing for Geospatial Research & Applications
Orthogonal subdivisions with low stabbing numbers

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Spatiotemporal indexing for moving objects in an indoor cellular space

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The R-tree is a well-known bounding-volume hierarchy that is suitable for storing geometric data on secondary memory. Unfortunately, no good analysis of its query time exists. We describe a new algorithm to construct an R-tree for a set of planar objects that has provably good query complexity for point location queries and range queries with ranges of small width. For certain important special cases, our bounds are optimal. We also show how to update the structure dynamically, and we generalize our results to higher-dimensional spaces.