Database Paper Browser

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
12264
Venue
VLDB
Year
2020
Pagerank
9.4037759e-05
Overall Rank
2,160 | 84.99%
DOI
10.14778/3377369.3377374

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 27 of 27 citing papers.

Rank Citing Paper Year Venue Pagerank
494 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00021769407
1,934 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00010047294
2,264 Manu: A Cloud Native Vector Database Management System 2022 VLDB 9.1587362e-05
2,287 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 9.1004806e-05
2,525 ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data 2024 SIGMOD 8.5991468e-05
2,772 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 8.1491893e-05
2,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05
3,612 SingleStore-V: An Integrated Vector Database System in SingleStore 2024 VLDB 6.9177653e-05
4,273 Similarity Query Processing for High-Dimensional Data 2020 VLDB 6.2932217e-05
4,869 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 5.8588434e-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,375 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 5.0868008e-05
7,235 Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search 2025 VLDB 4.7882389e-05
7,307 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 4.7623207e-05
7,612 UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search 2025 VLDB 4.6919232e-05
7,848 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 4.6323445e-05
8,208 VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search 2025 VLDB 4.5537353e-05
10,071 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD 4.1905499e-05
10,224 SVFusion: A CPU-GPU Co-Processing Architecture for Large-Scale Real-Time Vector Search 2026 VLDB 4.1905499e-05
10,237 Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search 2026 VLDB 4.1905499e-05
10,315 Elastic Index Selection for Label-Hybrid AKNN Search 2026 VLDB 4.1905499e-05
10,420 MicroNN: An On-device Disk-resident Updatable Vector Database 2025 SIGMOD 4.1905499e-05
10,610 Wolverine: Highly Efficient Monotonic Search Path Repair for Graph-based ANN Index Updates 2025 VLDB 4.1905499e-05
10,744 Select Edges Wisely: Monotonic Path Aware Graph Layout Optimization for Disk-based ANN 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
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
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016113151
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
399 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00024359304
579 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.0001982328
596 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00019455943
675 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018304179
858 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015833075
1,299 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012712766
1,808 A Cost Model for Similarity Queries in Metric Spaces 1998 PODS 0.00010476269
1,966 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 9.9130791e-05
2,644 Locality-Sensitive Hashing for Earthquake Detection: A Case Study of Scaling Data-Driven Science 2018 VLDB 8.3849568e-05
2,872 Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing 2013 VLDB 7.9797548e-05
3,933 Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond 2017 VLDB 6.6164676e-05
4,598 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 6.053944e-05
6,785 Searching Web Data using MinHash LSH 2016 SIGMOD 4.9211668e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
1,966 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 9.9130791e-05
3,019 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 7.699097e-05
858 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015833075
4,230 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 6.3337893e-05
1,225 SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013182109
596 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00019455943
6,375 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 5.0868008e-05
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
2,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05