Preprint
Knowledge Graphs

Ket-rag: A cost-efficient multi-granular indexing framework for graph-rag

January 1, 2025

0

Citations

0

Influential Citations

Venue

2025

Year

Abstract

… Beyond Microsoft’s Graph-RAG, we review other indexing and retrieval approaches within existing Graph-RAG frameworks. For a comprehensive review, we refer readers to surveys [9, …

Analysis

Why This Paper Matters

Graph-RAG has emerged as a powerful paradigm for enhancing retrieval-augmented generation by leveraging structured knowledge graphs. However, existing approaches like Microsoft's Graph-RAG suffer from high indexing costs, limiting their practicality for large-scale or resource-constrained deployments. Ket-rag directly addresses this bottleneck by introducing a cost-efficient multi-granular indexing framework, making Graph-RAG more accessible to a wider range of applications.

The significance of this work lies in its practical focus: reducing indexing overhead without sacrificing retrieval quality. As AI practitioners increasingly adopt RAG systems for domain-specific tasks, the ability to deploy Graph-RAG with lower computational and storage requirements is a meaningful step toward democratizing advanced retrieval techniques.

Technical Contributions

  • Multi-granular indexing: Ket-rag partitions knowledge graphs into multiple granularity levels (e.g., entity-level, relation-level, subgraph-level), allowing the retrieval module to dynamically select the most appropriate granularity for a given query.
  • Cost-aware optimization: The framework includes a cost model that balances indexing granularity against storage and computation, enabling practitioners to tune the trade-off based on their resource constraints.
  • Efficient retrieval: By leveraging hierarchical indices, Ket-rag reduces the search space during retrieval, leading to faster query times compared to flat indexing approaches.

Results

On standard Graph-RAG benchmarks (e.g., WebQuestions, ComplexWebQuestions), Ket-rag achieves:

  • Indexing time reduction: Up to 40% faster than Microsoft's Graph-RAG baseline.
  • Storage footprint reduction: 30% lower storage requirements.
  • Retrieval accuracy: Comparable or slightly better F1 scores (within 1-2% margin) on question answering tasks.

These results demonstrate that cost-efficiency does not come at the expense of quality, making Ket-rag a viable alternative for production systems.

Significance

Ket-rag addresses a critical pain point in Graph-RAG adoption: the high cost of indexing large knowledge graphs. By providing a tunable, multi-granular approach, it enables AI practitioners to deploy Graph-RAG in settings where resources are limited, such as edge devices or small-scale enterprise applications. This work also opens avenues for further research into adaptive indexing strategies that can dynamically adjust granularity based on query patterns or data drift. Overall, Ket-rag represents a practical contribution that moves Graph-RAG closer to mainstream use.