{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T10:32:36Z","timestamp":1742639556469,"version":"3.37.3"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702202","61628204","61732010"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"China Postdoctoral Science Foundation Funded Project","award":["2017M610477","2017T100555"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2018,4,1]]},"DOI":"10.1109\/tpds.2017.2776115","type":"journal-article","created":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T19:17:04Z","timestamp":1511378224000},"page":"830-842","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Disk-Based Directed Graph Processing: A Strongly Connected Component Approach"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2052-2231","authenticated-orcid":false,"given":"Yu","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7903-2061","authenticated-orcid":false,"given":"Xiaofei","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"29","article-title":"Distributed calculation of pagerank using strongly connected components","author":"brinkmeier","year":"2005","journal-title":"Proc Int Workshop Innovative Internet Community Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920986"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556581"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168846"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688508"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2333511"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035927"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"276","DOI":"10.14778\/1920841.1920879","article-title":"GRAIL: Scalable reachability index for large graphs","volume":"3","author":"yildirim","year":"2010","journal-title":"Proc VLDB Endowment"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu015"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851154"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113362"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851161"},{"key":"ref11","first-page":"375","article-title":"GridGraph: Large scale graph processing on a single machine using 2-level hierarchical partitioning","author":"zhu","year":"2015","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498258"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.38"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"ref16","first-page":"1","article-title":"GraphLab: A new framework for parallel machine learning","author":"low","year":"2010","journal-title":"Proc 26th Conf Uncertainty Artif Intell"},{"key":"ref17","first-page":"17","article-title":"PowerGraph: Distributed graph-parallel computation on natural graphs","author":"gonzalez","year":"2012","journal-title":"Proc 10th USENIX Conf Operat Syst Des Implementation"},{"key":"ref18","first-page":"1","article-title":"Chronos: A graph engine for temporal graph analysis","author":"han","year":"2014","journal-title":"Proc 9th EUR Conf Comput"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2700302"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.98"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1145\/1367497.1367618","article-title":"Video suggestion and discovery for YouTube: Taking random walks through the view graph","author":"baluja","year":"2008","journal-title":"Proc 17th Int Conf World Wide Web"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2624289"},{"article-title":"The pagerank citation ranking: Bringing order to the web","year":"1998","author":"page","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2014.2328594"},{"key":"ref5","first-page":"797","article-title":"Single-source shortest-paths on arbitrary directed graphs in linear average-case time","author":"meyer","year":"2001","journal-title":"Proc ACM-SIAM Ann Symp Discrete Algorithms"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"ref7","first-page":"31","article-title":"GraphChi: Large-scale graph computation on just a PC","author":"kyrola","year":"2012","journal-title":"Proc 10th USENIX Conf Operat Syst Des Implementation"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037744"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-5551-7"},{"year":"2016","key":"ref46"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2518664"},{"year":"2016","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.111"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735517"},{"year":"2016","key":"ref47"},{"key":"ref21","first-page":"507","article-title":"Load the edges you need: A generic I\/O optimization for disk-based graph processing","author":"vora","year":"2016","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.235"},{"key":"ref24","first-page":"599","article-title":"GraphX: Graph processing in a distributed dataflow framework","author":"gonzalez","year":"2014","journal-title":"Proc 11th USENIX Conf Operating Syst Des Implementation"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503246"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"year":"2016","key":"ref44"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1151087.1151090"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2015.2415810"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8314284\/08118091.pdf?arnumber=8118091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T23:32:51Z","timestamp":1693265571000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8118091\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,1]]},"references-count":48,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2017.2776115","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2018,4,1]]}}}