High-dimensional indexing structure based on γ splitting strategy

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.