Accelerating Storage-Based Training for Graph Neural Networks

Myung-Hwan Jang, Jeong-Min Park, Yunyong Ko, Sang-Wook Kim
1/4/2026
cs.LGcs.AIcs.DB

Official code: Bigdasgit/agnes-kdd26 (2 stars, MIT, last commit 2026-01-01).

Abstract

Graph neural networks (GNNs) have achieved breakthroughs in various real-world downstream tasks due to their powerful expressiveness. As the scale of real-world graphs has been continuously growing, a storage-based approach to GNN training has been studied, which leverages external storage (e.g., NVMe SSDs) to handle such web-scale graphs on a single machine. Although such storage-based GNN training methods have shown promising potential in large-scale GNN training, we observed that they suffer from a severe bottleneck in data preparation since they overlook a critical challenge: how to handle a large number of small storage I/Os. To address the challenge, in this paper, we propose a novel storage-based GNN training framework, named AGNES, that employs a method of block-wise storage I/O processing to fully utilize the I/O bandwidth of high-performance storage devices. Moreover, to further enhance the efficiency of each storage I/O, AGNES employs a simple yet effective strategy, hyperbatch-based processing based on the characteristics of real-world graphs. Comprehensive experiments on five real-world graphs reveal that AGNES consistently outperforms four state-of-the-art methods, by up to 4.1X faster than the best competitor. Our code is available at https://github.com/Bigdasgit/agnes-kdd26.

View on arXivView PDF

Code Implementations(1)

MIT
21C++, ShellDec 30, 20259 months agoMIT

Similar Papers

Cite this paper

@article{jang2026accelerating,
  title  = {Accelerating Storage-Based Training for Graph Neural Networks},
  author = {Myung-Hwan Jang and Jeong-Min Park and Yunyong Ko and Sang-Wook Kim},
  year   = {2026},
  eprint = {2601.01473},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.01473v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.01473.svg)](https://codeofpaper.com/paper/2601.01473)

Discussion