DBScholar

Back to papers

Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search

Summary: Multi-Probe LSH reduces LSH’s costly proliferation of hash tables by probing multiple promising buckets within each table. It preserves search quality and time efficiency while cutting space by an order of magnitude, outperforming entropy-based LSH. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
9835
Venue
VLDB
Year
2007
Pagerank
0.00022323585
Overall Rank
287 | 98.04%
DOI
10.14778/1325851.1325870

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{lv_vldb07,
        title = {{Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search}},
        author = {Lv, Qin and Josephson, William and Wang, Zhe and Charikar, Moses and Li, Kai},
        journal = {PVLDB},
        series = {{VLDB} '07},
        volume = {30},
        number = {2},
        pages = {950--961},
        doi = {10.14778/1325851.1325870},
        url = {https://doi.org/10.14778/1325851.1325870},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 47 of 47 citing papers.

Rank Citing Paper Year Venue Pagerank
369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00019945234
489 Distributed Representations of Tuples for Entity Resolution 2018 VLDB 0.0001761456
580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016157635
581 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016153395
705 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014829964
990 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00012796562
991 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012793339
1,430 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.0001080902
1,546 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010407159
1,572 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.00010329197
2,010 iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search 2020 VLDB 9.3085202e-05
2,303 SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search 2024 SIGMOD 8.7783079e-05
2,541 Locality-Sensitive Hashing for Earthquake Detection: A Case Study of Scaling Data-Driven Science 2018 VLDB 8.4500033e-05
2,572 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB 8.4027322e-05
2,673 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 8.2730112e-05
3,279 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.5711218e-05
3,364 Vexless: A Serverless Vector Data Management System Using Cloud Functions 2024 SIGMOD 7.4796687e-05
3,389 Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond 2017 VLDB 7.4525222e-05
3,722 NET-FLi: On-the-fly Compression, Archiving and Indexing of Streaming Network Traffic 2010 VLDB 7.1726862e-05
3,858 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.067591e-05
4,060 Inter-Media Hashing for Large-scale Retrieval from Heterogeneous Data Sources 2013 SIGMOD 6.9322681e-05
4,617 Learned Cardinality Estimation for Similarity Queries 2021 SIGMOD 6.604437e-05
4,712 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 6.5506649e-05
4,927 Neighbor-Sensitive Hashing 2016 VLDB 6.4426453e-05
5,223 FARGO: Fast Maximum Inner Product Search via Global Multi-Probing 2023 VLDB 6.3102417e-05
5,666 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS 6.1285141e-05
5,726 Pigeonring: A Principle for Faster Thresholded Similarity Search 2019 VLDB 6.1079184e-05
5,846 Continuously Adaptive Similarity Search 2020 SIGMOD 6.0679671e-05
5,864 SetSketch: Filling the Gap between MinHash and HyperLogLog 2021 VLDB 6.0619574e-05
6,404 ARKGraph: All-Range Approximate K-Nearest-Neighbor Graph 2023 VLDB 5.8859287e-05
6,597 Similarity Search and Locality Sensitive Hashing using Ternary Content Addressable Memories 2010 SIGMOD 5.8280739e-05
6,956 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.7303405e-05
7,240 Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search 2018 SIGMOD 5.6643589e-05
7,254 LIDER: An Efficient High-dimensional Learned Index for Large-scale Dense Passage Retrieval 2023 VLDB 5.6625991e-05
7,426 Dynamic Range-Filtering Approximate Nearest Neighbor Search 2025 VLDB 5.6211019e-05
7,745 Near-Duplicate Text Alignment with One Permutation Hashing 2024 SIGMOD 5.5534781e-05
8,855 ANN Softmax: Acceleration of Extreme Classification Training 2022 VLDB 5.3573227e-05
10,233 Enhancing Graph-based Approximate Maximum Inner Product Search via Norm-Adaptive Partitioning 2026 SIGMOD 5.093636e-05
10,265 LSHAlign: All-Pair Near-Duplicate Text Alignment via LSH 2026 SIGMOD 5.093636e-05
10,490 RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search 2026 SIGMOD 5.093636e-05
10,548 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 5.093636e-05
10,578 ConANN: Conformal Approximate Nearest Neighbor Search 2026 VLDB 5.093636e-05
10,832 Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search 2025 VLDB 5.093636e-05
11,610 ONe Index for All Kernels (ONIAK): A Zero Re-Indexing LSH Solution to ANNS-ALT (After Linear Transformation) 2022 VLDB 5.093636e-05
11,732 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB 5.093636e-05
11,850 Top-k Queries over Digital Traces 2019 SIGMOD 5.093636e-05
12,371 Effective Data Co-Reduction for Multimedia Similarity Search 2011 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0020210012
21 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00056760516
46 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00044853085
277 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00022537944
1,778 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 9.7769047e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB
2 2,390 Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing 2013 VLDB
3 2,673 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD
4 581 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD
5 21 Similarity Search in High Dimensions via Hashing 1999 VLDB
6 1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
7 1,572 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD
8 11,732 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB
9 5,666 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS
10 3,389 Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond 2017 VLDB