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

Abstract: 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.

Key words: compact pyramid tree, high-dimensional data space, γ splitting strategy, indexing structure, pyramid technique