Hilbert R-tree
Hilbert R-tree, an R-tree variant, is an index for multidimensional objects such as lines, regions, 3-D objects, or high-dimensional feature-based parametric objects. It can be thought of as an extension to B+-tree for multidimensional objects. The performance of R-trees depends on the quality of the algorithm that clusters the data rectangles on a node. Hilbert R-trees use space-filling curves, and specifically the Hilbert curve, to impose a linear ordering on the data rectangles.
Link from a Wikipage to another Wikipage
primaryTopic
Hilbert R-tree
Hilbert R-tree, an R-tree variant, is an index for multidimensional objects such as lines, regions, 3-D objects, or high-dimensional feature-based parametric objects. It can be thought of as an extension to B+-tree for multidimensional objects. The performance of R-trees depends on the quality of the algorithm that clusters the data rectangles on a node. Hilbert R-trees use space-filling curves, and specifically the Hilbert curve, to impose a linear ordering on the data rectangles.
has abstract
Hilbert R-tree, an R-tree vari ...... ol over the space utilization.
@en
R-дерево Гильберта, вариант R- ...... я над обработкой пространства.
@ru
Wikipage page ID
12,039,643
page length (characters) of wiki page
Wikipage revision ID
1,013,722,915
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
Hilbert R-tree, an R-tree vari ...... dering on the data rectangles.
@en
R-дерево Гильберта, вариант R- ...... ния объектов в прямоугольники.
@ru
label
Hilbert R-tree
@en
R-дерево Гильберта
@ru