Skip to content
Book Open access

Structure Is All You Need to Reuse: Accelerating GraphRAG via Meta-Structure-Aware KV Caching

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 3492-3503 · 0 citations · 22 references

TL;DR

MetaKV is proposed, the first structure-aware KV caching mechanism that explicitly decouples static structural logic from dynamic entity semantics in GraphRAG inference, enabling high-throughput, low-latency GraphRAG without sacrificing adherence to graph topology.

Abstract

Retrieval-Augmented Generation over Knowledge Graphs (GraphRAG) enhances Large Language Models (LLMs) with structured, multi-hop evidence. However, existing GraphRAG systems predominantly linearize retrieved subgraphs into long textual prompts, forcing LLMs to recompute identical schema-level reasoning across queries repeatedly. This text-centric design incurs substantial prefilling latency, memory overhead, and severely limited cache reuse under entity-level variations. We observe that although retrieved entities differ across queries, their underlying logical schemas (meta-structures) recur with high frequency, indicating that most computational cost is spent on repeatedly encoding invariant structural logic. In this paper, we propose MetaKV, the first structure-aware KV caching mechanism that explicitly decouples static structural logic from dynamic entity semantics in GraphRAG inference. In a preparation phase, MetaKV mines frequent meta-structures and pre-computes their Key-Value (KV) caches as reusable Skeleton KVs. During inference, query-specific entity representations are injected into reserved structural slots to assemble the context without recomputing graph topology. To further enforce faithfulness to graph reasoning, MetaKV introduces a Topological Mask that constrains attention to valid graph edges. Extensive experiments conducted on HotpotQA and MetaQA datasets demonstrate that MetaKV achieves up to 6.4× prefilling speedup and a 73% effective cache-hit rate while maintaining competitive reasoning accuracy, enabling high-throughput, low-latency GraphRAG without sacrificing adherence to graph topology.

Read PDF

Similar papers

Preprint Aug 2026

KGCache: Amortized Subgraph Retrieval for KG Reasoning with LLMs

This work proposes KGCache, an in-memory cache for one-hop knowledge graph neighborhoods, which is designed to be compatible with both iterative traversal (ToG) and one shot planning (RoG) KGQA paradigms and shows substantial entity reuse among starting entities and entities reached during traversal.

Uros Stanic, Chang-He Yuan, Sabuj Laskar et al. · 0 citations
Jul 2026

PolyUQuest: Verifiable Structure-Aware Web RAG over Heterogeneous Graphs

PolyUQuest is presented, a verifiable, structure-aware web RAG framework built on a heterogeneous graph that unifies hyperlink topology between pages, DOM hierarchy within pages, and entity-relation knowledge across pages.

Ying Liu, Yingzi Ye, Quan Feng et al. · 0 citations
Book Open access Aug 2026

Accelerating Graph-Based RAG Retrieval via Locality-Aware Device-Cloud Collaboration

Retrieval-Augmented Generation (RAG) grounds large language models in external knowledge and has become a key technique for knowledge-intensive tasks. As knowledge bases continue to scale, however, the retrieval stage increasingly dominates end-to-end latency, limiting the responsiveness of RAG systems. In this paper,...

Yongheng Deng, Tianyuan Jiang, Zhenya Ma et al. · 0 citations
Preprint Jul 2026

OptGraph: Large Language Models Enhanced Evolutionary Optimization Via Graph Retrieval-Augmented Generation

OptGraph is the first optimization agentic workflow that introduces graph retrieval-augmented generation (GraphRAG) and first constructs reusable experience as a typed graph, capturing the relationships among modeling patterns, problem formalization, implementation details, and error corrections.

Xianchao Xiu, Jianhao Li, Huangyue Chen et al. · 1 citation
Open access Jul 2026

SPIMP-RAG: structure-prior injected message passing for low-budget triple retrieval in LLM-based knowledge graph question answering

SPIMP-RAG is proposed, a coarse-to-fine triple retrieval approach whose key component is Structure-Prior Injected Message Passing (SPIMP), a fine-stage reranker that injects Directional Distance Encoding into relation-aware message passing and supports the effectiveness of structure-aware fine reranking for compact evi...

Jun Chen, Zhi-Jun Xie, Rui Wang 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.