{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:38:32Z","timestamp":1740177512265,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472022","61421003","SKLSDE-2016ZX-11"],"award-info":[{"award-number":["61472022","61421003","SKLSDE-2016ZX-11"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Advanced Innovation Center for Big Data and Brain Computing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Sustain. Comput."],"published-print":{"date-parts":[[2019,1,1]]},"DOI":"10.1109\/tsusc.2017.2780320","type":"journal-article","created":{"date-parts":[[2017,12,6]],"date-time":"2017-12-06T19:14:33Z","timestamp":1512587673000},"page":"118-131","source":"Crossref","is-referenced-by-count":1,"title":["SPFC: An Effective Optimization for Vertex-Centric Graph Processing Systems"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4034-0400","authenticated-orcid":false,"given":"Jianxin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingjie","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7588-6967","authenticated-orcid":false,"given":"Yangyang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md Zakirul Alam","family":"Bhuiyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6297-712X","authenticated-orcid":false,"given":"Bo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2287036.2287041"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038929"},{"key":"ref33","article-title":"Asynchronous large-scale graph processing made easy","author":"wang","year":"2013","journal-title":"Proc 6th Biennial Conf Innovative Data Syst Res (CIDR'13)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1155\/2000\/19436"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"article-title":"GRE: A graph runtime engine for large-scale distributed graph-parallel applications","year":"2013","author":"yan","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741096"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816682"},{"key":"ref10","first-page":"17","article-title":"PowerGraph: Distributed graph-parallel computation on natural graphs","author":"gonzalez","year":"2012","journal-title":"Proc 9th USENIX Conf Operating Syst Des Implementation"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488433"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732980"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1145\/2524211.2524218","article-title":"LFGraph: Simple and fast distributed graph analytics","author":"hoque","year":"2013","journal-title":"Proc 1st ACM SIGOPS Conf Timely Results Operating Syst"},{"article-title":"A survey and taxonomy of graph sampling","year":"2013","author":"hu","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"article-title":"Metis–unstructured graph partitioning and sparse matrix ordering system, version 4.0","year":"2009","author":"karypis","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733090"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639360"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"year":"0","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2487984"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600233"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"year":"0","key":"ref2"},{"article-title":"Residual belief propagation: Informed scheduling for asynchronous message passing","year":"2012","author":"elidan","key":"ref9"},{"year":"0","key":"ref1"},{"key":"ref20","first-page":"340","article-title":"GraphLab: A new parallel framework for machine learning","author":"low","year":"2010","journal-title":"Proc UAI"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2672672"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735517"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"article-title":"The pagerank citation ranking: Bringing order to the web","year":"1999","author":"page","key":"ref24"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"ref44","first-page":"462","article-title":"iGraph: An incremental data processing system for dynamic graph","volume":"10","author":"ju","year":"2016","journal-title":"Frontiers Comput Sci Sel Publ Chin Univ"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035942"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/bies.201000044"}],"container-title":["IEEE Transactions on Sustainable Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7274860\/8662261\/08168278.pdf?arnumber=8168278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:49:00Z","timestamp":1657745340000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8168278\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":45,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tsusc.2017.2780320","relation":{},"ISSN":["2377-3782","2377-3790"],"issn-type":[{"type":"electronic","value":"2377-3782"},{"type":"electronic","value":"2377-3790"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}