EDBT 2026 Demo / reviewers in the wild / expert
Zidan Yang
dblp:400/6196
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% | |
| Artificial intelligence
1 paper |
Language models and text generation · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
prompting |
1.0 | 1 | 2026 | PathRAG: Pruning Graph-based Retrieval Augmented Generation with Relational Paths · AAAI 2026 |
Information retrieval › retrieval models
graph-based retrieval |
1.0 | 1 | 2026 | PathRAG: Pruning Graph-based Retrieval Augmented Generation with Relational Paths · AAAI 2026 |
Information retrieval › retrieval-augmented generation
graph-based retrieval-augmented generation |
1.0 | 1 | 2026 | PathRAG: Pruning Graph-based Retrieval Augmented Generation with Relational Paths · AAAI 2026 |
Information retrieval
retrieval-augmented generation |
1.0 | 1 | 2026 | PathRAG: Pruning Graph-based Retrieval Augmented Generation with Relational Paths · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
path-based prompting · 2.0flow-based pruning · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | PathRAG: Pruning Graph-based Retrieval Augmented Generation with Relational PathsabstractRetrieval-augmented generation (RAG) improves the response quality of large language models (LLMs) by retrieving knowledge from external databases. Typical RAG approaches split the text database into chunks, organizing them in a flat structure for efficient searches. To better capture the inherent dependencies and structured relationships across the text database, researchers propose to organize textual information into an indexing graph, known as graph-based RAG. However, we argue that the limitation of current graph-based RAG methods lies in the redundancy of the retrieved information, rather than its insufficiency. Moreover, previous methods use a flat structure to organize retrieved information within the prompts, leading to suboptimal performance. To overcome these limitations, we propose PathRAG, which retrieves key relational paths from the indexing graph, and converts these paths into textual form for prompting LLMs. Specifically, PathRAG effectively reduces redundant information with flow-based pruning, while guiding LLMs to generate more logical and coherent responses with path-based prompting. Experimental results show that PathRAG consistently outperforms state-of-the-art baselines across six datasets and five evaluation dimensions. Zirui Guo, Zidan Yang, Yuluo Chen, Junze Chen, Zhenghao Liu 0001, Chuan Shi 0001, Cheng Yang 0002 |
AAAI | 3 |