Skip to content
Conference

Edge-AdaptiveKG: Resource-Efficient Knowledge Graph Construction for RAG on Edge Devices

Aug 2026 · IEEE International Conference on Embedded and Real-Time Computing Systems and Applications · pp. 190-200 · 0 citations · 43 references

Abstract

Integrating Knowledge Graphs (KGs) into Retrieval-Augmented Generation (RAG) can substantially improve LLM performance on complex question answering (QA) by reducing hallucinations and supplying structured context. However, building high-quality KGs over large corpora for edge scenarios is challenging: cloud-based processing introduces latency and dependency on remote services, while exhaustive on-device construction with LLMs is often computationally infeasible under limited hardware budgets. We observe that traditional non-LLM methods can efficiently capture explicit knowledge, and that real-world queries typically touch only a small, highly concentrated portion of the graph. As a result, static and exhaustive KG construction is redundant and inefficient. We propose Edge-AdaptiveKG, a resource-aware framework that combines an offline Seed KG (S-KG) with an online Query-driven KG (Q-KG). Lightweight non-LLM methods build the S-KG, while the LLM is invoked on demand during question answering to incrementally expand the Q-KG only when complex relations are needed. Experiments show that Edge-AdaptiveKG reduces computational overhead and inference latency, enabling KG-enhanced RAG on resource-constrained devices while maintaining competitive QA accuracy.

View source

Similar papers

Jul 2026

MARS: Multi-hop Adaptive Retrieval and SPARQL Generation for KGQA

This work proposes MARS, a scalable knowledge graph question answering (KGQA) approach that requires no model fine-tuning, and performs a structured retrieval procedure that links question entities to the KG and iteratively retrieves relevant next-hop information.

Nikit Srivastava, Daniel Vollmers, René Speck et al. · 0 citations
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
#artificial intelligence Preprint Sep 2026

LiteRAG: Cost-Efficient Graph-Based Retrieval-Augmented Generation

LiteRAG is presented, a graph-based retrieval method that replaces expensive retrieval-time LLM control with query-conditioned algorithmic exploration and reasoning-chain context construction and attains the highest overall quality among the evaluated methods.

Daniel Alejandro Coll Tejeda, Pedro García López, Daniel Barcelona-Pons · 0 citations
Aug 2026

Improving GraphRAG with Multi-hop Knowledge Graph Completion on the Example of the Telecommunications Domain

This paper proposes an enhanced GraphRAG framework that integrates a transformer-based Multi-Hop Knowledge Graph Completion (KGC) model directly into the retrieval pipeline, and provides substantial gains in answer quality and reasoning capability for queries involving indirect dependencies not explicitly encoded in th...

A. Golovin, N. Zhukova, Tian-Xing Man · 0 citations
#artificial intelligence Preprint Sep 2026

Enabling Knowledge Graph Understanding at Scale with the EXplore Your Graphs ENgine (EXYGEN)

We present EXYGEN (EXplore Your Graphs ENgine), a framework for knowledge graph (KG) understanding that enables conversational access to KGs at scale. We address two questions in sequence. First, how effectively can LLMs perform text-to-SPARQL generation given only automatically derived structured metadata and small gr...

Harshdeep Singh, Yu-Rui Zhu, Giovanni Colavizza et al. · 0 citations
Preprint Sep 2026

KGVoyager: Knowledge Graph Agnostic Question Answering via Agentic Navigation

KGVoyager is presented, a KG-agnostic agentic architecture that generates SPARQL queries from natural language questions by dynamically discovering graph structure and semantics, requiring only a query endpoint of the underlying graph.

Essam Wisam, Cheng-Kai Li · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.