GraphScale: A Framework to Enable Machine Learning over Billion-node Graphs
Vipul Gupta, Xin Chen, Ruoyun Huang, Fanlong Meng, Jianjun Chen, Yujun, Yan

TL;DR
GraphScale introduces a unified distributed framework that significantly improves the scalability and efficiency of machine learning on billion-node graphs, enabling faster training without performance loss.
Contribution
It proposes a novel separation of data storage and computation workers, allowing asynchronous data fetching and processing for large-scale graph learning.
Findings
Reduces training time by at least 40% compared to existing methods.
Supports training on billion-node graphs in production environments.
Maintains performance while scaling to extremely large graphs.
Abstract
Graph Neural Networks (GNNs) have emerged as powerful tools for supervised machine learning over graph-structured data, while sampling-based node representation learning is widely utilized in unsupervised learning. However, scalability remains a major challenge in both supervised and unsupervised learning for large graphs (e.g., those with over 1 billion nodes). The scalability bottleneck largely stems from the mini-batch sampling phase in GNNs and the random walk sampling phase in unsupervised methods. These processes often require storing features or embeddings in memory. In the context of distributed training, they require frequent, inefficient random access to data stored across different workers. Such repeated inter-worker communication for each mini-batch leads to high communication overhead and computational inefficiency. We propose GraphScale, a unified framework for both…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
