DBScholar

Back to papers

Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search

Summary: Introduces query-aware bucket partitioning for LSH, anchoring random-projection buckets to each query rather than precomputing query-oblivious shifts. QALSH supports external-memory c-ANN for any c>1, improving quality and performance over C2LSH and LSB-Forest, especially in high dimensions. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
h1cdf5bff75ef6c2d
Venue
VLDB
Year
2016
Pagerank
0.00022090962
Overall Rank
286 | 98.09%
DOI
10.14778/2850469.2850470
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{huang_vldb16,
        title = {{Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search}},
        author = {Huang, Qiang and Feng, Jianlin and Zhang, Yikai and Fang, Qiong and Ng, Wilfred},
        journal = {PVLDB},
        series = {{VLDB} '16},
        volume = {9},
        number = {1},
        doi = {10.14778/2850469.2850470},
        url = {https://doi.org/10.14778/2850469.2850470},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 73 citing papers.

Rank Citing Paper Year Venue Pagerank
75 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037163157
335 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.0002067515
650 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00015142453
802 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00013822222
837 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00013530806
1,318 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00011035606
1,460 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010558941
1,601 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 0.00010092977
1,610 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 0.00010066881
1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.00010045437
1,881 iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search 2020 VLDB 9.4262036e-05
1,968 SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search 2024 SIGMOD 9.2810141e-05
2,268 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.7144632e-05
2,426 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB 8.4692316e-05
2,728 iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search 2024 SIGMOD 8.0686023e-05
2,791 Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search 2024 SIGMOD 7.9939669e-05
2,836 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 7.9410774e-05
2,885 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.8929868e-05
2,968 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.7879589e-05
3,389 SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search 2025 SIGMOD 7.329962e-05
3,552 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.1888282e-05
3,876 RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search 2024 VLDB 6.9349247e-05
4,077 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 6.8040917e-05
4,157 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 6.7596305e-05
4,368 UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search 2025 VLDB 6.6237291e-05
5,227 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.2080477e-05
5,294 FARGO: Fast Maximum Inner Product Search via Global Multi-Probing 2023 VLDB 6.1780995e-05
5,526 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0804398e-05
5,633 A Topology-Aware Localized Update Strategy for Graph-Based ANN Index 2026 VLDB 6.039647e-05
5,891 ARKGraph: All-Range Approximate K-Nearest-Neighbor Graph 2023 VLDB 5.9396547e-05
5,903 MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search 2025 SIGMOD 5.9357915e-05
6,076 High-Dimensional Vector Similarity Search: From Time Series to Deep Network Embeddings 2020 SIGMOD 5.8774917e-05
6,146 Dynamic Range-Filtering Approximate Nearest Neighbor Search 2025 VLDB 5.8561603e-05
6,221 FACET: Robust Counterfactual Explanation Analytics 2023 SIGMOD 5.8286278e-05
6,621 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.7145251e-05
6,892 AquaPipe: A Quality-Aware Pipeline for Knowledge Retrieval and Large Language Models 2025 SIGMOD 5.6385566e-05
7,023 Accelerating Graph Indexing for ANNS on Modern CPUs 2025 SIGMOD 5.6026129e-05
7,121 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.580601e-05
7,286 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5493084e-05
7,326 RWalks: Random Walks as Attribute Diffusers for Filtered Vector Search 2025 SIGMOD 5.5375978e-05
7,358 Wolverine: Highly Efficient Monotonic Search Path Repair for Graph-based ANN Index Updates 2025 VLDB 5.5288758e-05
7,616 DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph 2025 SIGMOD 5.4672835e-05
7,926 Near-Duplicate Text Alignment with One Permutation Hashing 2024 SIGMOD 5.4083603e-05
8,880 VStream: A Distributed Streaming Vector Search System 2025 VLDB 5.2447315e-05
8,992 GEqO: ML-Accelerated Semantic Equivalence Detection 2023 SIGMOD 5.2295579e-05
9,168 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2026953e-05
9,562 SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation 2026 SIGMOD 5.1465543e-05
9,593 Distribution-Aware Exploration for Adaptive HNSW Search 2026 SIGMOD 5.1376962e-05
9,596 LeaFi: Data Series Indexes on Steroids with Learned Filters 2025 SIGMOD 5.1376962e-05
9,947 DiskJoin: Large-scale Vector Similarity Join with SSD 2026 SIGMOD 5.0910746e-05
Previous Page 1 / 2 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
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057610161
339 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020558018
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016344855
674 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.00014872783
925 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013026835
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 12,085 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB
2 3,552 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD
3 578 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD
4 925 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB
5 562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB
6 5,526 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB
7 1,460 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB
8 1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
9 2,968 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD
10 339 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD