{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T08:54:51Z","timestamp":1777971291630,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,17]],"date-time":"2019-11-17T00:00:00Z","timestamp":1573948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61832006, 61825202, 61702202, 61929103"],"award-info":[{"award-number":["61832006, 61825202, 61702202, 61929103"]}]},{"name":"National Key Research and Development Program of China","award":["2018YFB1003500"],"award-info":[{"award-number":["2018YFB1003500"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,17]]},"DOI":"10.1145\/3295500.3356143","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:43:22Z","timestamp":1573155802000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["GraphM"],"prefix":"10.1145","author":[{"given":"Jin","family":"Zhao","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"Liao","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ligang","family":"He","sequence":"additional","affiliation":[{"name":"University of Warwick, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haikun","family":"Liu","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Chen","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2019. didi. http:\/\/www.didiglobal.com\/.  2019. didi. http:\/\/www.didiglobal.com\/."},{"key":"e_1_3_2_1_2_1","unstructured":"2019. facebook. http:\/\/www.facebook.com\/.  2019. facebook. http:\/\/www.facebook.com\/."},{"key":"e_1_3_2_1_3_1","unstructured":"2019. huawei. http:\/\/www.huawei.com\/.  2019. huawei. http:\/\/www.huawei.com\/."},{"key":"e_1_3_2_1_4_1","unstructured":"2019. LAW. http:\/\/law.di.unimi.it\/datasets.php.  2019. LAW. http:\/\/law.di.unimi.it\/datasets.php."},{"key":"e_1_3_2_1_5_1","unstructured":"2019. SNAP. http:\/\/snap.stanford.edu\/data\/index.html.  2019. SNAP. http:\/\/snap.stanford.edu\/data\/index.html."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2019.00051"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence. 6119--6126","author":"Blum Johannes","year":"2018","unstructured":"Johannes Blum , Stefan Funke , and Sabine Storandt . 2018 . Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks . In Proceedings of the 32nd AAAI Conference on Artificial Intelligence. 6119--6126 . Johannes Blum, Stefan Funke, and Sabine Storandt. 2018. Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence. 6119--6126."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480506.1480511"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 2013 USENIX Annual Technical Conference. 49--60","author":"Bronson Nathan","year":"2013","unstructured":"Nathan Bronson , Zach Amsden , George Cabrera , Prasad Chakka , Peter Dimov , Hui Ding , Jack Ferris , Anthony Giardullo , Sachin Kulkarni , Harry C. Li , Mark Marchukov , Dmitri Petrov , Lovro Puzar , Yee Jiun Song , and Venkateshwaran Venkataramani . 2013 . TAO: Facebook's Distributed Data Store for the Social Graph . In Proceedings of the 2013 USENIX Annual Technical Conference. 49--60 . Nathan Bronson, Zach Amsden, George Cabrera, Prasad Chakka, Peter Dimov, Hui Ding, Jack Ferris, Anthony Giardullo, Sachin Kulkarni, Harry C. Li, Mark Marchukov, Dmitri Petrov, Lovro Puzar, Yee Jiun Song, and Venkateshwaran Venkataramani. 2013. TAO: Facebook's Distributed Data Store for the Social Graph. In Proceedings of the 2013 USENIX Annual Technical Conference. 49--60."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063471"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113362"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3323298.3323327"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation. 17--30","author":"Gonzalez Joseph E.","year":"2012","unstructured":"Joseph E. Gonzalez , Yucheng Low , Haijie Gu , Danny Bickson , and Carlos Guestrin . 2012 . PowerGraph: distributed graph-parallel computation on natural graphs . In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation. 17--30 . Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: distributed graph-parallel computation on natural graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation. 17--30."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0027"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503246"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00042"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196915"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 17th USENIX Conference on File and Storage Technologies. 249--263","author":"Kumar Pradeep","unstructured":"Pradeep Kumar and H. Howie Huang . 2019. GraphOne: A Data Store for Real-time Analytics on Evolving Graphs . In Proceedings of the 17th USENIX Conference on File and Storage Technologies. 249--263 . Pradeep Kumar and H. Howie Huang. 2019. GraphOne: A Data Store for Real-time Analytics on Evolving Graphs. In Proceedings of the 17th USENIX Conference on File and Storage Technologies. 249--263."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation. 31--46","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola , Guy Blelloch , and Carlos Guestrin . 2012 . GraphChi: Large-Scale Graph Computation on Just a PC . In Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation. 31--46 . Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. 2012. GraphChi: Large-Scale Graph Computation on Just a PC. In Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation. 31--46."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the 15th USENIX Conference on File and Storage Technologies. 285--300","author":"Liu Hang","unstructured":"Hang Liu and H. Howie Huang . 2017. Graphene: Fine-Grained I\/O Management for Graph Computing . In Proceedings of the 15th USENIX Conference on File and Storage Technologies. 285--300 . Hang Liu and H. Howie Huang. 2017. Graphene: Fine-Grained I\/O Management for Graph Computing. In Proceedings of the 15th USENIX Conference on File and Storage Technologies. 285--300."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735517"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 2017 USENIX Annual Technical Conference. 631--643","author":"Malicevic Jasmina","year":"2017","unstructured":"Jasmina Malicevic , Baptiste Joseph Eustache Lepers , and Willy Zwaenepoel . 2017 . Everything You Always Wanted to Know about Multicore Graph Processing but Were Afraid to Ask . In Proceedings of the 2017 USENIX Annual Technical Conference. 631--643 . Jasmina Malicevic, Baptiste Joseph Eustache Lepers, and Willy Zwaenepoel. 2017. Everything You Always Wanted to Know about Multicore Graph Processing but Were Afraid to Ask. In Proceedings of the 2017 USENIX Annual Technical Conference. 631--643."},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 797--806","author":"Meyer Ulrich","year":"2001","unstructured":"Ulrich Meyer . 2001 . Single-source shortest-paths on arbitrary directed graphs in linear average-case time . In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 797--806 . Ulrich Meyer. 2001. Single-source shortest-paths on arbitrary directed graphs in linear average-case time. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 797--806."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2017.40"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300091"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation. 317--332","author":"Shi Jiaxin","year":"2016","unstructured":"Jiaxin Shi , Youyang Yao , Rong Chen , Haibo Chen , and Feifei Li . 2016 . Fast and Concurrent RDF Queries with RDMA-Based Distributed Graph Exploration . In Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation. 317--332 . Jiaxin Shi, Youyang Yao, Rong Chen, Haibo Chen, and Feifei Li. 2016. Fast and Concurrent RDF Queries with RDMA-Based Distributed Graph Exploration. In Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation. 317--332."},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 135--146","author":"Shun Julian","unstructured":"Julian Shun and Guy E. Blelloch . 2013. Ligra: a lightweight graph processing framework for shared memory . In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 135--146 . Julian Shun and Guy E. Blelloch. 2013. Ligra: a lightweight graph processing framework for shared memory. In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 135--146."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00052"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of the 2019 USENIX Annual Technical Conference. 429--442","author":"Vora Keval","year":"2019","unstructured":"Keval Vora . 2019 . LUMOS: Dependency-Driven Disk-based Graph Processing . In Proceedings of the 2019 USENIX Annual Technical Conference. 429--442 . Keval Vora. 2019. LUMOS: Dependency-Driven Disk-based Graph Processing. In Proceedings of the 2019 USENIX Annual Technical Conference. 429--442."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037744"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600222"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.38"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300064"},{"key":"e_1_3_2_1_43_1","volume-title":"Proceedings of the 2018 USENIX Annual Technical Conference. 441--452","author":"Zhang Yu","year":"2018","unstructured":"Yu Zhang , Xiaofei Liao , Hai Jin , Lin Gu , Ligang He , Bingsheng He , and Haikun Liu . 2018 . CGraph: A Correlations-aware Approach for Efficient Concurrent Iterative Graph Processing . In Proceedings of the 2018 USENIX Annual Technical Conference. 441--452 . Yu Zhang, Xiaofei Liao, Hai Jin, Lin Gu, Ligang He, Bingsheng He, and Haikun Liu. 2018. CGraph: A Correlations-aware Approach for Efficient Concurrent Iterative Graph Processing. In Proceedings of the 2018 USENIX Annual Technical Conference. 441--452."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2624289"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2781241"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304029"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2776115"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319406"},{"key":"e_1_3_2_1_49_1","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies. 45--58","author":"Zheng Da","unstructured":"Da Zheng , Disa Mhembere , Randal C. Burns , Joshua T. Vogelstein , Carey E. Priebe , and Alexander S. Szalay . 2015. FlashGraph: processing billion-node graphs on an array of commodity SSDs . In Proceedings of the 13th USENIX Conference on File and Storage Technologies. 45--58 . Da Zheng, Disa Mhembere, Randal C. Burns, Joshua T. Vogelstein, Carey E. Priebe, and Alexander S. Szalay. 2015. FlashGraph: processing billion-node graphs on an array of commodity SSDs. In Proceedings of the 13th USENIX Conference on File and Storage Technologies. 45--58."},{"key":"e_1_3_2_1_50_1","volume-title":"Proceedings of the 2015 USENIX Annual Technical Conference. 375--386","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 Proceedings of the 2015 USENIX Annual Technical Conference. 375--386 . Xiaowei Zhu, Wentao Han, and Wenguang Chen. 2015. GridGraph: Large scale graph processing on a single machine using 2-level hierarchical partitioning. In Proceedings of the 2015 USENIX Annual Technical Conference. 375--386."}],"event":{"name":"SC '19: The International Conference for High Performance Computing, Networking, Storage, and Analysis","location":"Denver Colorado","acronym":"SC '19","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3295500.3356143","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3295500.3356143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:13Z","timestamp":1750208533000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3295500.3356143"}},"subtitle":["an efficient storage system for high throughput of concurrent graph processing"],"short-title":[],"issued":{"date-parts":[[2019,11,17]]},"references-count":49,"alternative-id":["10.1145\/3295500.3356143","10.1145\/3295500"],"URL":"https:\/\/doi.org\/10.1145\/3295500.3356143","relation":{},"subject":[],"published":{"date-parts":[[2019,11,17]]},"assertion":[{"value":"2019-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}