Distributed Locality Sensitivity Hashing

@article{Wadhwa2010DistributedLS,
  title={Distributed Locality Sensitivity Hashing},
  author={Smita Wadhwa and Pawan Gupta},
  journal={2010 7th IEEE Consumer Communications and Networking Conference},
  year={2010},
  pages={1-4}
}
In this paper, we present DLSH Distributed Locality Sensitive Hashing, a similar-data search technology. The huge growth in the size of video content has broken the traditional multi-media index hosting and look-up solutions, these are not able to scale to the size of the current and projected index requirements. Distributed LSH (D-LSH) addresses this need of a highly scalable multi-media index. DLSH performs better for finding approximate near neighbors on extremely large scales, as DLSH… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

Parallelization of Error Weighted Hashing for Approximate k-Nearest Neighbour Search on GPU-CPU Hybrid

  • 2016 IEEE 2nd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing (HPSC), and IEEE International Conference on Intelligent Data and Security (IDS)
  • 2016
VIEW 4 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

Towards Load Balancing for LSH-based Distributed Similarity Indexing in High-Dimensional Space

  • 2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)
  • 2018
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

Pˇatras ̧cu. On the optimality of the dimensionality reduction method

A. Andoni, P. Indyk
  • 2006

E2LSH 0.1 User Manual

A. Andoni, P. Indyk
  • Jun. 2005.[Online].Available:http://web.mit.edu/andoni/www/LS H.
  • 2005

Approximating a finite metric by a small number of tree metrics

  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998

An optimal algorithm for approximate nearest neighbor searching

S. Arya, D.Mount, N. Netanyahu, R. Silverman, A.Wu
  • Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms,
  • 1994