基于γ划分策略的高维索引结构  

High-dimensional indexing structure based on γ splitting strategy

作　　者：王淑娥[1] 孙劲光[1] 

机构地区：[1]辽宁工程技术大学电子与信息工程学院,辽宁葫芦岛125105

出　　处：《计算机应用》2008年第10期2565-2568,共4页journal of Computer Applications

摘　　要：提出了一种压缩金字塔树,将d维数据空间划分为2d个金字塔,由于在低维空间中无效的信息在高维数据空间中往往无效,采用γ划分策略对低维空间中的数据进行压缩,减小索引结构,克服了金字塔技术的缺点。给出了压缩金字塔树的构造方法以及基于压缩金字塔树的查询算法。实验证明,压缩金字塔树是一种有效的空间划分策略,在高维稀疏空间有良好的性能。An effective index structure was 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 invalid in low-dimensional spaces are usually invalid in high-dimensional spaces. In the process of spatial division, the γ division strategy was used to carry out the data compression. It reduced the index structure, and overcame the pyramid technology＇s shortcomings. The construction method and inquiry algorithm of pyramid tree were given. The experiments prove that compact pyramid technology is an effective spatial division strategy, and has good performance in high-dimensional skew space.

关 键 词：压缩金字塔树 高维数据空间 γ划分策略 索引结构 金字塔技术 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]