超正交良好折叠Hilbert曲线
Hyperorthogonal well-folded Hilbert curves
摘要:
R树可用于存储和查询二维或多维的点数据集。Kamel和Faloutsos提出了一种简单的方法来构造和维护二维点的R-树,即保持点沿着希尔伯特曲线出现的顺序。然后R树将沿着曲线的连续部分存储点的边界框,并且R树的效率取决于边界框的大小-越小越好。由于有许多不同的方法可以将希尔伯特曲线推广到更高的维度,这就提出了一个问题,即推广的结果是最小的边界框。熟悉的方法,如Butz的方法,可能会导致曲线部分的边界框比曲线部分所穿过的体积大$Ω(2^{d/2})$倍。由这种边界框界定的大部分体积将不包含任何数据点。在本文中,我们提出了一种新的方法推广希尔伯特曲线到更高的维度,这将导致更紧密的边界框:他们有最多4倍的体积的曲线覆盖的部分,独立的维数。此外,我们证明了因子4是渐近最优的。
英文摘要:
R-trees can be used to store and query sets of point data in two or more dimensions. An easy way to construct and maintain R-trees for two-dimensional points, due to Kamel and Faloutsos, is to keep the points in the order in which they appear along the Hilbert curve. The R-tree will then store bounding boxes of points along contiguous sections of the curve, and the efficiency of the R-tree depends on the size of the bounding boxes---smaller is better. Since there are many different ways to generalize the Hilbert curve to higher dimensions, this raises the question which generalization results in the smallest bounding boxes. Familiar methods, such as the one by Butz, can result in curve sections whose bounding boxes are a factor $Ω(2^{d/2})$ larger than the volume traversed by that section of the curve. Most of the volume bounded by such bounding boxes would not contain any data points. In this paper we present a new way of generalizing Hilbert's curve to higher dimensions, which results in much tighter bounding boxes: they have at most 4 times the volume of the part of the curve covered, independent of the number of dimensions. Moreover, we prove that a factor 4 is asymptotically optimal.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。