FedV-KGQA: Multi-Hop Question Answering over Vertically Partitioned Knowledge Graphs
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 l
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- PossiblePossibly related (embedding) · 48%BaryGraph - knowledge graph where every relationship is its own embedded document (not an edge) [R] →
- LinkedLinked via arxiv author · 85%Md Saikat Islam Khan Bappy →
“FedV-KGQA: Multi-Hop Question Answering over Vertically Partitioned Knowledge Graphs”
- LinkedLinked via arxiv author · 85%Oshani Seneviratne →
“FedV-KGQA: Multi-Hop Question Answering over Vertically Partitioned Knowledge Graphs”
