关键词: 高维数据空间, 压缩KDB树, 分裂策略, 动态索引结构

Abstract: An effective index structure is proposed for high-dimensional data spaces：CKDB-Tree（Compact KDB-Tree）.The index structure uses one kind of new partitioning strategy.During the insert processing，this paper introduces the safe-inserted-node and safe-deleted node concept into the structure，which is not only considering the current node，but also considering the future node.This paper gives the definition of the CKDB-Tree and the character of the node；it also gives the algorithm of the insert，the search and the delete operation；then gives the analysis and the inference to the index structure’s memory property；finally，the experiment proves that CKDB-Tree is one kind of effective dynamic index structure in the high-dimensional spaces.

Key words: high-dimensional data space, Compact KDB-Tree, splitting policy, dynamic index structure