Skip to main navigation Skip to search Skip to main content

Storage-Based Approximate Nearest Neighbor Search: What are the Performance, Cost, and I/O Characteristics?

  • Zebin Ren*
  • , Krijn Doekemeijer
  • , Padma Apparao
  • , Animesh Trivedi
  • *Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

1 Downloads (Pure)

Abstract

Retrieval-augmented generation (RAG) has emerged as an effective method for enhancing large language models by integrating external knowledge sources to reduce the model size, avoid hallucinations, and provide an easier way to update the knowledge than fine-tuning. This external knowledge is commonly managed by vector databases, where the external knowledge is embedded into vectors and retrieved with vector similarity search. As the size of these external knowledge bases grows, the memory requirements for storing vectors and their associated indexes exceed the practical limits of main memory, prompting a shift toward storage-based solutions. Despite the adoption of storage-based solutions in modern vector databases, there have been limited systematic evaluations of the performance characteristics and I/O behavior of state-of-the-practice vector databases with storage-based setups. In this paper, we systematically characterize the performance, scalability, and I/O characteristics of these vector databases on modern SSDs that can deliver millions of I/O operations/s with less than 100 μs latency. We report 22 observations and 3 key findings that indicate: (i) vector databases with storage-based setups do not necessarily indicate lower performance than memory-based setups, for example, the storage-based setup DiskANN outperforms the memory-based setup, IVF, with up to 3.2× search throughput in Milvus, (ii) state-of-the-practice vector databases with storage-based setups require optimizations on I/O traffic to fully utilize the performance with flash SSDs, the maximum bandwidth achieved in our experiments is 1.7 GiB/s and can not saturate our benchmarked SSD, and (iii) the indexes' search-time parameters affect both performance and I/O characteristics of vector databases, for example, when the parameter search-list increases from 10 to 100, the throughput of vector similarity search decreases up to 60.9% and the read bandwidth increases up to 3.3×. We open-source the scripts and traces of this work at: https://zenodo.org/records/16916496.

Original languageEnglish
Title of host publication2025 IEEE International Symposium on Workload Characterization (IISWC)
Subtitle of host publication[Proceedings]
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages407-422
Number of pages16
ISBN (Electronic)9798331549176
ISBN (Print)9798331549183
DOIs
Publication statusPublished - 2025
Event28th IEEE International Symposium on Workload Characterization, IISWC 2025 - Irvine, United States
Duration: 12 Oct 202514 Oct 2025

Conference

Conference28th IEEE International Symposium on Workload Characterization, IISWC 2025
Country/TerritoryUnited States
CityIrvine
Period12/10/2514/10/25

Bibliographical note

Publisher Copyright:
© 2025 IEEE.

Keywords

  • approximate nearest neighbor search
  • I/O workload characterization
  • vector database

Fingerprint

Dive into the research topics of 'Storage-Based Approximate Nearest Neighbor Search: What are the Performance, Cost, and I/O Characteristics?'. Together they form a unique fingerprint.

Cite this