R*-tree
A variant of R-trees used for indexing spatial information / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about R* tree?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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.[1]
Quick Facts Invented, Invented by ...
R*-tree | |||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Invented | 1990 | ||||||||||||||||||||
Invented by | Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger | ||||||||||||||||||||
|
Close