The R*-tree: An Efficient and Robust Access Method for Points and Rectangles
Summary: R*-tree: joint optimization of area, margin, and overlap in inner nodes for rectangles and multidimensional points. Extensive experiments on a standardized testbed show it outperforms Guttman’s linear/quadratic R-trees and Greene’s variant across point/rectangle queries and map overlay, with efficient data support and only modest implementation cost. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Norbert Beckmann (University of Bremen)
- 2. Hans-Peter Kriegel (University of Bremen)
- 3. Ralf Schneider (University of Bremen)
- 4. Bernhard Seeger (University of Bremen)
BibTeX Citation
@inproceedings{beckmann_sigmod90,
title = {{The R*-tree: An Efficient and Robust Access Method for Points and Rectangles}},
author = {Beckmann, Norbert and Kriegel, Hans-Peter and Schneider, Ralf and Seeger, Bernhard},
series = {{SIGMOD} '90},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/93597.98741},
url = {https://dl.acm.org/doi/10.1145/93597.98741},
year = {1990}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 281 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.001992968 |
| 116 | Direct Spatial Search on Pictorial Databases Using Packed R-trees | 1985 | SIGMOD | 0.00031645463 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,048 | Adaptive Indexing of Objects with Spatial Extent | 2023 | VLDB |
| 2 | 965 | The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems | 1990 | VLDB |
| 3 | 7,303 | Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability | 2018 | VLDB |
| 4 | 146 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD |
| 5 | 3,034 | A Revised R*-tree in Comparison with Related Index Structures | 2009 | SIGMOD |
| 6 | 3,669 | The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree | 2004 | SIGMOD |
| 7 | 1,405 | A Model for the Prediction of R-tree Performance | 1996 | PODS |
| 8 | 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD |
| 9 | 44 | The R+-Tree: A Dynamic Multi-Dimensional Index for Objects | 1987 | VLDB |
| 10 | 1,861 | Analysis Of Object Oriented Spatial Access Methods | 1987 | SIGMOD |