Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Hilbert R-tree
open-in-new
<p>Hilbert R-tree, an <a href="/facts/R-tree/9X5AQWln">R-tree</a> 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 <a href="/facts/B%2B-tree/pzzUL70k">B+-tree</a> for multidimensional objects. </p><p>The performance of R-trees depends on the quality of the algorithm that clusters the data rectangles on a node. Hilbert R-trees use <a href="/facts/Space-filling_curve/b70uGLXh">space-filling curves</a>, and specifically the <a href="/facts/Hilbert_curve/bSEWkPDn">Hilbert curve</a>, to impose a linear ordering on the data rectangles. </p><p>There are two types of Hilbert R-trees: one for static databases, and one for dynamic <a href="/facts/Database/VYcpkevb">databases</a>. In both cases Hilbert space-filling curves are used to achieve better ordering of multidimensional objects in the node. This ordering has to be "good", in the sense that it should group "similar" data rectangles together, to minimize the area and perimeter of the resulting <a href="/facts/Minimum_bounding_rectangle/yfDEoK8d">minimum bounding rectangles</a> (MBRs). Packed Hilbert R-trees are suitable for static databases in which updates are very rare or in which there are no updates at all. </p><p>The dynamic Hilbert R-tree is suitable for dynamic databases where insertions, deletions, or updates may occur in real time. Moreover, dynamic Hilbert R-trees employ flexible deferred splitting mechanism to increase the space utilization. Every node has a well defined set of sibling nodes. This is done by proposing an ordering on the R-tree nodes. The Hilbert R-tree sorts rectangles according to the Hilbert value of the center of the rectangles (i.e., MBR). (The Hilbert value of a point is the length of the Hilbert curve from the origin to the point.) Given the ordering, every node has a well-defined set of sibling nodes; thus, deferred splitting can be used. By adjusting the split policy, the Hilbert R-tree can achieve a degree of space utilization as high as desired. To the contrary, other R-tree variants have no control over the space utilization. </p>