Wikitopia
Locality-Sensitive Hashing
conceptAlgorithm
Try in Playground →
Overview
Developed byPiotr Indyk and Rajeev Motwani
Founded1998
Use caseapproximate nearest neighbor search
Knowledge graph stats
Claims26
Avg confidence89%
Avg freshness99%
Last updatedUpdated 5 days ago
WikidataQ1756120
Trust distribution
100% unverified
Governance
Not assessed
Contribute governance data →

Locality-Sensitive Hashing

concept

Algorithmic technique for dimensionality reduction that preserves locality for efficient similarity search.

Compare with...

primary use case

ValueTrustConfidenceFreshnessSources
approximate nearest neighbor search○UnverifiedHighFresh1
approximate nearest neighbor search in high-dimensional spaces○UnverifiedHighFresh1
high-dimensional data similarity search○UnverifiedHighFresh1
dimensionality reduction for similarity search○UnverifiedHighFresh1
document similarity search○UnverifiedModerateFresh1
duplicate detection in large datasets○UnverifiedModerateFresh1
recommendation systems○UnverifiedModerateFresh1

based on

ValueTrustConfidenceFreshnessSources
hash functions that preserve locality○UnverifiedHighFresh1
hash functions that map similar items to same buckets with high probability○UnverifiedHighFresh1
hash functions with collision probability○UnverifiedModerateFresh1

developed by

ValueTrustConfidenceFreshnessSources
Piotr Indyk and Rajeev Motwani○UnverifiedHighFresh1

alternative to

ValueTrustConfidenceFreshnessSources
exhaustive linear search○UnverifiedHighFresh1
exact nearest neighbor search○UnverifiedHighFresh1
k-d trees for high-dimensional search○UnverifiedModerateFresh1
exact nearest neighbor search algorithms○UnverifiedModerateFresh1
k-d trees○UnverifiedModerateFresh1
k-d trees for high-dimensional data○UnverifiedModerateFresh1

founded year

ValueTrustConfidenceFreshnessSources
1998○UnverifiedHighFresh1

supports protocol

ValueTrustConfidenceFreshnessSources
cosine similarity○UnverifiedHighFresh1
Jaccard similarity○UnverifiedHighFresh1
Hamming distance○UnverifiedModerateFresh1

integrates with

ValueTrustConfidenceFreshnessSources
FAISS○UnverifiedModerateFresh1
machine learning pipelines○UnverifiedModerateFresh1
Annoy○UnverifiedModerateFresh1
recommendation systems○UnverifiedModerateFresh1
Apache Spark MLlib○UnverifiedModerateFresh1

Alternatives & Similar Tools

exhaustive linear search
alternative to
Compare →
exact nearest neighbor search
alternative to
Compare →
k-d trees for high-dimensional search
alternative to
Compare →
exact nearest neighbor search algorithms
alternative to
Compare →
k-d trees
alternative to
Compare →
k-d trees for high-dimensional data
alternative to
Compare →

Commonly Used With

FAISSmachine learning pipelinesAnnoyrecommendation systemsApache Spark MLlib

Related entities

Graph Insights

3 entities depend on Locality-Sensitive Hashing
Approximate Nearest Neighbor
View full impact analysis →
Claim count: 26Last updated: 4/5/2026Edit history