PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 8, 20250 citationsOpen Access

E²GraphRAG: Streamlining Graph-based RAG for High Efficiency and Effectiveness

View Full Paper
YZYibo ZhaoJZJiapeng ZhuYGYe Guo

Key Points

  • E^2GraphRAG achieves up to 10 times faster indexing than GraphRAG and 100 times speedup in retrieval.
  • The method constructs a summary tree using large language models and an entity graph with SpaCy.
  • An adaptive retrieval strategy utilizes the graph structure for enhanced local and global retrieval.
  • The framework maintains competitive question-answering performance while improving operational speed.

Abstract

Graph-based RAG methods like GraphRAG have shown promising global understanding of the knowledge base by constructing hierarchical entity graphs. However, they often suffer from inefficiency and rely on manually pre-defined query modes, limiting practical use. In this paper, we propose E²GraphRAG, a streamlined graph-based RAG framework that improves both Efficiency and Effectiveness. During the indexing stage, E²GraphRAG constructs a summary tree with large language models and an entity graph with SpaCy based on document chunks. We then construct bidirectional indexes between entities and chunks to capture their many-to-many relationships, enabling fast lookup during both local and global retrieval. For the retrieval stage, we design an adaptive retrieval strategy that leverages the graph structure to retrieve and select between local and global modes. Experiments show that E²GraphRAG achieves up to 10 times faster indexing than GraphRAG and 100 times speedup over LightRAG in retrieval while maintaining competitive QA performance.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhao et al. (2025) studied this question.

synapsesocial.com/papers/68e6bc5f38ca8e474d549e81https://doi.org/10.48550/arxiv.2505.24226
Ask AI
Helpful
Bookmark
Share
View Full Paper