Synonyms
Spatial index structure; Spatial access method; R-tree; TPR-trees; Point query; Window query; Range query; Directory rectangles; Storage utilization; Reinsert, forced
Definition
The R*-tree, an improvement of the R-tree, is one of the most popular access methods for points and rectangles. This is achieved by modifying the insert and split algorithms of the original R-tree which is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. The R*-tree incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory. From a practical point of view, the R*-tree is very attractive because of the following two reasons. It efficiently supports point and spatial data at the same time and its implementation cost is only slightly higher than that of other R-tree variants.
Historical Background
The R*-tree, proposed in 1990, is one of the most prominent representatives of the R-tree family. One major reason...
Recommended Reading
Robinson, J.T.: The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In: Proc. of the 1981 ACM SIGMOD international conference on Management of data (SIGMOD'81), Ann Arbor, Michigan (1981)
Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: An adaptable, symmetric multikey file structure. ACM Trans Database Syst 9(1):38–71 (1984)
Seeger, B., Kriegel, H.-P.: The buddy tree: an efficient and robust access method for spatial data bases. In: Proceedings of 16th international conference on Very large databases (VLDB'90), Brisbane, Australia (1990) pp. 590–601
Berchtold, S., Keim, D.A., Kriegel, H.-P: The X-tree: An index structure for high-dimensional data. In: Proc. 22nd Int. Conf. on Very Large Data Bases (VLDB'96), Bombay, India (1996) pp. 28–39
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: SIGMOD Conference, (2000) pp. 331–342
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of the International Conference on Management of Data (SIGMOD'90), Atlantic City, NJ (1990) pp. 322–331
Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. of the 1984 ACM SIGMOD international conference on Management of data (SIGMOD'84), Boston, Massachusetts (1984) pp. 47–57
Roussopoulos, N., Leifker, D.: Direct spatial search on pictorial databases using packed R-trees. In: Proc. of the 1985 ACM SIGMOD international conference on Management of data (SIGMOD'85), Austin, Texas (1985) pp. 17–31
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Kriegel, HP., Kunath, P., Renz, M. (2008). R*-Tree. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_1148
Download citation
DOI: https://doi.org/10.1007/978-0-387-35973-1_1148
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30858-6
Online ISBN: 978-0-387-35973-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering