Paper Detail

FedV-KGQA: Multi-Hop Question Answering over Vertically Partitioned Knowledge Graphs

Md Saikat Islam Khan Bappy, Oshani Seneviratne

arxiv Score 10.3

Published 2026-08-25 · First seen 2026-08-26

General AI

Abstract

Real-world data for knowledge graph question answering is often distributed across different organizations due to governance and data sovereignty constraints. While centralized systems exist, they cannot answer multi-hop questions when the required facts are split across vertically partitioned silos. In this paper, we propose FedV-KGQA, a framework for multi-hop reasoning over knowledge graphs in which organizations share entities but own disjoint sets of relations. Our approach combines local graph enrichment and knowledge graph embeddings to ensure raw triples and relation parameters never leave each silo, establishing a structural data boundary without requiring centralized graph access. We further introduce a topic entity anchoring mechanism that grounds questions in the correct graph neighborhood without any runtime inter-silo communication. We evaluate 12 model configurations across three benchmarks and show that FedV-KGQA performs strongly, remains close to centralized performance, generalizes to 3-hop reasoning, and is robust to embedding perturbations.

Workflow Status

Review status
pending
Role
unreviewed
Read priority
now
Vote
Not set.
Saved
no
Collections
Not filed yet.
Next action
Not filled yet.

Reading Brief

No structured notes yet. Add `summary_sections`, `why_relevant`, `claim_impact`, or `next_action` in `papers.jsonl` to enrich this view.

Why It Surfaced

No ranking explanation is available yet.

Tags

No tags.

BibTeX

@article{bappy2026fedv,
  title = {FedV-KGQA: Multi-Hop Question Answering over Vertically Partitioned Knowledge Graphs},
  author = {Md Saikat Islam Khan Bappy and Oshani Seneviratne},
  year = {2026},
  abstract = {Real-world data for knowledge graph question answering is often distributed across different organizations due to governance and data sovereignty constraints. While centralized systems exist, they cannot answer multi-hop questions when the required facts are split across vertically partitioned silos. In this paper, we propose FedV-KGQA, a framework for multi-hop reasoning over knowledge graphs in which organizations share entities but own disjoint sets of relations. Our approach combines local g},
  url = {https://arxiv.org/abs/2608.24846},
  keywords = {cs.AI},
  eprint = {2608.24846},
  archiveprefix = {arXiv},
}

Metadata

{}