{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T16:58:13Z","timestamp":1792947493834,"version":"4.5.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,8]]},"abstract":"<jats:p>The introduction of Google's Pregel generated much interest in the field of large-scale graph data processing, inspiring the development of Pregel-like systems such as Apache Giraph, GPS, Mizan, and GraphLab, all of which have appeared in the past two years. To gain an understanding of how Pregel-like systems perform, we conduct a study to experimentally compare Giraph, GPS, Mizan, and GraphLab on equal ground by considering graph and algorithm agnostic optimizations and by using several metrics. The systems are compared with four different algorithms (PageRank, single source shortest path, weakly connected components, and distributed minimum spanning tree) on up to 128 Amazon EC2 machines. We find that the system optimizations present in Giraph and GraphLab allow them to perform well. Our evaluation also shows Giraph 1.0.0's considerable improvement since Giraph 0.1 and identifies areas of improvement for all systems.<\/jats:p>","DOI":"10.14778\/2732977.2732980","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"1047-1058","source":"Crossref","is-referenced-by-count":141,"title":["An experimental comparison of pregel-like graph processing systems"],"prefix":"10.14778","volume":"7","author":[{"given":"Minyang","family":"Han","sequence":"first","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Khuzaima","family":"Daudjee","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Khaled","family":"Ammar","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xingfang","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianqi","family":"Jin","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Apache Giraph. http:\/\/giraph.apache.org.  Apache Giraph. http:\/\/giraph.apache.org."},{"key":"e_1_2_1_2_1","unstructured":"Apache Hama. http:\/\/hama.apache.org.  Apache Hama. http:\/\/hama.apache.org."},{"key":"e_1_2_1_3_1","unstructured":"GraphLab. http:\/\/graphlab.org.  GraphLab. http:\/\/graphlab.org."},{"key":"e_1_2_1_4_1","unstructured":"J. Alpert and N. Hajaj. We knew the web was big... http:\/\/googleblog.blogspot.ca\/2008\/07\/we-knew-web-was-big.html 2008.  J. Alpert and N. Hajaj. We knew the web was big... http:\/\/googleblog.blogspot.ca\/2008\/07\/we-knew-web-was-big.html 2008."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"e_1_2_1_6_1","volume-title":"Facebook Passes the 900 Million Monthly Users Barrier. http: \/\/blogs.wsj.com\/digits\/2012\/04\/23\/facebook-passes","author":"Austin S.","year":"2012","unstructured":"S. Austin . Facebook Passes the 900 Million Monthly Users Barrier. http: \/\/blogs.wsj.com\/digits\/2012\/04\/23\/facebook-passes , 2012 . S. Austin. Facebook Passes the 900 Million Monthly Users Barrier. http: \/\/blogs.wsj.com\/digits\/2012\/04\/23\/facebook-passes, 2012."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_2_1_10_1","unstructured":"A. Ching. Scaling Apache Giraph to a trillion edges. http:\/\/www.facebook.com\/10151617006153920 2013.  A. Ching. Scaling Apache Giraph to a trillion edges. http:\/\/www.facebook.com\/10151617006153920 2013."},{"key":"e_1_2_1_11_1","first-page":"302","volume-title":"IPPS '96","author":"Chung S.","year":"1996","unstructured":"S. Chung and A. Condon . Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm . In IPPS '96 , pages 302 -- 308 , 1996 . S. Chung and A. Condon. Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm. In IPPS '96, pages 302--308, 1996."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2012.47"},{"key":"e_1_2_1_13_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press , 3 rd edition, 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 3rd edition, 2009.","edition":"3"},{"key":"e_1_2_1_14_1","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"David E.","year":"2010","unstructured":"E. David and K. Jon . Networks, Crowds, and Markets: Reasoning About a Highly Connected World . Cambridge University Press , 2010 . E. David and K. Jon. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2004.73"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691555"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_2_1_18_1","first-page":"17","volume-title":"OSDI '12","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . PowerGraph: Distributed graph-parallel computation on natural graphs . In OSDI '12 , pages 17 -- 30 , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: Distributed graph-parallel computation on natural graphs. In OSDI '12, pages 17--30, 2012."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.49"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_2_1_21_1","unstructured":"Karypis Lab. METIS and ParMETIS. http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis.  Karypis Lab. METIS and ParMETIS. http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis."},{"key":"e_1_2_1_22_1","unstructured":"Z. Khayyat. Personal correspondence Apr 2014.  Z. Khayyat. Personal correspondence Apr 2014."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_2_1_25_1","first-page":"31","volume-title":"OSDI '12","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . GraphChi: Large-scale Graph Computation on Just a PC . In OSDI '12 , pages 31 -- 46 , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: Large-scale Graph Computation on Just a PC. In OSDI '12, pages 31--46, 2012."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"e_1_2_1_27_1","volume-title":"http:\/\/groups.google.com\/d\/topic\/graphlab-kdd\/2T0CjLodHFc\/","author":"Low Y.","year":"2013","unstructured":"Y. Low . Is Chromatic Engine still supported. http:\/\/groups.google.com\/d\/topic\/graphlab-kdd\/2T0CjLodHFc\/ , 2013 . Y. Low. Is Chromatic Engine still supported. http:\/\/groups.google.com\/d\/topic\/graphlab-kdd\/2T0CjLodHFc\/, 2013."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/bies.201000044"},{"key":"e_1_2_1_31_1","volume-title":"Stanford","author":"Salihoglu S.","year":"2012","unstructured":"S. Salihoglu and J. Widom . GPS: A Graph Processing System. Technical report , Stanford , 2012 . S. Salihoglu and J. Widom. GPS: A Graph Processing System. Technical report, Stanford, 2012."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_2_1_33_1","volume-title":"Stanford","author":"Salihoglu S.","year":"2013","unstructured":"S. Salihoglu and J. Widom . Optimizing Graph Algorithms on Pregel-like Systems. Technical report , Stanford , 2013 . S. Salihoglu and J. Widom. Optimizing Graph Algorithms on Pregel-like Systems. Technical report, Stanford, 2013."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544855"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376675"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_38_1","unstructured":"R. Ward and T. Molteno. Table of Linear Feedback Shift Registers. http:\/\/www.eej.ulst.ac.uk\/~ian\/modules\/EEE515\/files\/old_files\/lfsr\/lfsr_table.pdf 2007.  R. Ward and T. Molteno. Table of Linear Feedback Shift Registers. http:\/\/www.eej.ulst.ac.uk\/~ian\/modules\/EEE515\/files\/old_files\/lfsr\/lfsr_table.pdf 2007."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732977.2732980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:20:26Z","timestamp":1672226426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732977.2732980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":38,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["10.14778\/2732977.2732980"],"URL":"https:\/\/doi.org\/10.14778\/2732977.2732980","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}