{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:55:34Z","timestamp":1771700134490,"version":"3.50.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,10]]},"abstract":"<jats:p>There is a growing need for distributed graph processing systems that are capable of gracefully scaling to very large graph datasets. Unfortunately, this challenge has not been easily met due to the intense memory pressure imposed by process-centric, message passing designs that many graph processing systems follow. Pregelix is a new open source distributed graph processing system that is based on an iterative dataflow design that is better tuned to handle both in-memory and out-of-core workloads. As such, Pregelix offers improved performance characteristics and scaling properties over current open source systems (e.g., we have seen up to 15X speedup compared to Apache Giraph and up to 35X speedup compared to distributed GraphLab), and more effective use of available machine resources to support Big(ger) Graph Analytics.<\/jats:p>","DOI":"10.14778\/2735471.2735477","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"161-172","source":"Crossref","is-referenced-by-count":76,"title":["Pregelix"],"prefix":"10.14778","volume":"8","author":[{"given":"Yingyi","family":"Bu","sequence":"first","affiliation":[{"name":"University of California, Irvine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinayak","family":"Borkar","sequence":"additional","affiliation":[{"name":"X15 Software, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Jia","sequence":"additional","affiliation":[{"name":"University of California, Irvine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Carey","sequence":"additional","affiliation":[{"name":"University of California, Irvine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tyson","family":"Condie","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"AsterixDB. http:\/\/asterixdb.ics.uci.edu.  AsterixDB. http:\/\/asterixdb.ics.uci.edu."},{"key":"e_1_2_1_2_1","unstructured":"BTC. http:\/\/km.aifb.kit.edu\/projects\/btc-2009\/.  BTC. http:\/\/km.aifb.kit.edu\/projects\/btc-2009\/."},{"key":"e_1_2_1_3_1","unstructured":"Genomix. https:\/\/github.com\/uci-cbcl\/genomix.  Genomix. https:\/\/github.com\/uci-cbcl\/genomix."},{"key":"e_1_2_1_4_1","unstructured":"Giraph. http:\/\/giraph.apache.org\/.  Giraph. http:\/\/giraph.apache.org\/."},{"key":"e_1_2_1_5_1","unstructured":"Hadoop\/HDFS. http:\/\/hadoop.apache.org\/.  Hadoop\/HDFS. http:\/\/hadoop.apache.org\/."},{"key":"e_1_2_1_6_1","unstructured":"Hama. http:\/\/hama.apache.org\/.  Hama. http:\/\/hama.apache.org\/."},{"key":"e_1_2_1_7_1","unstructured":"Pivotal. http:\/\/www.gopivotal.com\/products\/pivotal-greenplum-database.  Pivotal. http:\/\/www.gopivotal.com\/products\/pivotal-greenplum-database."},{"key":"e_1_2_1_8_1","unstructured":"Teradata. http:\/\/www.teradata.com.  Teradata. http:\/\/www.teradata.com."},{"key":"e_1_2_1_9_1","unstructured":"Vertica. http:\/\/www.vertica.com.  Vertica. http:\/\/www.vertica.com."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/16894.16859"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807148"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767921"},{"key":"e_1_2_1_13_1","volume-title":"Scaling datalog for machine learning on big data. CoRR, abs\/1203.0160","author":"Bu Y.","year":"2012","unstructured":"Y. Bu , V. R. Borkar , M. J. Carey , J. Rosen , N. Polyzotis , T. Condie , M. Weimer , and R. Ramakrishnan . Scaling datalog for machine learning on big data. CoRR, abs\/1203.0160 , 2012 . Y. Bu, V. R. Borkar, M. J. Carey, J. Rosen, N. Polyzotis, T. Condie, M. Weimer, and R. Ramakrishnan. Scaling datalog for machine learning on big data. CoRR, abs\/1203.0160, 2012."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491894.2466485"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920881"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275492"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391232"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213888"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_2_1_20_1","first-page":"137","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . In OSDI , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI, pages 137--150, 2004."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.50905"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/129888.129894"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139015165","volume-title":"Graph Algorithms","author":"Even S.","year":"2011","unstructured":"S. Even . Graph Algorithms . Cambridge University Press , New York, NY, USA , 2 nd edition, 2011 . S. Even. Graph Algorithms. Cambridge University Press, New York, NY, USA, 2nd edition, 2011.","edition":"2"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350245"},{"key":"e_1_2_1_25_1","first-page":"209","volume-title":"VLDB","author":"Fushimi S.","year":"1986","unstructured":"S. Fushimi , M. Kitsuregawa , and H. Tanaka . An overview of the system software of a parallel relational database machine grace . In VLDB , pages 209 -- 219 , 1986 . S. Fushimi, M. Kitsuregawa, and H. Tanaka. An overview of the system software of a parallel relational database machine grace. In VLDB, pages 209--219, 1986."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1085"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/152610.152611"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402746"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2524211.2524218"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350246"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2523633"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427"},{"key":"e_1_2_1_41_1","unstructured":"Yahoo! Webscope Program. http:\/\/webscope.sandbox.yahoo.com\/.  Yahoo! Webscope Program. http:\/\/webscope.sandbox.yahoo.com\/."},{"key":"e_1_2_1_42_1","volume-title":"CUHK","author":"Yan D.","year":"2013","unstructured":"D. Yan , J. Cheng , K. Xing , W. Ng , and Y. Bu . Practical pregel algorithms for massive graphs. In Technique Report , CUHK , 2013 . D. Yan, J. Cheng, K. Xing, W. Ng, and Y. Bu. Practical pregel algorithms for massive graphs. In Technique Report, CUHK, 2013."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213895"},{"key":"e_1_2_1_44_1","volume-title":"NSDI","author":"Zaharia M.","year":"2012","unstructured":"M. Zaharia , M. Chowdhury , T. Das , A. Dave , J. Ma , M. McCauley , M. J. Franklin , S. Shenker , and I. Stoica . Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computingt . In NSDI , 2012 . M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computingt. In NSDI, 2012."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.074492.107"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038929"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2735471.2735477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:23:28Z","timestamp":1672219408000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2735471.2735477"}},"subtitle":["Big(ger) graph analytics on a dataflow engine"],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["10.14778\/2735471.2735477"],"URL":"https:\/\/doi.org\/10.14778\/2735471.2735477","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}