High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning

Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been focused on finding better approximate solutions that improve the locality of data using dimensionality reduction. However, it is possible to preserve the locality of data and find exact nearest neighbors in high dimensions without dimensionality reduction. This paper introduces a novel high-performance technique to find exact k-nearest neighbors in both low and high dimensional spaces. It relies on a new method for data-sensitive space partitioning based on explicit data clustering, which is introduced in the paper for the first time. This organization supports effective reduction of the search space before accessing secondary storage. Costly Euclidean distance calculations are reduced through efficient processing of a lightweight memory-based filter. The algorithm outperforms sequential scan and the VA-File ...

• Type: Conference
• Year: 2006
• Where: DEXA
• Authors: Sachin Kulkarni, Ratko Orlandic
• Keywords: Database, DEXA 2006, Dimensionality Reduction, Nearest Neighbor Search, Nearest Neighbors