【摘要】 被视为破解“维度灾”的金字塔技术是有效的高维空间数据索引方法之一,它是基于一种依赖数据维度的非平均分割策略,先对d维数据按维度进行空间分割成具有公共顶点的2d个金字塔,然后提供d维数据点到1维金字塔值的一一映射,通过一种有序的一维索引结构建立有效的索引。文章结合高维数据空间索引的建立,提出金字塔技术所依赖的维度的选维策略和域外插入处理所需的适应性处理方法,实际效果较好。更多还原

【Abstract】 The Pyramid-Technique is based on a special partitioning strategy which is said to break the curse of di-mensionality.The basic idea is to divide the data space first into2d pyramids sharing the center point of the space as a top.In a second step,the single pyramids are cut into slices parallel to the basis of the pyramid.These slices form the data pages.Furthermore,it shows that this partition provides a mapping from the given d-dimensional space to a l-di-mensional space.Therefore,it is able to use a B+-tree to manage the transformed data.In this paper,the dimensionality choice and out-field processing are discussed according indexing high-dimensional data spaces.更多还原