Retrieval-Augmented Generation (RAG) pipelines typically rely on a fixed indexing and retrieval configuration determined at preprocessing time. This one-size-fits-all design is ill-suited to domain-expert settings, where heterogeneous queries require different chunking granularities, metadata constraints, and source-selection strategies. As a result, configurations that are effective for one family of queries often perform poorly for others. In this paper, we introduce ORDER (Optimal Routing for Dynamic Evidence Retrieval), a query-conditioned RAG framework that jointly adapts indexing and retrieval to the incoming query. Our approach first discovers semantic clusters over a given set of questions associated to a corpus and learns, for each cluster, a chunking strategy together with a suited metadata filtering and reranking configuration. At inference time, queries are routed to the appropriate pre-built index through nearest-centroid assignment. To further improve retrieval, we propose a supervised query router (QRe) that predicts which collections are most likely to contain relevant evidence, coupled with a Uniform Multi-source Sampler (UMS) that allocates the retrieval budget evenly across the selected sources. We evaluate our framework on large-scale, heterogeneous historical archives and show that conditioning both indexing and retrieval on the query consistently outperforms both naive baselines and strong state-of-the-art RAG systems in complex expert-domain environments.
This approach is pre-retrieval and query-centric, making it robust in heterogeneous, case-like corpora and applicable across domains such as legal, healthcare, finance, and enterprise search.
Retrieval-Augmented Generation (RAG) systems typically apply identical retrieval logic to all user queries, overlooking that different query intents depend on fundamentally different document relationships. We propose QMEG, a query-aware retrieval framework that constructs a multi-relational evidence graph with five ac...
Jia-Run Pan, Yu-Ling Fan, Li Ma et al.· 2026 3rd International Confe...· 0 citations
CoGR is introduced, a retrieval framework that instead trains LLMs to directly construct retrieval representations on both query and item sides, and shows stable co-evolution and increasingly aligned query--item keyword spaces over training.
Runpeng Dai, Kai-Li Huang, Chang-Sung Kang et al.· 2 citations
This work systematically analyze how retriever and generator complexity interacts across factoid and multi-hop question answering (QA), including bridge and composition reasoning tasks, and introduces DRAG, a query-adaptive framework for selecting retriever-generator configurations.
Neeraj Anand, Payel Santra, Partha Basuchowdhuri et al.· 0 citations
The core of D2-ScaleAgent is a Verifier agent-driven dynamic routing loop based on the intrinsic difficulty of the query, centered around a continuously updated evidence bank that serves as the agent's dynamic working memory.
Hao Zhang, Longrong Yang, Lun-Hao Duan et al.· 0 citations
Graph with Adaptive Shortcuts (GAS), a framework that leverages historical query logs to build lightweight auxiliary structures, enhancing search efficiency over a single base graph with minimal overhead, and consistently outperforms existing general indexes in wide-table scenarios.
Zi-Yuan He, Yu-Xiang Wang, Yu Sun et al.· Proceedings of the VLDB Endo...· 0 citations