Definition
The R-tree is an indexing scheme that has been originally proposed towards organizing spatial objects such as points, rectangles and polygons. It is a hierarchical data structure suitable to index objects in secondary storage (disk) as well as in main memory. The R-tree has been extensively used by researchers to offer efficient processing of queries in multi-dimensional data sets. Queries such as range, nearest-neighbor and spatial joins are supported efficiently leading to considerable decrease in computational and I/O time in comparison to previous approaches. The R-tree is capable of handling diverse types of objects, by using approximations. This means that an object is approximated by its minimum bounding rectangle (MBR) towards providing an efficient filtering step. Objects that survive the filtering step are inspected further for relevance in the refinement step. The advantages of the structure, its simplicity as well as its resemblance to the B+-tree “persuaded”...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Beckmann N, Kriegel HP, Seeger B. The R.*-tree: an efficient and robust method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1990. p. 322–31.
Berchtold S, Keim DA, Kriegel HP. The X-tree: an index structure for high-dimensional data. In: Proceedings of 22nd International Conference on Very Large Data Bases; 1996. p. 28–39.
Chen L, Choubey R, Rundensteiner EA. Bulk-insertions into R-trees using the small-tree-large-tree approach. In: Proceedings of 6th International Symposium on Advances in Geographic Information Systems; 1998. p. 161–2.
Choubey R, Chen L, Rundensteiner EA. GBI – a generalized R-tree bulk-insertion strategy. In: Proceedings of 6th International Symposium on Advances in Spatial Databases; 1999. p. 91–108.
Faloutsos C. Searching multimedia databases by content. Dordecht: Kluwer; 1996.
Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1984. p. 47–57.
Kamel I, Faloutsos C. On packing R-trees. In: Proceedings of the 2nd International Conference on Information and Knowledge Management; 1993. p. 490–9.
Kamel I, Faloutsos C. Hilbert R-tree – an improved R-tree using fractals. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 500–9.
Leutenegger S, Edgington JM, Lopez MA. STR – a simple and efficient algorithm for R-tree packing. In: Proceedings of the 13th International Conference on Data Engineering; 1997. p. 497–506.
Lin K, Jagadish HV, Faloutsos C. The TV-tree: an index structure for high-dimensional data. VLDB J. 1994;3(4):517–42.
Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y. R-trees: theory and applications. Berlin: Springer; 2006.
du Mouza C, Litwin W, Rigaux P. SD-Rtree: a scalable distributed R-tree. In: Proceedings of the 23rd International Conference on Data Engineering; 2007. p. 296–305.
Roussopoulos N, Leifker D. Direct spatial search on pictorial databases using packed R-trees. ACM SIGMOD Rec. 1985;14(4):17–31.
Sakurai Y, Yoshikawa M, Uemura S, Kojima H. Spatial indexing of high-dimensional data based on relative approximation. VLDB J. 2002;11(2):93–108.
Sellis T, Roussopoulos N, Faloutsos C. The R+-tree: a dynamic index for multidimensional objects. In: Proceedings of the 13th International Conference on Very Large Data Bases; 1987. p. 507–18.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Papadopoulos, A.N., Corral, A., Nanopoulos, A., Theodoridis, Y. (2018). R-Tree (and Family). In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_300
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_300
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering