AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval

Kento Tatsuno, Daisuke Miyashita, Taiga Ikeda, Kiyoshi Ishiyama, Kazunari Sumiyoshi +1 more
4/9/2024
cs.IRcs.CLcs.DS

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

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 $\sim$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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tatsuno2024aisaq,
  title  = {AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval},
  author = {Kento Tatsuno and Daisuke Miyashita and Taiga Ikeda and Kiyoshi Ishiyama and Kazunari Sumiyoshi and Jun Deguchi},
  year   = {2024},
  eprint = {2404.06004},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.06004v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.06004.svg)](https://codeofpaper.com/paper/2404.06004)

Discussion