DBScholar

Back to papers

JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search

Summary: Training-free ANN quantization via orthogonal Johnson-Lindenstrauss transform: near-Gaussian, independent dimensions enable fast codebook construction with provable error bounds. JHQ adds two-level primary/residual quantization for scalable candidate filtering and refinement, yielding large index-build and query speedups on high-d ANN. (summarized by gpt-5.4-mini on May 27 2026)

Paper ID
14485
Venue
VLDB
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,548 | 27.64%
DOI
10.14778/3801059.3801067

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{han_vldb26,
        title = {{JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search}},
        author = {Han, Jiabao and Zhang, Mengxuan and Trajcevski, Goce},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {7},
        pages = {1530--1543},
        doi = {10.14778/3801059.3801067},
        url = {https://doi.org/10.14778/3801059.3801067},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 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
46 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00044853085
93 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034701237
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
705 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014829964
1,357 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00011043994
2,519 Similarity search in the blink of an eye with compressed indices 2023 VLDB 8.4741476e-05
2,572 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB 8.4027322e-05
3,108 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 7.7499741e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 7,259 Efficient Dynamic Indexing for Range Filtered Approximate Nearest Neighbor Search 2025 SIGMOD
2 9,889 SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation 2026 SIGMOD
3 2,572 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB
4 1,357 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD
5 9,493 MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances 2023 VLDB
6 9,892 Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts 2025 VLDB
7 2,519 Similarity search in the blink of an eye with compressed indices 2023 VLDB
8 3,108 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD
9 3,858 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD
10 10,525 Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search 2026 VLDB