TY - JOUR
T1 - OpenFGL
T2 - 51st International Conference on Very Large Data Bases, VLDB 2025
AU - Beijing, Xunkai Li
AU - Yan, Yeyu
AU - Zhu, Yinlin
AU - Beijing, Zening Li
AU - Li, Rong Hua
AU - Pang, Boyang
AU - Wu, Zhengyu
AU - Wang, Guoren
AU - Yan, Guochen
AU - Zhang, Wentao
N1 - Publisher Copyright:
© 2025, VLDB Endowment. All rights reserved.
PY - 2025
Y1 - 2025
N2 - Federated graph learning (FGL) is a promising distributed training paradigm for graph neural networks across multiple local systems without direct data sharing. This approach inherently involves large-scale distributed graph processing, which closely aligns with the challenges and research focuses of graph-based data systems. Despite the proliferation of FGL, the diverse motivations from real world applications, spanning various research backgrounds and settings, pose a significant challenge to fair evaluation. To fill this gap, we propose OpenFGL, a uni!ed benchmark designed for the primary FGL scenarios: Graph-FL and Subgraph-FL. Specifically, OpenFGL includes 42 graph datasets from 18 application domains, 8 federated data simulation strategies that emphasize different graph properties, and 5 graph-based downstream tasks. Additionally, it offers 18 recently proposed SOTA FGL algorithms through a user friendly API, enabling a thorough comparison and comprehensive evaluation of their effectiveness, robustness, and efficiency. Our empirical results demonstrate the capabilities of FGL while also highlighting its potential limitations, providing valuable insights for future research in this growing field, particularly in fostering greater interdisciplinary collaboration between FGL and data systems.
AB - Federated graph learning (FGL) is a promising distributed training paradigm for graph neural networks across multiple local systems without direct data sharing. This approach inherently involves large-scale distributed graph processing, which closely aligns with the challenges and research focuses of graph-based data systems. Despite the proliferation of FGL, the diverse motivations from real world applications, spanning various research backgrounds and settings, pose a significant challenge to fair evaluation. To fill this gap, we propose OpenFGL, a uni!ed benchmark designed for the primary FGL scenarios: Graph-FL and Subgraph-FL. Specifically, OpenFGL includes 42 graph datasets from 18 application domains, 8 federated data simulation strategies that emphasize different graph properties, and 5 graph-based downstream tasks. Additionally, it offers 18 recently proposed SOTA FGL algorithms through a user friendly API, enabling a thorough comparison and comprehensive evaluation of their effectiveness, robustness, and efficiency. Our empirical results demonstrate the capabilities of FGL while also highlighting its potential limitations, providing valuable insights for future research in this growing field, particularly in fostering greater interdisciplinary collaboration between FGL and data systems.
UR - http://www.scopus.com/inward/record.url?scp=105005137249&partnerID=8YFLogxK
U2 - 10.14778/3718057.3718061
DO - 10.14778/3718057.3718061
M3 - Conference article
AN - SCOPUS:105005137249
SN - 2150-8097
VL - 18
SP - 1305
EP - 1320
JO - Proceedings of the VLDB Endowment
JF - Proceedings of the VLDB Endowment
IS - 5
Y2 - 1 September 2025 through 5 September 2025
ER -