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
2295
Venue
SIGMOD
Year
1984
Pagerank
0.0020210012
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 381 citing papers.

Rank Citing Paper Year Venue Pagerank
3,295 Lightning Fast and Space Efficient Inequality Joins 2015 VLDB 7.5477715e-05
3,322 RINSE: Interactive Data Series Exploration with ADS+ 2015 VLDB 7.5213802e-05
3,335 Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search 2024 SIGMOD 7.5098031e-05
3,363 Efficient k-NN Search on Vertically Decomposed Data 2002 SIGMOD 7.4808966e-05
3,379 Cubetree: Organization of and Bulk Incremental Updates on the Data Cube 1997 SIGMOD 7.4582502e-05
3,497 Interactive Analysis of Web-Scale Data 2009 CIDR 7.3634378e-05
3,593 The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree 2004 SIGMOD 7.2750277e-05
3,710 Efficient Reverse k-Nearest Neighbor Search in Arbitrary Metric Spaces 2006 SIGMOD 7.1780127e-05
3,741 Spatial Online Sampling and Aggregation 2016 VLDB 7.1586403e-05
3,742 RE-Tree: An Efficient Index Structure for Regular Expressions 2002 VLDB 7.1577657e-05
3,766 TASTI: Semantic Indexes for Machine Learning-based Queries over Unstructured Data 2022 SIGMOD 7.1430942e-05
3,771 Query Processing Method for Multi-Attribute Clustered Relations 1990 VLDB 7.1391812e-05
3,790 OODB Indexing by Class-Division 1995 SIGMOD 7.1239529e-05
3,835 FALCON: Feedback Adaptive Loop for Content-Based Retrieval 2000 VLDB 7.0835179e-05
3,858 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.067591e-05
3,972 Tight bounds for 2-dimensional indexing schemes 1998 PODS 6.9814651e-05
3,984 Learning User Preferences By Adaptive Pairwise Comparison 2015 VLDB 6.9739437e-05
4,070 Analysis of n-dimensional Quadtrees Using the Hausdorff Fractal Dimension 1996 VLDB 6.9272604e-05
4,316 Searching Trajectories by Locations - An Efficiency Study 2010 SIGMOD 6.7647222e-05
4,344 Anonymization of Set-Valued Data via Top-Down, Local Generalization 2009 VLDB 6.7522581e-05
4,381 Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams 2007 VLDB 6.7333392e-05
4,475 UlTraMan: A Unified Platform for Big Trajectory Data Management and Analytics 2018 VLDB 6.6803264e-05
4,486 Collective Spatial Keyword Querying 2011 SIGMOD 6.6693992e-05
4,569 Supporting Frequent Updates in R-Trees: A Bottom-Up Approach 2003 VLDB 6.6255507e-05
4,620 On Indexing Line Segments 1990 VLDB 6.6025691e-05
4,657 Finding Near Neighbors Through Cluster Pruning 2007 PODS 6.5830079e-05
4,665 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.5780693e-05
4,711 Reverse Spatial and Textual k Nearest Neighbor Search 2011 SIGMOD 6.5506926e-05
4,740 An Experimental Analysis of Iterated Spatial Joins in Main Memory 2013 VLDB 6.5283833e-05
4,751 The RLR-Tree: A Reinforcement Learning Based R-Tree for Spatial Data 2023 SIGMOD 6.5241784e-05
4,765 Durable Top-k Search in Document Archives 2010 SIGMOD 6.5186944e-05
4,815 Integration of Spatial Join Algorithms for Processing Multiple Inputs 1999 SIGMOD 6.4949956e-05
4,826 Design Tradeoffs of Data Access Methods 2016 SIGMOD 6.4904836e-05
4,844 TOUCH: In-Memory Spatial Join by Hierarchical Data-Oriented Partitioning 2013 SIGMOD 6.4826356e-05
4,850 Nearest-Neighbor Searching Under Uncertainty 2012 PODS 6.480347e-05
4,867 Indexing Large Human-Motion Databases 2004 VLDB 6.4720439e-05
4,883 Indexing for Interactive Exploration of Big Data Series 2014 SIGMOD 6.4648124e-05
4,914 A General Solution of the n-dimensional B-tree Problem 1995 SIGMOD 6.4477987e-05
4,927 Neighbor-Sensitive Hashing 2016 VLDB 6.4426453e-05
4,937 The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries 2008 VLDB 6.4350791e-05
5,046 Toward Practical Constraint Databases 1993 VLDB 6.3879316e-05
5,098 LightDB: A DBMS for Virtual Reality Video 2018 VLDB 6.3652221e-05
5,118 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 6.3580186e-05
5,173 High-Performance Extensible Indexing 1999 VLDB 6.3341007e-05
5,183 Twin Grid Files: Space Optimizing Access Schemes 1988 SIGMOD 6.3286498e-05
5,202 Filter Trees for Managing Spatial Data Over a Range of Size Granularities 1996 VLDB 6.3194496e-05
5,304 An Evaluation of Generic Bulk Loading Techniques 2001 VLDB 6.2733516e-05
5,395 AQWA: Adaptive Query-Workload-Aware Partitioning of Big Spatial Data 2015 VLDB 6.2331619e-05
5,405 GORDER: An Efficient Method for KNN Join Processing 2004 VLDB 6.2291247e-05
5,448 Database Support for Knowledge-Based Image Evaluation 1987 VLDB 6.2147169e-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.00082404462
113 Interval Hierarchies And Their Application To Predicate Files 1977 SIGMOD 0.00032684992
Previous Page 1 / 1 Next

Semantically Similar Papers