A New Indexing Method for High Dimensional Dataset

Indexing high dimensional datasets has attracted extensive attention from many researchers in the last decade. Since R-tree type of index structures are known as suffering “curse of dimensionality” problems, Pyramid-tree type of index structures, which are based on the B-tree, have been proposed to break the curse of dimensionality. However, for high dimensional data, the number of pyramids is often insufficient to discriminate data points when the number of dimensions is high. Its effectiveness degrades dramatically with the increase of dimensionality. In this paper, we focus on one particular issue of “curse of dimensionality”; that is, the surface of a hypercube in a high dimensional space approaches 100% of the total hypercube volume when the number of dimensions approaches infinite. We propose a new indexing method based on the surface of dimensionality. We prove that the Pyramid tree technology is a special case of our method. The results of our experiments demonstrate cl...

• Type: Conference
• Year: 2005
• Where: DASFAA
• Authors: Jiyuan An, Yi-Ping Phoebe Chen, Qinying Xu, Xiaofang Zhou
• Keywords: DASFAA 2005, Database, Dimensions Approaches Infinite, Index Structures, Total Hypercube Volume