Database Paper Browser

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
12240
Venue
VLDB
Year
2020
Pagerank
7.3463484e-05
Overall Rank
3,225 | 77.57%
DOI
10.14778/3424573.3424580

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Rank Citing Paper Year Venue Pagerank
3,609 Similarity search in the blink of an eye with compressed indices 2023 VLDB 6.9215236e-05
3,624 SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search 2024 SIGMOD 6.9056e-05
3,680 SingleStore-V: An Integrated Vector Database System in SingleStore 2024 VLDB 6.8496415e-05
5,456 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 5.4976692e-05
6,357 PQCache: Product Quantization-based KVCache for Long Context LLM Inference 2025 SIGMOD 5.0970739e-05
7,837 GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces 2025 VLDB 4.6379694e-05
8,157 TOD: GPU-accelerated Outlier Detection via Tensor Operations 2023 VLDB 4.5730908e-05
8,439 Accelerating Graph Indexing for ANNS on Modern CPUs 2025 SIGMOD 4.5128946e-05
8,656 Dynamic Range-Filtering Approximate Nearest Neighbor Search 2025 VLDB 4.4737647e-05
10,201 RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search 2026 SIGMOD 4.1945683e-05
10,222 RetroInfer: A Vector Storage Engine for Scalable Long-Context LLM Inference 2026 VLDB 4.1945683e-05
10,237 Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search 2026 VLDB 4.1945683e-05
10,260 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 4.1945683e-05
10,303 Elastic Index Selection for Label-Hybrid AKNN Search 2026 VLDB 4.1945683e-05
10,321 DeXOR: Enabling xor in Decimal Space for Streaming Lossless Compression of Floating-point Data 2026 VLDB 4.1945683e-05
10,698 Not Small Enough? SegPQ: A Learned Approach to Compress Product Quantization Codebooks 2025 VLDB 4.1945683e-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.0032169493
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076637636
91 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.0005181666
129 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.0004429571
212 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00033913475
400 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.0002427237
562 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00020091752
605 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.000193396
682 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018201541
867 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015792021
1,010 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014652858
1,157 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00013610658
1,269 Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan 2016 VLDB 0.00012930432
1,925 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 0.00010073407
3,183 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 7.4228241e-05
3,629 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 6.902069e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076637636
10,260 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 4.1945683e-05
6,360 High-Dimensional Vector Similarity Search: From Time Series to Deep Network Embeddings 2020 SIGMOD 5.0961051e-05
79 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00056242144
8,647 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD 4.4768766e-05
10,237 Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search 2026 VLDB 4.1945683e-05
4,598 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 6.0586236e-05
8,562 Contorting High Dimensional Data for Efficient Main Memory KNN Processing 2003 SIGMOD 4.4937074e-05
10,698 Not Small Enough? SegPQ: A Learned Approach to Compress Product Quantization Codebooks 2025 VLDB 4.1945683e-05
3,609 Similarity search in the blink of an eye with compressed indices 2023 VLDB 6.9215236e-05