DBScholar

Back to papers

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)

Paper ID
2558
Venue
SIGMOD
Year
1990
Pagerank
0.001157935
Overall Rank
4 | 99.98%
DOI
10.1145/93597.98741

Incoming Non-self Citations Over Time

Authors

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 279 citing papers.

Rank Citing Paper Year Venue Pagerank
1,219 Processing Queries By Linear Constraints 1997 PODS 0.00011620957
1,281 Continuous Nearest Neighbor Search 2002 VLDB 0.00011349245
1,370 Towards an Analysis of Range Query Performance in Spatial Data Structures 1993 PODS 0.00010997795
1,373 A Model for the Prediction of R-tree Performance 1996 PODS 0.0001098638
1,418 LISA: A Learned Index Structure for Spatial Data 2020 SIGMOD 0.00010835539
1,486 Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions 2005 VLDB 0.00010625076
1,507 Column Imprints: A Secondary Index Structure 2013 SIGMOD 0.0001054177
1,517 Building a Scalable Geo-Spatial DBMS: Technology, Implementation, and Evaluation 1997 SIGMOD 0.00010520118
1,523 Efficient Structural Joins on Indexed XML Documents 2002 VLDB 0.00010502089
1,525 Incremental Distance Join Algorithms for Spatial Databases 1998 SIGMOD 0.00010493702
1,546 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010407159
1,561 Efficient Searching with Linear Constraints (Extended Abstract) 1998 PODS 0.00010361147
1,572 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.00010329197
1,612 Reverse kNN Search in Arbitrary Dimensionality 2004 VLDB 0.00010218134
1,636 Relaxing Join and Selection Queries 2006 VLDB 0.00010156479
1,685 Closest Pair Queries in Spatial Databases 2000 SIGMOD 0.00010017073
1,687 Spreadsheets in RDBMS for OLAP 2003 SIGMOD 0.00010005718
1,698 A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects 2005 SIGMOD 9.980335e-05
1,742 ArrayStore: A Storage Manager for Complex Parallel Array Processing 2011 SIGMOD 9.8748669e-05
1,776 Efficient User-Adaptable Similarity Search in Large Multimedia Databases 1997 VLDB 9.7853414e-05
1,778 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 9.7769047e-05
1,819 Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects 2009 VLDB 9.6810907e-05
1,840 Effectively Learning Spatial Indices 2020 VLDB 9.6404567e-05
1,847 Efficient Computation of Reverse Skyline Queries 2007 VLDB 9.6252055e-05
1,862 MindReader: Querying databases through multiple examples 1998 VLDB 9.5951515e-05
1,880 Scalable Sweeping-Based Spatial Join 1998 VLDB 9.5562066e-05
1,901 A Generic Approach to Bulk Loading Multidimensional Index Structures 1997 VLDB 9.5068846e-05
1,907 Incremental Clustering for Mining in a Data Warehousing Environment 1998 VLDB 9.501636e-05
1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 9.4561907e-05
1,978 Optimizing Multidimensional Index Trees for Main Memory Access 2001 SIGMOD 9.3627341e-05
2,020 Query and Update Efficient B+-Tree Based Indexing of Moving Objects 2004 VLDB 9.2983514e-05
2,101 A Cost Model for Similarity Queries in Metric Spaces 1998 PODS 9.1657486e-05
2,127 Selectivity Estimation in Spatial Databases 1999 SIGMOD 9.127762e-05
2,168 A Qualitative Comparison Study of Data Structures for Large Line Segment Databases 1992 SIGMOD 9.0469646e-05
2,254 STRIPES: An Efficient Index for Predicted Trajectories 2004 SIGMOD 8.8603695e-05
2,310 Spatial Joins Using Seeded Trees 1994 SIGMOD 8.7650894e-05
2,327 Capacity Constrained Assignment in Spatial Databases 2008 SIGMOD 8.7476945e-05
2,341 Parallel R-trees 1992 SIGMOD 8.7233426e-05
2,349 On Efficient Spatial Matching 2007 VLDB 8.7115756e-05
2,534 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.4561875e-05
2,548 Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations 1997 VLDB 8.432498e-05
2,648 On Effective Multi-Dimensional Indexing for Strings 2000 SIGMOD 8.2957097e-05
2,659 Identifying Similarities, Periodicities and Bursts for Online Search Queries 2004 SIGMOD 8.286986e-05
2,676 Efficient Numerical Error Bounding for Replicated Network Services 2000 VLDB 8.2705376e-05
2,734 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.190416e-05
2,774 Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension 1995 VLDB 8.1372328e-05
2,776 Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data 1991 SIGMOD 8.1356669e-05
2,853 Indexing Large Trajectory Data Sets With SETI* 2003 CIDR 8.0383547e-05
2,886 Approximate NN Queries on Streams with Guaranteed Error/performance Bounds 2004 VLDB 7.9957585e-05
2,974 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD 7.9083221e-05
Previous Page 2 / 6 Next

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.0020210012
116 Direct Spatial Search on Pictorial Databases Using Packed R-trees 1985 SIGMOD 0.0003221055
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 9,887 Adaptive Indexing of Objects with Spatial Extent 2023 VLDB
2 936 The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems 1990 VLDB
3 7,151 Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability 2018 VLDB
4 145 Efficient Processing of Spatial Joins Using R-trees 1993 SIGMOD
5 2,974 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD
6 3,593 The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree 2004 SIGMOD
7 1,373 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 42 The R+-Tree: A Dynamic Multi-Dimensional Index for Objects 1987 VLDB
10 1,814 Analysis Of Object Oriented Spatial Access Methods 1987 SIGMOD