Intensive KDB-Tree:一种有效的高维数据索引结构

Intensive KDB-Tree:An Effective High-dimensional Indexing Structure

本文并提出了高维空间中一种新的索引结构Intensive KDB-Tree,它采用一种新的数据插入算法和新的分裂策略,进而减小了索引结构,最后经实验证明,Intensive KDB-Tree的检索性能优于金字塔技术和KDB-Tree。

This paper analyzes the performance of static partitioning strategy and dynamic partitioning strategy in high-dimensional spaces.Our new index scheme can increase the storage utilization and reduce the index size to a smaller scale.As a result,our indexing method outperforms the Pyramid Technique and KDB-Tree and its variants.