{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:11:38Z","timestamp":1778278298122,"version":"3.51.4"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/icde.2016.7498231","type":"proceedings-article","created":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T11:36:34Z","timestamp":1466854594000},"page":"85-96","source":"Crossref","is-referenced-by-count":13,"title":["Computing Connected Components with linear communication cost in pregel-like systems"],"prefix":"10.1109","author":[{"given":"Xing","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/11963271_15"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/0214061"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"ref37","article-title":"Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing","author":"zaharia","year":"2012","journal-title":"Proc of NSDI'12"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733089"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/WiMOB.2012.6379139"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"ref10","article-title":"Graphx: Graph processing in a distributed dataflow framework","author":"gonzalez","year":"2014","journal-title":"Proc of OSDI '14"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.141"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.121"},{"key":"ref14","article-title":"PEGASUS: A peta-scale graph mining system","author":"kang","year":"2009","journal-title":"Proc ICDM '09"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486180"},{"key":"ref18","article-title":"I\/o-complexity of graph algorithms","author":"munagala","year":"1999","journal-title":"roc of SODA'99"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2008.ECP.31"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2014.7116914"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"ref27","article-title":"An o(log n) parallel connectivity algorithm","author":"shiloach","year":"1982","journal-title":"J Algorithms"},{"key":"ref3","article-title":"Giraph: Large-scale graph processing infrastructure on hadoop","author":"ching","year":"2011","journal-title":"Hadoop Summit"},{"key":"ref6","article-title":"Mapreduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proc of OSDI'04"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.95"},{"key":"ref5","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498231"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755591"},{"key":"ref9","author":"gibbons","year":"1985","journal-title":"Algorithmic Graph Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676869"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg415"},{"key":"ref22","author":"ramachandran","year":"1992","journal-title":"Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593661"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732294"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544813"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.01.016"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00127-6"}],"event":{"name":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","location":"Helsinki, Finland","start":{"date-parts":[[2016,5,16]]},"end":{"date-parts":[[2016,5,20]]}},"container-title":["2016 IEEE 32nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7491900\/7498210\/07498231.pdf?arnumber=7498231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,9,30]],"date-time":"2016-09-30T00:21:45Z","timestamp":1475194905000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7498231\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/icde.2016.7498231","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}