DBScholar

Back to papers

PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search

Summary: PM-LSH uses a PM-tree index with a tunable confidence interval to enable fast, accurate c-ANN in high dimensions. An efficient algorithm atop the PM-tree prunes candidates and improves speed and accuracy over prior LSH. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12451
Venue
VLDB
Year
2020
Pagerank
0.00010407159
Overall Rank
1,546 | 89.40%
DOI
10.14778/3377369.3377374

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{zheng_vldb20,
        title = {{PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search}},
        author = {Zheng, Bolong and Zhao, Xi and Weng, Lianggui and Hung, Nguyen Quoc Viet and Liu, Hang and Jensen, Christian S.},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {5},
        pages = {643--655},
        doi = {10.14778/3377369.3377374},
        url = {https://doi.org/10.14778/3377369.3377374},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 29 of 29 citing papers.

Rank Citing Paper Year Venue Pagerank
286 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00022357911
1,357 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00011043994
1,430 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.0001080902
1,515 ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data 2024 SIGMOD 0.00010521317
1,589 Manu: A Cloud Native Vector Database Management System 2022 VLDB 0.00010264469
1,735 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 9.9004924e-05
1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 9.4561907e-05
2,920 SingleStore-V: An Integrated Vector Database System in SingleStore 2024 VLDB 7.9628307e-05
3,310 Similarity Query Processing for High-Dimensional Data 2020 VLDB 7.5363562e-05
5,121 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.3577317e-05
5,223 FARGO: Fast Maximum Inner Product Search via Global Multi-Probing 2023 VLDB 6.3102417e-05
5,653 UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search 2025 VLDB 6.1332953e-05
5,800 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0850924e-05
6,133 Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search 2025 VLDB 5.9654376e-05
6,148 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 5.9593368e-05
6,956 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.7303405e-05
7,145 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.6908957e-05
8,205 VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search 2025 VLDB 5.4666548e-05
9,236 Wolverine: Highly Efficient Monotonic Search Path Repair for Graph-based ANN Index Updates 2025 VLDB 5.3016261e-05
9,915 MicroNN: An On-device Disk-resident Updatable Vector Database 2025 SIGMOD 5.1955087e-05
9,919 Select Edges Wisely: Monotonic Path Aware Graph Layout Optimization for Disk-based ANN Search 2025 VLDB 5.1955087e-05
10,247 GEM: A Native Graph-based Index for Multi-Vector Retrieval 2026 SIGMOD 5.093636e-05
10,297 TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,362 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,512 SVFusion: A CPU-GPU Co-Processing Architecture for Large-Scale Real-Time Vector Search 2026 VLDB 5.093636e-05
10,525 Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search 2026 VLDB 5.093636e-05
10,601 Elastic Index Selection for Label-Hybrid AKNN Search 2026 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
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

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

Rank Cited Paper Year Venue Pagerank
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
21 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00056760516
287 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00022323585
332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00020920444
369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00019945234
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
991 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012793339
1,572 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.00010329197
2,101 A Cost Model for Similarity Queries in Metric Spaces 1998 PODS 9.1657486e-05
2,390 Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing 2013 VLDB 8.6438351e-05
2,541 Locality-Sensitive Hashing for Earthquake Detection: A Case Study of Scaling Data-Driven Science 2018 VLDB 8.4500033e-05
3,389 Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond 2017 VLDB 7.4525222e-05
3,858 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.067591e-05
6,860 Searching Web Data using MinHash LSH 2016 SIGMOD 5.7518123e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 1,572 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD
2 2,673 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD
3 580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB
4 3,279 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD
5 990 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB
6 332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB
7 5,800 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB
8 369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
9 581 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD
10 1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB