HAVEN: High-Bandwidth Flash Augmented Vector Engine for Large-Scale Approximate Nearest-Neighbor Search Acceleration
On the map: Retrieval-augmented generation → RAG pipeline design and evaluation
Abstract (arXiv)
Retrieval-Augmented Generation (RAG) relies on large-scale Approximate Nearest Neighbor Search (ANNS) to retrieve semantically relevant context for large language models. Among ANNS methods, IVF-PQ offers an attractive balance between memory efficiency and search accuracy. However, achieving high recall requires reranking which fetches full-precision vectors for reranking, and the billion-scale vector databases need to reside in CPU DRAM or SSD due to the limited capacity of GPU HBM. This off-GPU data movement introduces substantial latency and throughput degradation. We propose HAVEN, a GPU architecture augmented with High-Bandwidth Flash (HBF) which is a recently introduced die-stacked 3D NAND technology engineered to deliver terabyte-scale capacity and hundreds of GB/s read bandwidth. By integrating HBF and near-storage search unit as an on-package complement to HBM, HAVEN enables the full-precision vector database to reside entirely on-device, eliminating PCIe and DDR bottlenecks during reranking. Through detailed modeling of re-architected 3D NAND subarrays, power-constrained HBF bandwidth, and end-to-end IVF-PQ pipelines, we demonstrate that HAVEN improves reranking throughput by up to 20x and latency up to 40x across billion-scale datasets compared to GPU-DRAM and GPU-SSD systems. Our results show that HBF-augmented GPUs enable high-recall retrieval at throughput previously achievable only without reranking, offering a promising direction for memory-centric AI accelerators.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in RAG pipeline design and evaluation, one of 15 directions in Retrieval-augmented generation. Builds on 2 of its 22 references that are in the map. First posted on arXiv 1 Mar 2026.
Builds on
2 of 22 references.
References · 2
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026FlashAccel: Leveraging High-Bandwidth Flash (HBF) for High-Throughput LLM Inferencecited by 3
- 2026QUBO-Optimized Evidence Selection for Retrieval-Augmented Question Answering with Unconventional Solverscited by 0
- 2026FLINT: Efficiently Leveraging High Bandwidth Flash for Capacity-Scalable LLM Inference Accelerationcited by 0
- 2026SPLASH: Co-Designing Sparse Attention with High-Bandwidth Flash for Efficient Long-Context Inferencecited by 0
- 2026Hot-Cold Tiering of HBM and High Bandwidth Flash for Agentic LLM Servingcited by 0
- 2026Characterizing High Bandwidth Flash for LLM Servingcited by 0
- 2026Characterizing High Bandwidth Flash for LLM Serving30 Sep 2026
- 2026Hot-Cold Tiering of HBM and High Bandwidth Flash for Agentic LLM Serving22 Sep 2026
- 2026SPLASH: Co-Designing Sparse Attention with High-Bandwidth Flash for Efficient Long-Context Inference20 Sep 2026
- 2026FLINT: Efficiently Leveraging High Bandwidth Flash for Capacity-Scalable LLM Inference Acceleration25 Aug 2026
- 2026QUBO-Optimized Evidence Selection for Retrieval-Augmented Question Answering with Unconventional Solvers14 Jul 2026
- 2026FlashAccel: Leveraging High-Bandwidth Flash (HBF) for High-Throughput LLM Inference11 Jul 2026
Similar, not cited
Close in wording, no citation either way
- 2025VectorLiteRAG: Latency-Aware and Fine-Grained Resource Partitioning for Efficient RAG
- 2025Cosmos: A CXL-Based Full In-Memory System for Approximate Nearest Neighbor Search
- 2025Breaking the Storage-Compute Bottleneck in Billion-Scale ANNS: A GPU-Driven Asynchronous I/O Framework
- 2026InSituANN: Revisiting IVF for PCIe-Efficient Billion-Scale Vector Search ↗
- 2026D-NOVA: In-Storage Retrieval Accelerator via Dual-Bound 3D NAND-Optimized Similarity Search with Vector Adaptation
- 2025MicroNN: An On-device Disk-resident Updatable Vector Database
- 2025Trinity: Disaggregating Vector Search from Prefill-Decode Disaggregation in LLM Serving
- 2026NasZip: Software and Hardware Co-Design to Accelerate Approximate Nearest Neighbor Search with DIMM-Based Near-Data Processing