Fast Adaptive Similarity Search through Variance-Aware Quantization
John Paparrizos, Ikraduya Edian, Chunwei Liu, Aaron J. Elmore, Michael J. Franklin
Abstract
With the explosive growth of high-dimensional data, approximate methods emerge as promising solutions for nearest neighbor search. Among alternatives, quantization methods have gained attention due to the fast query responses and the low encoding and storage costs. Quantization methods decompose data dimensions into non-overlapping subspaces and encode data using a different dictionary per subspace. The state-of-the-art approach assigns dictionary sizes uniformly across subspaces while attempting to balance the relative importance of subspaces. Unfortunately, a uniform balance is not always achievable and may lead to unsatisfactory performance. Similarly, hardware-accelerated quantization methods may sacrifice accuracy to speed up the query execution. We propose a Variance-Aware Quantization (VAQ) method to encode data by intelligently adapting dictionary sizes to subspaces to alleviate these significant drawbacks. VAQ exploits intrinsic dimensionality reduction properties to derive the subspaces and only partially balances the importance of subspaces. Then, VAQ solves a constrained optimization problem to assign dictionary sizes proportionally to the importance of each subspace. In addition, VAQ accelerates the query execution by skipping data and subspaces through a hardware-oblivious algorithmic solution. To demonstrate the robustness of VAQ, we perform an extensive evaluation against quantization, hashing, and indexing methods using five large-scale benchmarking datasets. VAQ significantly outperforms the strongest hashing and quantization methods in accuracy while achieving up to 5× speedup. Compared to the fastest but less accurate hardware-accelerated method, VAQ achieves a speedup@recall performance up to 14×. Importantly, a rigorous statistical comparison using over one hundred datasets reveals that VAQ significantly outperforms rival methods even with a half budget. Notably, VAQ's simple data skipping solution achieves competitive or better performance against index-based methods, highlighting the need for new indices for quantization methods.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers22
- Volume Under the Surface: A New Accuracy Evaluation Measure for Time-Series Anomaly DetectionJohn Paparrizos, Paul Boniol, Themis Palpanas, Ruey S. Tsay et al.VLDB 2022 · 171 citations
- How Large Language Models Will Disrupt Data ManagementRaul Castro Fernandez, Aaron J. Elmore, Michael J. Franklin, Sanjay Krishnan et al.VLDB 2023 · 127 citations
- RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor SearchJianyang Gao, Cheng LongSIGMOD 2024 · 83 citations
- Choose Wisely: An Extensive Evaluation of Model Selection for Anomaly Detection in Time SeriesEmmanouil Sylligardos, Paul Boniol, John Paparrizos, Panos E. Trahanias et al.VLDB 2023 · 40 citations
- Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor SearchJianyang Gao, Yutong Gou, Yuexuan Xu, Yongyi Yang et al.SIGMOD 2025 · 29 citations
Builds on7
- SAND: Streaming Subsequence Anomaly DetectionPaul Boniol, John Paparrizos, Themis Palpanas, Michael J. FranklinVLDB 2021 · 128 citations
- Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity SearchKarima Echihabi, Kostas Zoumpatianos, Themis Palpanas, Houda BenbrahimVLDB 2020 · 99 citations
- Decomposed Bounded Floats for Fast Compression and QueriesChunwei Liu, Hao Jiang, John Paparrizos, Aaron J. ElmoreVLDB 2021 · 65 citations
- Debunking Four Long-Standing Misconceptions of Time-Series Distance MeasuresJohn Paparrizos, Chunwei Liu, Aaron J. Elmore, Michael J. FranklinSIGMOD 2020 · 56 citations
- Good to the Last Bit: Data-Driven Encoding with CodecDBHao Jiang, Chunwei Liu, John Paparrizos, Andrew A. Chien et al.SIGMOD 2021 · 45 citations
Related papers
- Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor SearchMingyu Yang, Liuchang Jing, Wentao Li, Wei WangVLDB 2026
- SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension SegmentationHui Li, Shiyuan Deng, Xiao Yan, Xiangyu Zhi et al.SIGMOD 2026 · 1 citation
- JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor SearchJiabao Han, Mengxuan Zhang, Goce TrajcevskiVLDB 2026 · 1 citation
- DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity SearchRunhui Wang, Dong DengVLDB 2020 · 31 citations
- Quake: Adaptive Indexing for Vector SearchJason Mohoney, Devesh Sarda, Mengze Tang, Shihabur Rahman Chowdhury et al.OSDI 2025 · 12 citations
