{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:19:16Z","timestamp":1773317956442,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,16]]},"DOI":"10.1145\/3712285.3759851","type":"proceedings-article","created":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T16:05:39Z","timestamp":1762963539000},"page":"1539-1552","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Graphago: Accelerating SSD-based Graph Processing via Activity-Aware Graph Preprocessing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9822-2469","authenticated-orcid":false,"given":"Xianghao","family":"Xu","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, Jiangsu, China and State Key Lab. for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7716-1214","authenticated-orcid":false,"given":"Yucheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathmatics and Computer Sciences, Nanchang University, Nanchang, Jiangxi, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2925-5624","authenticated-orcid":false,"given":"Gongxuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, Jiangsu, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5250-9437","authenticated-orcid":false,"given":"Yongli","family":"Cheng","sequence":"additional","affiliation":[{"name":"College of Mathematics and Computer Science, Fuzhou University, Fuzhou, Fujian, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2791-4158","authenticated-orcid":false,"given":"Fang","family":"Wang","sequence":"additional","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, Hubei, China"}]}],"member":"320","published-online":{"date-parts":[[2025,11,15]]},"reference":[{"key":"e_1_3_3_3_2_2","unstructured":"2024. http:\/\/www.graph500.org\/."},{"key":"e_1_3_3_3_3_2","doi-asserted-by":"crossref","unstructured":"Zainab Abbas Vasiliki Kalavri Paris Carbone and Vladimir Vlassov. 2018. Streaming graph partitioning: an experimental study. Proceedings of the VLDB Endowment. 11 11 (2018) 1590\u20131603.","DOI":"10.14778\/3236187.3236208"},{"key":"e_1_3_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/1480506.1480511"},{"key":"e_1_3_3_3_5_2","doi-asserted-by":"crossref","unstructured":"YuAng Chen and Yeh-Ching Chung. 2021. Workload balancing via graph reordering on multicore systems. IEEE Transactions on Parallel and Distributed Systems. 33 5 (2021) 1231\u20131245.","DOI":"10.1109\/TPDS.2021.3105323"},{"key":"e_1_3_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113362"},{"key":"e_1_3_3_3_7_2","doi-asserted-by":"crossref","unstructured":"Yongli Cheng Hong Jiang Fang Wang Yu Hua Dan Feng Wenzhong Guo and Yunxiang Wu. 2018. Using high-bandwidth networks efficiently for fast graph computation. IEEE Transactions on Parallel and Distributed Systems. 30 5 (2018) 1170\u20131183.","DOI":"10.1109\/TPDS.2018.2875084"},{"key":"e_1_3_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498258"},{"key":"e_1_3_3_3_9_2","first-page":"309","volume-title":"FAST\u201919","author":"Elyasi Nima","year":"2019","unstructured":"Nima Elyasi, Changho Choi, and Anand Sivasubramaniam. 2019. Large-scale graph processing on emerging storage devices. In FAST\u201919. 309\u2013316."},{"key":"e_1_3_3_3_10_2","doi-asserted-by":"crossref","unstructured":"Michalis Faloutsos Petros Faloutsos and Christos Faloutsos. 1999. On power-law relationships of the internet topology. ACM SIGCOMM computer communication review. 29 4 (1999) 251\u2013262.","DOI":"10.1145\/316194.316229"},{"key":"e_1_3_3_3_11_2","first-page":"17","volume-title":"OSDI\u201912","author":"Gonzalez Joseph\u00a0E","year":"2012","unstructured":"Joseph\u00a0E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI\u201912. 17\u201330."},{"key":"e_1_3_3_3_12_2","first-page":"599","volume-title":"OSDI\u201914","author":"Gonzalez Joseph\u00a0E","year":"2014","unstructured":"Joseph\u00a0E Gonzalez, Reynold\u00a0S Xin, Ankur Dave, Daniel Crankshaw, Michael\u00a0J Franklin, and Ion Stoica. 2014. GraphX: Graph Processing in a Distributed Dataflow Framework.. In OSDI\u201914. 599\u2013613."},{"key":"e_1_3_3_3_13_2","doi-asserted-by":"crossref","unstructured":"Minyang Han and Khuzaima Daudjee. 2015. Giraph unchained: Barrierless asynchronous parallel execution in pregel-like graph processing systems. Proceedings of the VLDB Endowment. 8 9 (2015) 950\u2013961.","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_3_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"e_1_3_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00042"},{"key":"e_1_3_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41404.2022.00049"},{"key":"e_1_3_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_3_3_18_2","first-page":"31","volume-title":"OSDI\u201912","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola, Guy\u00a0E Blelloch, and Carlos Guestrin. 2012. Graphchi: Large-scale graph computation on just a pc. In OSDI\u201912. USENIX, 31\u201346."},{"key":"e_1_3_3_3_19_2","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data\/com-Friendster.html."},{"key":"e_1_3_3_3_20_2","unstructured":"Rui Li Xin Yuan Mohsen Radfar Peter Marendy Wei Ni Terence\u00a0J O\u2019Brien and Pablo\u00a0M Casillas-Espinosa. 2021. Graph signal processing graph neural network and graph learning on biological data: a systematic review. IEEE Reviews in Biomedical Engineering (2021)."},{"key":"e_1_3_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00025"},{"key":"e_1_3_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607070"},{"key":"e_1_3_3_3_23_2","first-page":"285","volume-title":"FAST\u201917","author":"Liu Hang","year":"2017","unstructured":"Hang Liu and H\u00a0Howie Huang. 2017. Graphene: Fine-Grained IO Management for Graph Computing.. In FAST\u201917. 285\u2013300."},{"key":"e_1_3_3_3_24_2","doi-asserted-by":"crossref","unstructured":"Yucheng Low Danny Bickson Joseph Gonzalez Carlos Guestrin Aapo Kyrola and Joseph\u00a0M Hellerstein. 2012. Distributed GraphLab: a framework for machine learning and data mining in the cloud. PVLDB (2012) 716\u2013727.","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064191"},{"key":"e_1_3_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS49936.2021.00033"},{"key":"e_1_3_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322275"},{"key":"e_1_3_3_3_29_2","first-page":"459","volume-title":"USENIX ATC\u201919","author":"Noh Sam\u00a0H","year":"2019","unstructured":"Sam\u00a0H Noh and Jiwon Seo. 2019. Pre-select static caching and neighborhood ordering for bfs-like algorithms on disk-based graph engines. In USENIX ATC\u201919. 459\u2013474."},{"key":"e_1_3_3_3_30_2","doi-asserted-by":"crossref","unstructured":"Tarikul\u00a0Islam Papon Taishan Chen Shuo Zhang and Manos Athanassoulis. 2024. CAVE: Concurrency-Aware Graph Processing on SSDs. ACM on Management of Data. 2 3 (2024) 1\u201326.","DOI":"10.1145\/3654928"},{"key":"e_1_3_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556224"},{"key":"e_1_3_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_3_3_34_2","doi-asserted-by":"crossref","unstructured":"Tomoya Suzuki Kazuhiro Hiwada Hirotsugu Kajihara Shintaro Sano Shuou Nomura and Tatsuo Shiozawa. 2021. Approaching DRAM performance by using microsecond-latency flash memory for small-sized random read accesses: a new access method and its graph applications. Proceedings of the VLDB Endowment. 14 8 (2021) 1311\u20131324.","DOI":"10.14778\/3457390.3457397"},{"key":"e_1_3_3_3_35_2","doi-asserted-by":"crossref","unstructured":"Leslie\u00a0G Valiant. 1990. A bridging model for parallel computation. Communications of the ACM. 33 8 (1990) 103\u2013111.","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_3_3_36_2","first-page":"429","volume-title":"USENIX ATC\u201919","author":"Vora Keval","year":"2019","unstructured":"Keval Vora. 2019. LUMOS: Dependency-Driven Disk-based Graph Processing. In USENIX ATC\u201919. 429\u2013442."},{"key":"e_1_3_3_3_37_2","first-page":"507","volume-title":"USENIX ATC\u201916","author":"Vora Keval","year":"2016","unstructured":"Keval Vora, Guoqing Xu, and Rajiv Gupta. 2016. Load the edges you need: A generic I\/O optimization for disk-based graph processing. In USENIX ATC\u201916. 507\u2013522."},{"key":"e_1_3_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00120"},{"key":"e_1_3_3_3_39_2","first-page":"1239","volume-title":"USENIX ATC\u201924","author":"Wang Rui","year":"2024","unstructured":"Rui Wang, Weixu Zong, Shuibing He, Xinyu Chen, Zhenxin Li, and Zheng Dang. 2024. Efficient Large Graph Processing with Chunk-Based Graph Representation Model. In USENIX ATC\u201924. 1239\u20131255."},{"key":"e_1_3_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"e_1_3_3_3_41_2","doi-asserted-by":"crossref","unstructured":"Chengwen Wu Guangyan Zhang Yang Wang Xinyang Jiang and Weimin Zheng. 2018. Redio: Accelerating disk-based graph processing by reducing disk I\/Os. IEEE Trans. Comput. 68 3 (2018) 414\u2013425.","DOI":"10.1109\/TC.2018.2875458"},{"key":"e_1_3_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3545008.3545039"},{"key":"e_1_3_3_3_43_2","doi-asserted-by":"crossref","unstructured":"Xianghao Xu Fang Wang Hong Jiang Yongli Cheng Dan Feng and Yongxuan Zhang. 2020. A hybrid update strategy for i\/o-efficient out-of-core graph processing. IEEE Transactions on Parallel and Distributed Systems. 31 8 (2020) 1767\u20131782.","DOI":"10.1109\/TPDS.2020.2973143"},{"key":"e_1_3_3_3_44_2","doi-asserted-by":"crossref","unstructured":"Xianghao Xu Fang Wang Hong Jiang Yongli Cheng Yu Hua Dan Feng and Yongxuan Zhang. 2023. LOSC: A locality-optimized subgraph construction scheme for out-of-core graph processing. J. Parallel and Distrib. Comput. 172 (2023) 51\u201368.","DOI":"10.1016\/j.jpdc.2022.10.005"},{"key":"e_1_3_3_3_45_2","first-page":"373","volume-title":"FAST\u201924","author":"Yang Tsun-Yu","year":"2024","unstructured":"Tsun-Yu Yang, Yizou Chen, Yuhong Liang, and Ming-Chang Yang. 2024. Seraph: Towards scalable and efficient fully-external graph computation via on-demand processing. In FAST\u201924. 373\u2013387."},{"key":"e_1_3_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3620665.3640409"},{"key":"e_1_3_3_3_47_2","first-page":"381","volume-title":"FAST\u201922","author":"Yang Tsun-Yu","year":"2022","unstructured":"Tsun-Yu Yang, Yuhong Liang, and Ming-Chang Yang. 2022. Practicably boosting the processing performance of BFS-like algorithms on semi-external graph system via I\/O-efficient graph ordering. In FAST\u201922. 381\u2013396."},{"key":"e_1_3_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623626"},{"key":"e_1_3_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.10639540"},{"key":"e_1_3_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527409"},{"key":"e_1_3_3_3_51_2","first-page":"45","volume-title":"FAST\u201915","author":"Zheng Da","year":"2015","unstructured":"Da Zheng, Disa Mhembere, Randal Burns, Joshua Vogelstein, Carey\u00a0E Priebe, and Alexander\u00a0S Szalay. 2015. FlashGraph: Processing billion-node graphs on an array of commodity SSDs. In FAST\u201915. 45\u201358."},{"key":"e_1_3_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00152"},{"key":"e_1_3_3_3_53_2","first-page":"301","volume-title":"OSDI\u201916","author":"Zhu Xiaowei","year":"2016","unstructured":"Xiaowei Zhu, Wenguang Chen, Weimin Zheng, and Xiaosong Ma. 2016. Gemini: A computation-centric distributed graph processing system. In OSDI\u201916. 301\u2013316."},{"key":"e_1_3_3_3_54_2","first-page":"375","volume-title":"USENIX ATC\u201915","author":"Zhu Xiaowei","year":"2015","unstructured":"Xiaowei Zhu, Wentao Han, and Wenguang Chen. 2015. GridGraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In USENIX ATC\u201915. 375\u2013386."}],"event":{"name":"SC '25: The International Conference for High Performance Computing, Networking, Storage and Analysis","location":"St. Louis MO USA","acronym":"SC '25","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712285.3759851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:32:41Z","timestamp":1773253961000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712285.3759851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,15]]},"references-count":53,"alternative-id":["10.1145\/3712285.3759851","10.1145\/3712285"],"URL":"https:\/\/doi.org\/10.1145\/3712285.3759851","relation":{},"subject":[],"published":{"date-parts":[[2025,11,15]]},"assertion":[{"value":"2025-11-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}