Database Paper Browser

Back to papers

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

Summary: Introduces multi-probe LSH to cut hash-table count for high-dimensional similarity search. Probes multiple likely buckets per table, achieving similar query time to basic LSH but with 5-8x fewer tables; faster than entropy-based LSH in space and time. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9645
Venue
VLDB
Year
2007
Pagerank
0.00024359304
Overall Rank
399 | 97.23%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 45 of 45 citing papers.

Rank Citing Paper Year Venue Pagerank
579 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.0001982328
675 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018304179
740 Distributed Representations of Tuples for Entity Resolution 2018 VLDB 0.00017358024
858 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015833075
1,013 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014632051
1,225 SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013182109
1,299 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012712766
1,934 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00010047294
1,966 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 9.9130791e-05
2,160 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 9.4037759e-05
2,434 iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search 2020 VLDB 8.8225986e-05
2,644 Locality-Sensitive Hashing for Earthquake Detection: A Case Study of Scaling Data-Driven Science 2018 VLDB 8.3849568e-05
2,681 NET-FLi: On-the-fly Compression, Archiving and Indexing of Streaming Network Traffic 2010 VLDB 8.319573e-05
3,019 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 7.699097e-05
3,182 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB 7.4280768e-05
3,515 Inter-Media Hashing for Large-scale Retrieval from Heterogeneous Data Sources 2013 SIGMOD 7.0191008e-05
3,552 SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search 2024 SIGMOD 6.9765275e-05
3,933 Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond 2017 VLDB 6.6164676e-05
4,230 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 6.3337893e-05
4,598 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 6.053944e-05
4,831 Vexless: A Serverless Vector Data Management System Using Cloud Functions 2024 SIGMOD 5.8883791e-05
5,201 SetSketch: Filling the Gap between MinHash and HyperLogLog 2021 VLDB 5.6283451e-05
5,218 Neighbor-Sensitive Hashing 2016 VLDB 5.6204105e-05
5,477 Learned Cardinality Estimation for Similarity Queries 2021 SIGMOD 5.4856699e-05
5,577 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 5.423881e-05
5,690 FARGO: Fast Maximum Inner Product Search via Global Multi-Probing 2023 VLDB 5.3699421e-05
6,000 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.2365238e-05
6,080 Pigeonring: A Principle for Faster Thresholded Similarity Search 2019 VLDB 5.219249e-05
6,111 Continuously Adaptive Similarity Search 2020 SIGMOD 5.2016636e-05
6,388 Similarity Search and Locality Sensitive Hashing using Ternary Content Addressable Memories 2010 SIGMOD 5.079988e-05
7,198 ARKGraph: All-Range Approximate K-Nearest-Neighbor Graph 2023 VLDB 4.79852e-05
7,255 Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search 2018 SIGMOD 4.7821026e-05
7,549 LIDER: An Efficient High-dimensional Learned Index for Large-scale Dense Passage Retrieval 2023 VLDB 4.7089636e-05
7,698 Near-Duplicate Text Alignment with One Permutation Hashing 2024 SIGMOD 4.6699546e-05
8,654 Dynamic Range-Filtering Approximate Nearest Neighbor Search 2025 VLDB 4.4694763e-05
8,709 ANN Softmax: Acceleration of Extreme Classification Training 2022 VLDB 4.4584416e-05
8,759 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS 4.4520434e-05
10,201 RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search 2026 SIGMOD 4.1905499e-05
10,260 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 4.1905499e-05
10,291 ConANN: Conformal Approximate Nearest Neighbor Search 2026 VLDB 4.1905499e-05
10,575 Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search 2025 VLDB 4.1905499e-05
11,415 ONe Index for All Kernels (ONIAK): A Zero Re-Indexing LSH Solution to ANNS-ALT (After Linear Transformation) 2022 VLDB 4.1905499e-05
11,539 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB 4.1905499e-05
11,660 Top-k Queries over Digital Traces 2019 SIGMOD 4.1905499e-05
12,184 Effective Data Co-Reduction for Multimedia Similarity Search 2011 SIGMOD 4.1905499e-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.0032118946
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
78 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00056385781
301 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00028396714
1,923 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 0.00010079134
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
596 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00019455943
2,872 Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing 2013 VLDB 7.9797548e-05
3,019 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 7.699097e-05
675 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018304179
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
2,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05
1,966 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 9.9130791e-05
11,539 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB 4.1905499e-05
8,759 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS 4.4520434e-05
3,933 Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond 2017 VLDB 6.6164676e-05