| R*-tree |
|---|
| Invented | 1990 |
|---|
| Invented by | Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger |
|---|
|
| Operation |
Average |
Worst case |
|---|
| Search |
O(log n) |
|
|---|
| Insert |
O(log n) |
|
|---|
|
| Space |
O(n) |
O(n) |
|---|
|
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.