EffiRAG is presented, a graph-based RAG system designed to reduce this cost that uses the graph to locate relevant passages and generates answers from the original text, and preserves source information while keeping graph construction and query processing lightweight.
Abstract
Graph-based retrieval-augmented generation (RAG) can help answer questions that require information from many documents. However, building a graph often requires many language-model calls during ingestion. It is therefore important to ask whether its quality gains justify the additional cost. We present EffiRAG, a graph-based RAG system designed to reduce this cost. It uses the graph to locate relevant passages and generates answers from the original text. This design preserves source information while keeping graph construction and query processing lightweight. We evaluate EffiRAG on UltraDomain, which contains 120 open-ended questions from four domains. Compared with LightRAG-hybrid, EffiRAG produces the preferred answer on 93 questions. LightRAG is preferred on 7, and the remaining 20 are splits. EffiRAG also reduces total system cost by 57 percent, from USD 0.952 to USD 0.408. The cost includes language-model calls during ingestion and querying. The advantage remains as the corpus grows. At 10 and 20 documents per domain, EffiRAG uses a lightweight, non-LLM filter to skip low-salience chunks. It remains preferred over LightRAG-hybrid. It costs 4.2 times and 4.5 times less, respectively. The comparisons identify different quality-cost trade-offs. Graph-based RAG systems should therefore be evaluated by both answer quality and cost. The results favor graph structure that locates and preserves source evidence.
LiteRAG is presented, a graph-based retrieval method that replaces expensive retrieval-time LLM control with query-conditioned algorithmic exploration and reasoning-chain context construction and attains the highest overall quality among the evaluated methods.
Daniel Alejandro Coll Tejeda, Pedro García López, Daniel Barcelona-Pons· 0 citations
Mosaic is presented, a training-free framework that formulates GraphRAG retrieval as a per-query control problem that converts query-specific evidence requirements into a bounded policy over seed selection, graph traversal, stopping, and evidence selection while the corpus graph, indexes, scoring functions, grounding p...
Eunkyeong Lee, Kyeong-Jin Oh, Jinwon Kim et al.· 0 citations
Retrieval-Augmented Generation (RAG) systems for multi-hop Question Answering (QA) must balance retrieval quality with computational cost. This cost is incurred during indexing time, through the use of expensive Knowledge Graphs (KGs) or Large Language Models (LLMs) to generate summaries, or during querying, through it...
Gianluca Bonifazi, Christopher Buratti, Michele Marchetti et al.· 0 citations
PoP-RAG is proposed, which features a passage-on-edge (PoE) graph that links the passages with graph edges to resolve the one-to-many entity-passage mapping problem and enables targeted retrieval for each sub-query and ensures transparent response derivation logic, thus enhancing explainability.
Xin-Tong Hu, Qi-Ming Zeng, Yu-Hao Lin et al.· Transactions on Graph Intell...· 1 citation
A common rank-displacement audit at three scopes is introduced at three scopes: facts supported by the edited parameter, other correct answers to the target query, and correct answers across queries with the same relation.
Yi-Cheng Lai, Jerry Wang, Hsin-Ling Hsu et al.· 0 citations
The proposed LineageRAG is a graph-based Retrieval-Augmented Generation method, which constructs one evidence for each query-derived evidence demand and completes it with a verbatim source span when the selected evidence supports that demand.
Lin-Yao Zheng, Xu-Hang Shi, Zhi-Fang Mao et al.· 0 citations