{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:19:27Z","timestamp":1725574767793},"reference-count":46,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/bigdata.2018.8622032","type":"proceedings-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T03:07:18Z","timestamp":1548385638000},"page":"242-251","source":"Crossref","is-referenced-by-count":1,"title":["An Empirical Analysis on Expressibility of Vertex Centric Graph Processing Paradigm"],"prefix":"10.1109","author":[{"given":"Siyuan","family":"Liu","sequence":"first","affiliation":[]},{"given":"Arijit","family":"Khan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556572"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610518"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"ref31","article-title":"Scalability! But at What Cost?","author":"mcsherry","year":"2015","journal-title":"HOTOS"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732294"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733058"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1145\/2764947.2764954","article-title":"Graphalytics: A Big Data Benchmark for Graph-Processing Platforms","author":"capota","year":"2015","journal-title":"GRADES"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"ref11","article-title":"A framework for parallel graph algorithms using work-efficient bucketing","author":"dhulipala","year":"2017","journal-title":"SPAA"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/363269.363610"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2010.5713180"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1851476.1851593"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1145\/2742854.2742884","article-title":"An Evaluation and Analysis of Graph Processing Frameworks on Five Key Issues","author":"gao","year":"2015","journal-title":"CF"},{"key":"ref16","article-title":"Power-Graph: Distributed Graph-parallel Computation on Natural Graphs","author":"gonzalez","year":"2012","journal-title":"OSDI"},{"key":"ref17","article-title":"GraphX: Graph Processing in a Distributed Dataflow Framework","author":"gonzalez","year":"2014","journal-title":"OSDI"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.49"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735517"},{"key":"ref4","article-title":"Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors","author":"bader","year":"2005","journal-title":"HiPC"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735477"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0269-7"},{"year":"0","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989497"},{"year":"0","key":"ref1"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213895"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732980"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733089"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2762294"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"ref42","article-title":"Asynchronous Large-Scale Graph Processing Made Easy","author":"wang","year":"2013","journal-title":"CIDR"},{"key":"ref24","article-title":"Vertex-Centric Graph Processing: Good, Bad, and the Ugly","author":"khan","year":"2017","journal-title":"EDBT"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741096"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2912566"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733067"}],"event":{"name":"2018 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2018,12,10]]},"location":"Seattle, WA, USA","end":{"date-parts":[[2018,12,13]]}},"container-title":["2018 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8610059\/8621858\/08622032.pdf?arnumber=8622032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T22:47:50Z","timestamp":1643237270000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8622032\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2018.8622032","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}