Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.06004 v2 pith:HVMOKK7B submitted 2024-04-09 cs.IR cs.CLcs.DS

classification cs.IRcs.CLcs.DS
keywords aisaqannsdatasetsproductquantizationsearchachievesall-in-storage
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers

    cs.DC 2025-09 conditional novelty 6.0 of 10

    A single DISKANN graph stored in a distributed key-value store, with an in-memory head index and near-data scoring, serves 50B vectors at 100k+ QPS with higher recall than partitioned serving.

Pith tools