R* tree
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.
R* tree
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.
has abstract
R*-trees are a variant of R-tr ...... , and Bernhard Seeger in 1990.
@en
R*树是R树的一种变体，可用来建立索引空间信息。R*树的构造 ...... Schneider，和Bernhard Seeger提出。
@zh
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
738,024,188
hypernym
comment
R*-trees are a variant of R-tr ...... , and Bernhard Seeger in 1990.
@en
R*树是R树的一种变体，可用来建立索引空间信息。R*树的构造 ...... Schneider，和Bernhard Seeger提出。
@zh
label
R* tree
@en
R*树
@zh
