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
11399
Venue
VLDB
Year
2016
Pagerank
0.00020920444
Overall Rank
332 | 97.73%
DOI
10.14778/2850469.2850470

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 18 of 68 citing papers.

Rank Citing Paper Year Venue Pagerank
10,247 GEM: A Native Graph-based Index for Multi-Vector Retrieval 2026 SIGMOD 5.093636e-05
10,265 LSHAlign: All-Pair Near-Duplicate Text Alignment via LSH 2026 SIGMOD 5.093636e-05
10,336 Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations 2026 SIGMOD 5.093636e-05
10,359 DiskJoin: Large-scale Vector Similarity Join with SSD 2026 SIGMOD 5.093636e-05
10,412 TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning 2026 SIGMOD 5.093636e-05
10,443 Distribution-Aware Exploration for Adaptive HNSW Search 2026 SIGMOD 5.093636e-05
10,454 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,455 FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,476 On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations 2026 SIGMOD 5.093636e-05
10,493 Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis] 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,544 I/O Optimizations for Graph-Based Disk-Resident Approximate Nearest Neighbor Search: A Design Space Exploration 2026 VLDB 5.093636e-05
10,548 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 5.093636e-05
10,563 Balancing the Blend: An Experimental Analysis of Trade-offs in Hybrid Search 2026 VLDB 5.093636e-05
11,534 Faster and Better Solution to Embed Lp Metrics by Tree Metrics 2022 SIGMOD 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,738 Fast Algorithm for Anchor Graph Hashing 2021 VLDB 5.093636e-05
Previous Page 2 / 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
21 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00056760516
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
690 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.0001492934
990 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00012796562
Previous Page 1 / 1 Next

Semantically Similar Papers

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