Pith. sign in

REVIEW 11 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2505.24226 v4 pith:M4HY4ZHZ submitted 2025-05-30 cs.AI

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

classification cs.AI
keywords graphragretrievalglobalgraph-basedchunksduringeffectivenessefficiency
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X LinkedIn Reddit HN
read the original 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^2GraphRAG, a streamlined graph-based RAG framework that improves both Efficiency and Effectiveness. During the indexing stage, E^2GraphRAG 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^2GraphRAG achieves up to 10 times faster indexing than GraphRAG and 100 times speedup over LightRAG in retrieval while maintaining competitive QA performance.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FlowRAG: Synergizing Explicit Reasoning via Frequency-Aware Multi-Granularity Graph Flow

    cs.AI 2026-06 unverdicted novelty 6.0

    FlowRAG adds a quad-level heterogeneous graph with summary hubs and a frequency-aware flow module to improve semantic recall and explicit multi-hop reasoning over prior GraphRAG methods.

  2. Agents-K1: Towards Agent-native Knowledge Orchestration

    cs.AI 2026-06 unverdicted novelty 6.0

    Agents-K1 is an end-to-end pipeline with a multimodal parser, 4B GRPO-trained extractor, and agent CLI that builds scientific knowledge graphs from full papers and was run on 2.46 million documents to produce Scholar-KG.

  3. MemGraphRAG: Memory-based Multi-Agent System for Graph Retrieval-Augmented Generation

    cs.IR 2026-05 unverdicted novelty 6.0

    MemGraphRAG uses a memory-based multi-agent system for globally consistent graph construction from fragmented corpora plus a memory-aware hierarchical retriever, claiming better benchmark performance than prior GraphR...

  4. MoG: Mixture of Experts for Graph-based Retrieval-Augmented Generation

    cs.CL 2026-05 unverdicted novelty 6.0

    MoG uses hub graphs for shared context and sparsely activates expert graphs with a topology-aware router, reporting over 20% relative gains on MuSiQue.

  5. MG$^2$-RAG: Multi-Granularity Graph for Multimodal Retrieval-Augmented Generation

    cs.IR 2026-04 unverdicted novelty 6.0

    MG²-RAG proposes a multi-granularity graph RAG framework that constructs hierarchical multimodal nodes via entity-driven visual grounding and performs structured retrieval, delivering SOTA results on four multimodal t...

  6. MG$^2$-RAG: Multi-Granularity Graph for Multimodal Retrieval-Augmented Generation

    cs.IR 2026-04 conditional novelty 6.0

    A lightweight hierarchical multimodal graph RAG that fuses entity-grounded visual objects with text nodes and propagates relevance via multi-granularity PPR, delivering SOTA multimodal task performance at far lower co...

  7. Agents-K1: Towards Agent-native Knowledge Orchestration

    cs.AI 2026-06 unverdicted novelty 5.0

    Agents-K1 builds agent-native scientific knowledge graphs from full papers via a multimodal parser, 4B GRPO-trained extractor, and tri-source graph interface, applied to 2.46M papers yielding Scholar-KG.

  8. Agents-K1: Towards Agent-native Knowledge Orchestration

    cs.AI 2026-06 conditional novelty 5.0

    A full-paper multimodal knowledge-graph pipeline with a GRPO-trained 4B extractor and tri-source agent CLI reports improved multi-hop scientific reasoning, alongside a released one-million-paper knowledge graph.

  9. HyperSU: Corpus-Driven Semantic-Unit Hypergraph for Retrieval-Augmented Generation

    cs.IR 2026-06 unverdicted novelty 5.0

    HyperSU introduces corpus-driven semantic-unit hyperedges via MDL optimization and clue-guided bidirectional expansion to improve hypergraph RAG accuracy over baselines.

  10. Hierarchical Long-Term Semantic Memory for LinkedIn's Hiring Agent

    cs.IR 2026-04 unverdicted novelty 5.0

    HLTM structures textual data into a schema-aligned memory tree for scalable ingestion and low-latency retrieval in LinkedIn's Hiring Assistant, reporting over 5% higher answer correctness, over 10% higher retrieval F1...

  11. Hierarchical Long-Term Semantic Memory for LinkedIn's Hiring Agent

    cs.IR 2026-04 unverdicted novelty 4.0

    HLTM builds a hierarchical memory tree from longitudinal data to enable scalable, private, low-latency retrieval, delivering over 10% gains in answer correctness and retrieval F1 for LinkedIn's Hiring Assistant while ...