DBScholar

Back to papers

Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search

Summary: MRQ combines projection with dimension-wise quantization, encoding only information-dense leading projected dimensions and summarizing the tail. This decouples code length from original dimensionality, enabling tunable compression and up to 3× faster AKNN search at comparable accuracy. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
14461
Venue
VLDB
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,525 | 27.79%
DOI
10.14778/3797919.3797931

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{yang_vldb26,
        title = {{Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search}},
        author = {Yang, Mingyu and Jing, Liuchang and Li, Wentao and Wang, Wei},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {6},
        pages = {1240--1249},
        doi = {10.14778/3797919.3797931},
        url = {https://doi.org/10.14778/3797919.3797931},
        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 32 of 32 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
93 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034701237
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
398 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00019194947
580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016157635
805 Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan 2016 VLDB 0.00013891999
1,244 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 0.00011508159
1,357 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00011043994
1,515 ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data 2024 SIGMOD 0.00010521317
1,546 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010407159
1,735 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 9.9004924e-05
1,802 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.7284341e-05
2,303 SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search 2024 SIGMOD 8.7783079e-05
2,519 Similarity search in the blink of an eye with compressed indices 2023 VLDB 8.4741476e-05
2,534 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.4561875e-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
3,335 Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search 2024 SIGMOD 7.5098031e-05
3,799 SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search 2025 SIGMOD 7.114484e-05
3,858 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.067591e-05
5,231 Hercules Against Data Series Similarity Search 2022 VLDB 6.3068064e-05
6,133 Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search 2025 VLDB 5.9654376e-05
6,820 DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter 2025 SIGMOD 5.7632132e-05
6,995 Chameleon: a Heterogeneous and Disaggregated Accelerator System for Retrieval-Augmented Language Models 2025 VLDB 5.7301567e-05
7,166 Accelerating Graph Indexing for ANNS on Modern CPUs 2025 SIGMOD 5.6846045e-05
7,259 Efficient Dynamic Indexing for Range Filtered Approximate Nearest Neighbor Search 2025 SIGMOD 5.6613405e-05
7,761 DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph 2025 SIGMOD 5.550467e-05
8,205 VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search 2025 VLDB 5.4666548e-05
10,034 HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search 2026 SIGMOD 5.173224e-05
10,035 CoTra: Towards Efficient and Scalable Distributed Vector Search with RDMA 2026 SIGMOD 5.173224e-05
10,036 VStream: A Distributed Streaming Vector Search System 2025 VLDB 5.173224e-05
Previous Page 1 / 1 Next

Semantically Similar Papers