ConStore:面向基于磁盘的近似最近邻搜索的搜索重叠预取与协同检索感知内容存储
ConStore: Search-Overlapped Prefetch and Co-Retrieval-Aware Content Storage for Disk-Based ANNS
AI总结:
ConStore是面向磁盘ANNS的内容存储引擎,通过SICP预取、RPAG分组、WASR重组和GCF合并I/O的技术组合,在多跳问答等工作负载上显著降低了端到端检索延迟。
摘要:
基于磁盘的近似最近邻搜索(ANNS)支持对超出内存容量的语料库进行检索增强生成(RAG)、搜索、推荐和广告。现有ANNS研究通常聚焦于小top-K的向量搜索,而工业级应用需要更大的检索集。从存储中获取对应内容的问题相对未被充分探索。我们对百万至十亿级向量语料库的分析显示,在大K值下,内容获取延迟可与向量搜索延迟相当或超过后者,在端到端检索中不可忽视。我们提出ConStore,一种结合两种互补技术以降低端到端检索延迟的内容存储引擎。推测式内联内容预取(SICP)将基于图和基于聚类的ANNS抽象为渐进式SSD I/O,该I/O会优化正在处理的候选队列。它在有限I/O预算下为稳定的领先候选预取内容,将内容读取与搜索重叠,且不改变最终top-K结果。协同检索模式感知分组(RPAG)利用查询日志将频繁协同检索的文档放置在连续段中。工作负载自适应段重组(WASR)在有限重写预算下通过选择性重组段,使该布局适应工作负载变化。分组内容获取(GCF)利用此布局将单文档随机读取合并为批处理、页面感知的I/O请求。SICP独立于内容布局工作,而RPAG和GCF即使在无预取的情况下也能降低获取成本。在三个K值从10到1600的多跳问答工作负载上,ConStore在DiskANN上较最佳单文档读取基线降低端到端检索延迟达48%,在SPANN上降低达25%。对1亿级和十亿级向量索引的单独实验证明了SICP在更大规模下的适用性。
英文摘要:
Disk-based approximate nearest-neighbor search (ANNS) supports retrieval-augmented generation (RAG), search, recommendation, and advertising over corpora that exceed memory capacity. Existing ANNS research often focuses on vector search at small top-K, whereas industrial-scale applications require larger retrieval sets. Fetching the corresponding content from storage remains comparatively underexplored. Our profiling across million- to billion-vector corpora shows that, at large K, content fetch latency can match or exceed vector-search latency and cannot be ignored in end-to-end retrieval. We present ConStore, a content storage engine combining two complementary techniques to reduce end-to-end retrieval latency. Speculative Inline Content Prefetch (SICP) commonly abstracts graph-based and cluster-based ANNS as progressive SSD I/O that refines an in-flight candidate queue. It prefetches content for stable leading candidates under a bounded I/O budget, overlapping content reads with search without changing the final top-K results. Co-Retrieval-Pattern-Aware Grouping (RPAG) uses query logs to place frequently co-retrieved documents in contiguous segments. Workload-Adaptive Segment Reorganization (WASR) adapts this layout to workload shifts by selectively regrouping segments under a bounded rewrite budget. Group Content Fetch (GCF) exploits this layout to coalesce per-document random reads into batched, page-aware I/O requests. SICP works independently of the content layout, while RPAG and GCF reduce fetch cost even without prefetching. Across three multi-hop QA workloads with K from 10 to 1600, ConStore reduces end-to-end retrieval latency over the best per-document-read baseline by up to 48% on DiskANN and 25% on SPANN. Separate experiments on 100M- and billion-vector indexes demonstrate SICP's applicability at larger scales.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。