Modern embedding models capture both semantic and syntactic structures of queries, often mapping different queries to similar regions in vector space. This results in non-uniform cluster access patterns in disk-based vector search systems, particularly in Retrieval Augmented Generation (RAG) framework. While existing approaches optimize individual queries, they overlook the impact of cluster access patterns, failing to account for the locality effects of queries that access similar clusters. This oversight reduces cache efficiency and increases search latency due to excessive disk I/O. To address this, we introduce CaGR-RAG, a context-aware query grouping mechanism that organizes queries based on shared cluster access patterns. Additionally, it incorporates opportunistic cluster prefetching to minimize cache misses during transitions between query groups, further optimizing retrieval performance. Experimental results show that CaGR-RAG reduces 99th percentile tail latency by up to 51.55% while consistently maintaining a higher cache hit ratio than the baseline.
Building similarity graph...
Analyzing shared references across papers
Loading...
Yeonwoo Jeong
Kyuli Park
Hyunji Cho
Building similarity graph...
Analyzing shared references across papers
Loading...
Jeong et al. (Fri,) studied this question.
www.synapsesocial.com/papers/68e03501f0e39f13e7fa3b05 — DOI: https://doi.org/10.48550/arxiv.2505.01164
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: