Implementation and Analysis of Collision Counting LSH on The Husky Framework

Locality sensitive hashing (LSH) have been an important topic when it comes to approximation nearest neighbor search problems. Over the past decades, many algorithms has evolved from the original LSH. During this summer research project, we aim to understand the difference between E2LSH and C2LSH. Furthermore, we want to overcome the challenge of LSH on distributing systems and build C2LSH on open source distributed system framework: Husky. The implementation was then verified and analyzed over both algorithms.