压缩金字塔树:有效的高维数据索引结构

Compact pyramid tree:Effective index structure in high-dimensional data spaces

提出了一种压缩金字塔树,基本思想是,首先将d维数据空间划分为2d个金字塔,由于在低维空间中无效的信息在高维数据空间中往往无效,采用γ划分策略对低维空间中的数据进行压缩,减小索引结构,解决了金字塔技术的缺点,给出了压缩金字塔树的插入、查询、删除算法。最后经实验证明,压缩金字塔树是一种有效的空间划分策略,在高维稀疏空间有良好的性能。

An effective index structure is proposed for high-dimensional data spaces：Compact pyramid tree.The basic idea is to divide the data space first into 2d pyramids sharing the center point of the space as a top.Its basic philosophy is：the data which is invalid in low-dimensional spaces are usually invalid in high-dimensional spaces.In the spatial division＇s process,use the γ, division strategy to carry on the compression to the data,which will reduce the index structure.It solves the pyramid technology＇s shortcoming,and gives the compact pyramid technology with insert,inquiry and delete algorithm,finally the experiment proves that compact pyramid technology is one kind of effective spatial division strategy, it has the good performance in the high-dimensional skew space.