DBScholar

Back to papers

R-Trees: A Dynamic Index Structure For Spatial Searching

Summary: R-tree, a dynamic index for multidimensional spatial data; supports non-zero sized objects with bounding rectangles. Algorithms for search and update; empirical tests show strong performance and applicability to modern spatial DBs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h52759c68d03cd902
Venue
SIGMOD
Year
1984
Pagerank
0.0019892478
Overall Rank
2 | 99.99%
DOI
10.1145/602259.602266

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{guttman_sigmod84,
        title = {{R-TREES: A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING}},
        author = {Guttman, Antonin},
        series = {{SIGMOD} '84},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/602259.602266},
        url = {https://dl.acm.org/doi/10.1145/602259.602266},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 385 citing papers.

Rank Citing Paper Year Venue Pagerank
3,315 Fast Time-Series Searching with Scaling and Shifting 1999 PODS 7.4155055e-05
3,330 Efficient k-NN Search on Vertically Decomposed Data 2002 SIGMOD 7.406702e-05
3,354 Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees 1995 SIGMOD 7.3666926e-05
3,388 RINSE: Interactive Data Series Exploration with ADS+ 2015 VLDB 7.3299881e-05
3,454 Cubetree: Organization of and Bulk Incremental Updates on the Data Cube 1997 SIGMOD 7.270801e-05
3,552 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.1888282e-05
3,563 Interactive Analysis of Web-Scale Data 2009 CIDR 7.1841298e-05
3,629 TASTI: Semantic Indexes for Machine Learning-based Queries over Unstructured Data 2022 SIGMOD 7.1286458e-05
3,678 The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree 2004 SIGMOD 7.0857938e-05
3,784 Efficient Reverse k-Nearest Neighbor Search in Arbitrary Metric Spaces 2006 SIGMOD 7.0012942e-05
3,814 UlTraMan: A Unified Platform for Big Trajectory Data Management and Analytics 2018 VLDB 6.9867936e-05
3,825 Spatial Online Sampling and Aggregation 2016 VLDB 6.9795872e-05
3,836 RE-Tree: An Efficient Index Structure for Regular Expressions 2002 VLDB 6.9709019e-05
3,851 Query Processing Method for Multi-Attribute Clustered Relations 1990 VLDB 6.9637995e-05
3,870 OODB Indexing by Class-Division 1995 SIGMOD 6.9416637e-05
3,920 FALCON: Feedback Adaptive Loop for Content-Based Retrieval 2000 VLDB 6.906071e-05
4,065 Tight bounds for 2-dimensional indexing schemes 1998 PODS 6.8104677e-05
4,105 Learning User Preferences By Adaptive Pairwise Comparison 2015 VLDB 6.7918403e-05
4,170 Analysis of n-dimensional Quadtrees Using the Hausdorff Fractal Dimension 1996 VLDB 6.7515441e-05
4,368 UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search 2025 VLDB 6.6237291e-05
4,375 Searching Trajectories by Locations - An Efficiency Study 2010 SIGMOD 6.6172049e-05
4,391 An Evaluation of Generic Bulk Loading Techniques 2001 VLDB 6.6093384e-05
4,454 Anonymization of Set-Valued Data via Top-Down, Local Generalization 2009 VLDB 6.577479e-05
4,498 Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams 2007 VLDB 6.5590284e-05
4,592 Collective Spatial Keyword Querying 2011 SIGMOD 6.5016975e-05
4,685 Supporting Frequent Updates in R-Trees: A Bottom-Up Approach 2003 VLDB 6.4533027e-05
4,693 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4490657e-05
4,733 On Indexing Line Segments 1990 VLDB 6.4311314e-05
4,749 Finding Near Neighbors Through Cluster Pruning 2007 PODS 6.423839e-05
4,821 Reverse Spatial and Textual k Nearest Neighbor Search 2011 SIGMOD 6.3876508e-05
4,828 Nearest-Neighbor Searching Under Uncertainty 2012 PODS 6.3849385e-05
4,863 An Experimental Analysis of Iterated Spatial Joins in Main Memory 2013 VLDB 6.3631681e-05
4,873 Neighbor-Sensitive Hashing 2016 VLDB 6.3580715e-05
4,879 The RLR-Tree: A Reinforcement Learning Based R-Tree for Spatial Data 2023 SIGMOD 6.3567479e-05
4,894 Durable Top-k Search in Document Archives 2010 SIGMOD 6.3498658e-05
4,897 Design Tradeoffs of Data Access Methods 2016 SIGMOD 6.3489205e-05
4,954 Integration of Spatial Join Algorithms for Processing Multiple Inputs 1999 SIGMOD 6.3263552e-05
4,980 TOUCH: In-Memory Spatial Join by Hierarchical Data-Oriented Partitioning 2013 SIGMOD 6.3167773e-05
5,010 Indexing Large Human-Motion Databases 2004 VLDB 6.3030754e-05
5,013 Indexing for Interactive Exploration of Big Data Series 2014 SIGMOD 6.30259e-05
5,050 A General Solution of the n-dimensional B-tree Problem 1995 SIGMOD 6.2866655e-05
5,084 The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries 2008 VLDB 6.2674446e-05
5,183 LightDB: A DBMS for Virtual Reality Video 2018 VLDB 6.2236736e-05
5,190 Toward Practical Constraint Databases 1993 VLDB 6.2213007e-05
5,224 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 6.2100595e-05
5,302 High-Performance Extensible Indexing 1999 VLDB 6.1759848e-05
5,313 Twin Grid Files: Space Optimizing Access Schemes 1988 SIGMOD 6.1696238e-05
5,350 Filter Trees for Managing Spatial Data Over a Range of Size Granularities 1996 VLDB 6.1545256e-05
5,360 FINCH: Evaluating Reverse k-Nearest-Neighbor Queries on Location Data 2008 VLDB 6.1498141e-05
5,432 GTS: GPU-based Tree Index for Fast Similarity Search 2024 SIGMOD 6.1176015e-05
Previous Page 4 / 8 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
8 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.00081207565
113 Interval Hierarchies And Their Application To Predicate Files 1977 SIGMOD 0.00032096323
Previous Page 1 / 1 Next

Semantically Similar Papers