AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval
Not on the map. Why?
Abstract (arXiv)
Graph-based approximate nearest neighbor search (ANNS) algorithms work effectively against large-scale vector retrieval. Among such methods, DiskANN achieves good recall-speed tradeoffs using both DRAM and storage. DiskANN adopts product quantization (PQ) to reduce memory usage, which is still proportional to the scale of datasets. In this paper, we propose All-in-Storage ANNS with Product Quantization (AiSAQ), which offloads compressed vectors to the SSD index. Our method achieves ~10 MB memory usage in query search with billion-scale datasets without critical latency degradation. AiSAQ also reduces the index load time for query search preparation, which enables fast switch between muitiple billion-scale indices.This method can be applied to retrievers of retrieval-augmented generation (RAG) and be scaled out with multiple-server systems for emerging datasets. Our DiskANN-based implementation is available on GitHub.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 4 of its 14 references that are in the map. First posted on arXiv 9 Apr 2024.
Builds on
4 of 14 references.
References · 4
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2020KILT: a Benchmark for Knowledge Intensive Language Taskscited by 571
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 2.
5 papers.
- 2024A Survey on Retrieval-Augmented Text Generation for Large Language Modelscited by 77
- 2025PDX: A Data Layout for Vector Similarity Searchcited by 8
- 2025LEANN: A Low-Storage Vector Indexcited by 4
- 2026Revolutionizing Long-Term Memory in AI: New Horizons with High-Capacity and High-Speed Storagecited by 0
- 2026Stop Indexing at Full Precision: Revisiting Clustering for Vector Embeddingscited by 0
- 2026Stop Indexing at Full Precision: Revisiting Clustering for Vector Embeddings30 Jul 2026
- 2026Revolutionizing Long-Term Memory in AI: New Horizons with High-Capacity and High-Speed Storage18 Feb 2026
- 2025LEANN: A Low-Storage Vector Index9 Jun 2025
- 2025PDX: A Data Layout for Vector Similarity Search6 Mar 2025
- 2024A Survey on Retrieval-Augmented Text Generation for Large Language Models17 Apr 2024
Similar, not cited
Close in wording, no citation either way
- 2025Cosmos: A CXL-Based Full In-Memory System for Approximate Nearest Neighbor Search
- 2026QVCache: A Query-Aware Vector Cache
- 2023NDSEARCH: Accelerating Graph-Traversal-Based Approximate Nearest Neighbor Search through Near Data Processing
- 2026FaTRQ: Tiered Residual Quantization for LLM Vector Search in Far-Memory-Aware ANNS Systems
- 2025MicroNN: An On-device Disk-resident Updatable Vector Database
- 2025From HNSW to Information-Theoretic Binarization: Rethinking the Architecture of Scalable Vector Search
- 2025LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search
- 2026ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases ↗