{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:11:57Z","timestamp":1759133517221,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"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":["61572119","61622202"],"award-info":[{"award-number":["61572119","61622202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["N181605012"],"award-info":[{"award-number":["N181605012"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["1739491"],"award-info":[{"award-number":["1739491"]}]},{"name":"Lian Start Up","award":["220981"],"award-info":[{"award-number":["220981"]}]},{"DOI":"10.13039\/100010254","name":"Kent State University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010254","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61672145","61732003"],"award-info":[{"award-number":["61672145","61732003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Hong Kong RGC GRF","award":["16214716"],"award-info":[{"award-number":["16214716"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61729201"],"award-info":[{"award-number":["61729201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Hong Kong ITC ITF","award":["ITS\/391\/15FX"],"award-info":[{"award-number":["ITS\/391\/15FX"]}]},{"name":"Research Grants Council of Hong Kong, China","award":["14203618","14221716"],"award-info":[{"award-number":["14203618","14221716"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2019,11,1]]},"DOI":"10.1109\/tpds.2019.2915300","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:44:49Z","timestamp":1557276289000},"page":"2463-2477","source":"Crossref","is-referenced-by-count":5,"title":["GCache: Neighborhood-Guided Graph Caching in a Distributed Environment"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0247-9866","authenticated-orcid":false,"given":"Ye","family":"Yuan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7681-3807","authenticated-orcid":false,"given":"Xiang","family":"Lian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8257-5806","authenticated-orcid":false,"given":"Lei","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-8379","authenticated-orcid":false,"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9738-827X","authenticated-orcid":false,"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Yishu","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1892-5549","authenticated-orcid":false,"given":"Yuliang","family":"Ma","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.14778\/3402707.3402747","article-title":"Scalable sparql querying of large rdf graphs","volume":"4","author":"huang","year":"2011","journal-title":"Proc VLDB Endowment"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.44"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350248"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741096"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13489-0_21"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723714"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236250"},{"key":"ref34","first-page":"13","article-title":"Graphcache: A caching system for graph queries","author":"wang","year":"2017","journal-title":"Proc Intl Conf Extending Database Technology"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"article-title":"The pagerank citation ranking: Bringing order to the web","year":"0","author":"page","key":"ref27"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"year":"2018","key":"ref2"},{"key":"ref1","first-page":"1804","article-title":"One trillion edges: Graph processing at facebook-scale","volume":"8","author":"muthukrishnan","year":"2015","journal-title":"Proc Int Conf On Very Large Data Bases"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732980"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1590\/S0103-97332009000400013"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994756"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433461"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(81)90008-0"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412232"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"ref12","article-title":"Reordering very large graphs for fun & profit","author":"auroux","year":"2015","journal-title":"Proc Int Symp Web Algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/32.9055"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8257937"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1201\/9781315274386"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.026129"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1101\/gr.074492.107"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-1251-6"},{"key":"ref5","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":"ref8","first-page":"49","article-title":"Tao: Facebook's distributed data store for the social graph","author":"bronson","year":"2013","journal-title":"Proc Usenix Technical Conf"},{"key":"ref7","article-title":"G-thinker: Big graph mining made easier and faster","author":"yan","year":"2017","journal-title":"arXiv 1709 03110"},{"key":"ref49","first-page":"708","article-title":"A parallel approximation algorithm for the weighted maximum matching problem","author":"manne","year":"2007","journal-title":"Proc 7th Int Conf Parallel Process Appl Math"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IC2E.2015.39"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2901919"},{"key":"ref45","first-page":"553","article-title":"Catch the wind: Graph workload balancing on cloud","author":"shang","year":"2013","journal-title":"Proc 29th IEEE Int Conf Data Eng"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.1998.740525"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45591-4_68"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"journal-title":"General Purpose Parallel Architectures","year":"1991","author":"valiant","key":"ref41"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639359"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8863608\/08708952.pdf?arnumber=8708952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:44Z","timestamp":1657745564000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8708952\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,1]]},"references-count":50,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2019.2915300","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":[[2019,11,1]]}}}