Distributed similarity search in high dimensions using locality sensitive hashing

Citations Over TimeTop 10% of 2009 papers

Abstract

In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH) which has proven very efficient in answering KNN queries in centralized settings. We consider mappings from the multi-dimensional LSH bucket space to the linearly ordered set of peers that jointly maintain the indexed data and derive requirements to achieve high quality search results and limit the number of network accesses. We put forward two such mappings that come with these salient properties: being locality preserving so that buckets likely to hold similar data are stored on the same or neighboring peers and having a predictable output distribution to ensure fair load balancing. We show how to leverage the linearly aligned data for efficient KNN search and how to efficiently process range queries which is, to the best of our knowledge, not possible in existing LSH schemes. We show by comprehensive performance evaluations using real world data that our approach brings major performance and accuracy gains compared to state-of-the-art.

Related Papers

• → Depth-first k-nearest neighbor finding using the MaxNearestDist estimator(2004)19 cited
• → Theoretical analysis on pruning nearest neighbor candidates by locality sensitive hashing(2010)
• Research of Bichromatic Reverse Nearest Neighbor Search for Spatial Objects(2009)
• An Approximate k-Nearest Neighbor Search Algorithm for Content- Based Multimedia Information Retrieval(2000)