R-tree

thumb|400px|right|Simple example of an R-tree for 2D rectangles thumb|400px|right|Visualization of an R*-tree for 3D points using ELKI (the [[cuboids are directory pages)]]

In data processing R*-trees are a variant of R-trees used for indexing spatial information. R*-trees have slightly higher construction cost than standard R-trees, as the data may need to be reinserted; but the resulting tree will usually have a better query performance. Like the standard R-tree, it can store both point and spatial data. It was proposed by Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger in 1990.