A hyperplane based indexing technique for high-dimensional data

  • Authors:

  • Guoren Wang;Xiangmin Zhou;Bin Wang;Baiyou Qiao;Donghong Han

  • Affiliations:

  • School of Information Science and Engineering, Northeastern University, 11-3, Wenhua Road, Heping District, Shenyang, Liaoning 110004, China;School of Information Science and Engineering, Northeastern University, 11-3, Wenhua Road, Heping District, Shenyang, Liaoning 110004, China;School of Information Science and Engineering, Northeastern University, 11-3, Wenhua Road, Heping District, Shenyang, Liaoning 110004, China;School of Information Science and Engineering, Northeastern University, 11-3, Wenhua Road, Heping District, Shenyang, Liaoning 110004, China;School of Information Science and Engineering, Northeastern University, 11-3, Wenhua Road, Heping District, Shenyang, Liaoning 110004, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.07

Visualization

Abstract

In this paper, we propose a novel hyperplane based indexing method to support efficient processing of similarity search queries in high-dimensional spaces. The main idea of the proposed index is to improve data partitioning efficiency in a high-dimensional space by using a hyperplane, which further partitions a subspace and can also take advantage of the twin node concept used in the key dimension based index. Compared with the key dimension concept, the hyperplane is more effective in data filtering. High space utilization is achieved by dynamically performing data reallocation between twin nodes. In addition, a post processing step is used after index building to ensure effective filtration. Extensive experiments based on two types of real data sets are conducted and the results illustrate a significantly improved filtering efficiency. Because of the feature of hyperplane, the proposed indexing method is only suitable to Euclidean spaces.