DBScholar

Back to papers

DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search

Summary: Compresses high-dimensional vectors by first quantizing into codes and then applying a tree-based delta encoding (DeltaPQ) to those codes. A linear-time algorithm selects the optimal tree, yielding up to 5× compression and enabling approximate nearest neighbor search directly on the compressed data across inner product, cosine, Euclidean, and Lp norms. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h25fea2e18ac23163
Venue
VLDB
Year
2020
Pagerank
8.4692316e-05
Overall Rank
2,426 | 83.74%
DOI
10.14778/3424573.3424580
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{wang_vldb20,
        title = {{DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search}},
        author = {Wang, Runhui and Deng, Dong},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {13},
        pages = {3603--3616},
        doi = {10.14778/3424573.3424580},
        url = {https://doi.org/10.14778/3424573.3424580},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank Citing Paper Year Venue Pagerank
1,797 SingleStore-V: An Integrated Vector Database System in SingleStore 2024 VLDB 9.6056634e-05
1,968 SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search 2024 SIGMOD 9.2810141e-05
2,067 Similarity search in the blink of an eye with compressed indices 2023 VLDB 9.0707479e-05
3,972 PQCache: Product Quantization-based KVCache for Long Context LLM Inference 2025 SIGMOD 6.8744954e-05
5,227 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.2080477e-05
5,376 RetroInfer: A Vector Storage Engine for Scalable Long-Context LLM Inference 2026 VLDB 6.139877e-05
6,146 Dynamic Range-Filtering Approximate Nearest Neighbor Search 2025 VLDB 5.8561603e-05
6,941 GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces 2025 VLDB 5.6229105e-05
7,023 Accelerating Graph Indexing for ANNS on Modern CPUs 2025 SIGMOD 5.6026129e-05
8,421 TOD: GPU-accelerated Outlier Detection via Tensor Operations 2023 VLDB 5.3197436e-05
10,203 GPS: Revisiting the Data Layout for Disk-based High-Dimensional Vector Search 2026 SIGMOD 5.0491152e-05
10,503 CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute-Memory Disaggregation 2026 SIGMOD 4.9605343e-05
10,749 RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search 2026 SIGMOD 4.9605343e-05
10,780 Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search 2026 VLDB 4.9605343e-05
10,801 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 4.9605343e-05
10,840 Harmonizing Efficiency and Accuracy in Filtered Vector Search 2026 VLDB 4.9605343e-05
11,118 Elastic Index Selection for Label-Hybrid AKNN Search 2026 VLDB 4.9605343e-05
11,135 DeXOR: Enabling xor in Decimal Space for Streaming Lossless Compression of Floating-point Data 2026 VLDB 4.9605343e-05
11,393 Not Small Enough? SegPQ: A Learned Approach to Compress Product Quantization Codebooks 2025 VLDB 4.9605343e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0019892478
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057610161
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.0004024707
75 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037163157
90 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00034749222
281 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00022262975
286 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00022090962
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
578 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016079505
650 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00015142453
710 Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan 2016 VLDB 0.00014598403
1,098 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012016918
1,805 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 9.5936926e-05
2,733 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.0653682e-05
2,879 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 7.8951769e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 20 Similarity Search in High Dimensions via Hashing 1999 VLDB
2 10,801 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB
3 6,076 High-Dimensional Vector Similarity Search: From Time Series to Deep Network Embeddings 2020 SIGMOD
4 45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB
5 8,844 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD
6 10,780 Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search 2026 VLDB
7 2,836 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD
8 8,955 Contorting High Dimensional Data for Efficient Main Memory KNN Processing 2003 SIGMOD
9 11,393 Not Small Enough? SegPQ: A Learned Approach to Compress Product Quantization Codebooks 2025 VLDB
10 2,067 Similarity search in the blink of an eye with compressed indices 2023 VLDB