Skip to content
Open access

PoP-RAG: Holistic Query Planning for GraphRAG

Sep 2026 · Transactions on Graph Intelligence and Network Applications · 1 citation · 33 references

TL;DR

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.

Abstract

Graph-based retrieval-augmented generation (GraphRAG) leverages knowledge graphs to provide context for large language models (LLMs) to generate quality responses. Yet existing GraphRAG methods suffer from two drawbacks: connecting each entity to all passages that mention the entity causes one-to-many entity-passage mapping problem and retrieves redundant passages, and fixed graph traversal patterns fail to locate target information for hard queries. To tackle the two limitations, we propose PoP-RAG, 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. PoP-RAG further introduces a query planning step that decomposes a query into sub-queries and builds a directed acyclic graph (DAG) to model their relationships. This design enables targeted retrieval for each sub-query and ensures transparent response derivation logic, thus enhancing explainability. Experimental results demonstrate that PoP-RAG outperforms existing GraphRAG methods, especially on complex queries.

Read PDF

Similar papers

#artificial intelligence Preprint Sep 2026

MOSAIC: Query-Aware Exploration Policy Adaptation for GraphRAG

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

Corpus-Guided Dual-Path Propagation for Graph Retrieval-Augmented Generation

Graph-based retrieval-augmented generation supports multi-hop retrieval by organizing corpus information into graphs. However, existing relation-free graph retrieval methods rely primarily on query-sentence similarity to search for evidence. This can exclude useful bridging evidence with low query similarity and activa...

Ba-Xian Liu, Tong Wei · 0 citations
Preprint Aug 2026

LivingRAG: Augmenting Graph RAG with Experience

LivingRAG adds a writable experience store to a graph-based retrieval backbone, enabling verified experiences to be reused during inference in two ways, and analyzes online QA streams and finds reusable signals from shared entities, graph neighborhoods, and question templates.

Yuqing Cui, Zongye Zhang, Qing-Jie Liu · 0 citations
Preprint Aug 2026

LineageRAG: Harnessing GraphRAG by Constructing Evidence Lineages with Source Grounding

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
#artificial intelligence Preprint Sep 2026

LiteRAG: Cost-Efficient Graph-Based Retrieval-Augmented Generation

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
Preprint Aug 2026

EvLink: Source-Grounded Evidence Linking for Graph RAG

Graph-based Retrieval-Augmented Generation (GraphRAG) supports multi-hop reasoning by organizing corpora into structured graphs. However, graph reachability often captures semantic association rather than evidence support, so a reachable passage may still fail to justify a required cross-passage transition. We propose...

Lin-Yao Zheng, Xu-Hang Shi, Zhi-Fang Mao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.