Definition: A spatial access method which splits space in hierarchically nested, possibly overlapping, boxes. The tree is height-balanced. It is similar to the R-tree, but reinserts entries upon overflow, rather than splitting.
Note: After [GG98].
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 23 February 2010.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "R*-tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 23 February 2010. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/rstartree.html