mlsanityData to 14 Oct 2026

Hashing for Similarity Search: A Survey

arXiv 1408.2927 ↗First posted 13 Aug 2014cs.DS cs.CV cs.DBcited by 34

Not on the map. Why?

Abstract (arXiv)

Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database. Various methods have been developed to address this problem, and recently a lot of efforts have been devoted to approximate search. In this paper, we present a survey on one of the main solutions, hashing, which has been widely studied since the pioneering work locality sensitive hashing. We divide the hashing algorithms two main categories: locality sensitive hashing, which designs hash functions without exploring the data distribution and learning to hash, which learns hash functions according the data distribution, and review them from various aspects, including hash function design and distance measure and search scheme in the hash coding space.

Key facts. Cited by 34 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Aug 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 11; 2022: 8; 2023: 3; 2024: 2; 2025: 8; 2026: 2.

34 papers.

Sort:

By area:

  1. 2021Multiplying Matrices Without Multiplyingcited by 30
  2. 2023Scalable Optimal Transport Methods in Machine Learning: A Contemporary Surveycited by 27
  3. 2022TPU-KNN: K Nearest Neighbor Search at Peak FLOP/scited by 18
  4. 2021OSCAR-Net: Object-centric Scene Graph Attention for Image Attributioncited by 15
  5. 2021Towards Visual Semanticscited by 12
  6. 2021Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and Morecited by 11
  7. 2021Accelerating Deep Learning Inference via Learned Cachescited by 8
  8. 2021VPN: Video Provenance Network for Robust Content Attributioncited by 7
  9. 2023Automating Nearest Neighbor Search Configuration with Constrained Optimizationcited by 7
  10. 2021For Manifold Learning, Deep Neural Networks can be Locality Sensitive Hash Functionscited by 6
  11. 2021Nearest neighbor search with compact codes: A decoder perspectivecited by 5
  12. 2023DeepLSH: Deep Locality-Sensitive Hash Learning for Fast and Efficient Near-Duplicate Crash Report Detectioncited by 3
22 more
  1. 2025Remote Inference over Dynamic Links via Adaptive Rate Deep Task-Oriented Vector Quantizationcited by 3
  2. 2022Asymmetric Hash Code Learning for Remote Sensing Image Retrievalcited by 2
  3. 2022Counterfactual Learning To Rank for Utility-Maximizing Query Autocompletioncited by 2
  4. 2022Deep Squared Euclidean Approximation to the Levenshtein Distance for DNA Storagecited by 2
  5. 2022A Lower Bound of Hash Codes' Performancecited by 2
  6. 2026Spruce: Scalable Private Outsourced Retrieval Using Compact Embeddingscited by 2
  7. 2021A novel shape matching descriptor for real-time hand gesture recognitioncited by 1
  8. 2021Cross-modal Zero-shot Hashing by Label Attributes Embeddingcited by 1
  9. 2022Unsupervised Space Partitioning for Nearest Neighbor Searchcited by 1
  10. 2022SImProv: Scalable Image Provenance Framework for Robust Content Attributioncited by 1
  11. 2025Synthetic Similarity Search in Automotive Productioncited by 1
  12. 2025Hashing-Baseline: Rethinking Hashing in the Age of Pretrained Modelscited by 1
  13. 2021A Hidden Challenge of Link Prediction: Which Pairs to Check?cited by 0
  14. 2022Smooth Anonymity for Sparse Graphscited by 0
  15. 2024Utilizing Low-Dimensional Molecular Embeddings for Rapid Chemical Similarity Searchcited by 0
  16. 2024Shot Segmentation Based on Von Neumann Entropy for Key Frame Extractioncited by 0
  17. 2025GARLIC: GAussian Representation LearnIng for spaCe partitioningcited by 0
  18. 2025A Faster Generalized Two-Stage Approximate Top-Kcited by 0
  19. 2025Infinity Search: Approximate Vector Search with Projections on q-Metric Spacescited by 0
  20. 2025LLM-Empowered Agentic MAC Protocols: A Dynamic Stackelberg Game Approachcited by 0
  21. 2025Contextual Tokenization for Graph Inverted Indicescited by 0
  22. 2026Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificatescited by 0