Efficient Distributed Locality Sensitive Hashing

  title={Efficient Distributed Locality Sensitive Hashing},
  author={Bahman Bahmani and Ashish Goel and Rajendra Shinde},
Distributed frameworks are gaining increasingly widespread use in applications that process large amounts of data. One important example application is large scale similarity search, for which Locality Sensitive Hashing (LSH) has emerged as the method of choice, specially when the data is high-dimensional. To guarantee high search quality, the LSH scheme needs a rather large number of hash tables. This entails a large space requirement, and in the distributed setting, with each query requiring… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.
28 Citations
0 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 28 extracted citations

Similar Papers

Loading similar papers…