LogosKG: Hardware-Optimized Scalable and Interpretable Knowledge Graph Retrieval
About
Knowledge graphs (KGs) are increasingly integrated with large language models (LLMs) to provide structured, verifiable reasoning. A core operation in this integration is multi-hop retrieval, yet existing systems struggle to balance efficiency, scalability, and interpretability. We introduce LogosKG, a novel, hardware-aligned framework that enables scalable and interpretable k-hop retrieval on large KGs by building on symbolic KG formulations and executing traversal as hardware-efficient operations over decomposed subject, object, and relation representations. To scale to billion-edge graphs, LogosKG integrates degree-aware partitioning, cross-graph routing, and on-demand caching. Experiments show substantial efficiency gains over CPU and GPU baselines without loss of retrieval fidelity. With proven performance in KG retrieval, a downstream two-round KG-LLM interaction demonstrates how LogosKG enables large-scale, evidence-grounded analysis of how KG topology, such as hop distribution and connectivity, shapes the alignment between structured biomedical knowledge and LLM diagnostic reasoning, thereby opening the door for next-generation KG-LLM integration. The source code is publicly available at https://github.com/LARK-NLP-Lab/LogosKG, and an online demo is available at https://lark-nlp-lab-logoskg.hf.space/.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Knowledge Graph Retrieval | PKG Hop 3 | Query Time (ms)43.07 | 17 | |
| Knowledge Graph Retrieval | PKG Hop 4 | QT (ms)77.73 | 17 | |
| Knowledge Graph Retrieval | PKG Hop 5 | QT (ms)101 | 17 | |
| Knowledge Graph Retrieval | PKG Hop 2 | Query Time (ms)14.4 | 17 | |
| Knowledge Graph Retrieval | PKG Hop 1 | Query Time (ms)4.76 | 17 |