Use Graph When It Needs: Efficiently and Adaptively Integrating Retrieval-Augmented Generation with Graphs

2026-02-03

AI Summary

This work addresses the performance degradation and increased latency of GraphRAG on simple queries due to its indiscriminate use of graph structures. To overcome this limitation, the authors propose EA-GraphRAG, a novel framework that dynamically routes queries to either standard RAG or GraphRAG based on a lightweight, syntax-aware query complexity scoring mechanism. The approach innovatively integrates a syntactic feature constructor, a score-driven routing policy, and a complexity-aware reciprocal rank fusion strategy to enable efficient and adaptive knowledge-augmented generation. Evaluated across multiple single-hop and multi-hop question answering benchmarks, EA-GraphRAG achieves state-of-the-art performance in mixed-query scenarios, significantly improving accuracy while reducing inference latency.

Technology Category

• Machine Learning: Graph-based Machine Learning
• Data Mining & Knowledge Management: Graph Mining, Social Network Analysis & Community
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

• Search and Retrieval-Augmented AI: Retrieval-Augmented Generation (RAG) and multi-modal RAG
• Graph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphs
• Semantics and Knowledge: Methods to enhance, augment, integrate or synergize semantic models such as knowledge graphs and LLMs

Abstract

Large language models (LLMs) often struggle with knowledge-intensive tasks due to hallucinations and outdated parametric knowledge. While Retrieval-Augmented Generation (RAG) addresses this by integrating external corpora, its effectiveness is limited by fragmented information in unstructured domain documents. Graph-augmented RAG (GraphRAG) emerged to enhance contextual reasoning through structured knowledge graphs, yet paradoxically underperforms vanilla RAG in real-world scenarios, exhibiting significant accuracy drops and prohibitive latency despite gains on complex queries. We identify the rigid application of GraphRAG to all queries, regardless of complexity, as the root cause. To resolve this, we propose an efficient and adaptive GraphRAG framework called EA-GraphRAG that dynamically integrates RAG and GraphRAG paradigms through syntax-aware complexity analysis. Our approach introduces: (i) a syntactic feature constructor that parses each query and extracts a set of structural features; (ii) a lightweight complexity scorer that maps these features to a continuous complexity score; and (iii) a score-driven routing policy that selects dense RAG for low-score queries, invokes graph-based retrieval for high-score queries, and applies complexity-aware reciprocal rank fusion to handle borderline cases. Extensive experiments on a comprehensive benchmark, consisting of two single-hop and two multi-hop QA benchmarks, demonstrate that our EA-GraphRAG significantly improves accuracy, reduces latency, and achieves state-of-the-art performance in handling mixed scenarios involving both simple and complex queries.

Problem

• Retrieval-Augmented Generation
• GraphRAG
• query complexity
• knowledge graphs
• large language models

Innovation

• Adaptive Retrieval
• Graph-Augmented RAG
• Query Complexity Analysis
• Syntax-Aware Routing
• Reciprocal Rank Fusion