{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T02:31:11Z","timestamp":1776133871787,"version":"3.50.1"},"reference-count":256,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:00:00Z","timestamp":1528761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council (ARC) Future Fellowship"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2019,5,31]]},"abstract":"<jats:p>The world is becoming a more conjunct place and the number of data sources such as social networks, online transactions, web search engines, and mobile devices is increasing even more than had been predicted. A large percentage of this growing dataset exists in the form of linked data, more generally, graphs, and of unprecedented sizes. While today's data from social networks contain hundreds of millions of nodes connected by billions of edges, inter-connected data from globally distributed sensors that forms the Internet of Things can cause this to grow exponentially larger. Although analyzing these large graphs is critical for the companies and governments that own them, big data tools designed for text and tuple analysis such as MapReduce cannot process them efficiently. So, graph distributed processing abstractions and systems are developed to design iterative graph algorithms and process large graphs with better performance and scalability. These graph frameworks propose novel methods or extend previous methods for processing graph data. In this article, we propose a taxonomy of graph processing systems and map existing systems to this classification. This captures the diversity in programming and computation models, runtime aspects of partitioning and communication, both for in-memory and distributed frameworks. Our effort helps to highlight key distinctions in architectural approaches, and identifies gaps for future research in scalable graph systems.<\/jats:p>","DOI":"10.1145\/3199523","type":"journal-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T18:12:29Z","timestamp":1528827149000},"page":"1-53","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":62,"title":["Scalable Graph Processing Frameworks"],"prefix":"10.1145","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9392-8144","authenticated-orcid":false,"given":"Safiollah","family":"Heidari","sequence":"first","affiliation":[{"name":"The University of Melbourne, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4140-7774","authenticated-orcid":false,"given":"Yogesh","family":"Simmhan","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Rodrigo N.","family":"Calheiros","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Australia"}]},{"given":"Rajkumar","family":"Buyya","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899055"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the Coud Futures 2012 Workshop. Microsoft.","author":"Afrati F. N.","unstructured":"F. N. Afrati , A. Das Sarma , S. Salihoglu , and J. D. Ullman . 2012. Vision paper: Towards an understanding of the limits of map-reduce computation . In Proceedings of the Coud Futures 2012 Workshop. Microsoft. F. N. Afrati, A. Das Sarma, S. Salihoglu, and J. D. Ullman. 2012. Vision paper: Towards an understanding of the limits of map-reduce computation. In Proceedings of the Coud Futures 2012 Workshop. Microsoft."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2013.108"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0357-y"},{"key":"e_1_2_1_5_1","volume-title":"Retrieved","author":"Franz Inc.","year":"2015","unstructured":"Franz Inc. 2015 . Home Page . Retrieved August 10, 2015, from http:\/\/allegrograph.com. Franz Inc. 2015. Home Page. Retrieved August 10, 2015, from http:\/\/allegrograph.com."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586140"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1322432.1322433"},{"key":"e_1_2_1_9_1","unstructured":"Apache Software Foundation. 2007. Retrieved May 28 2016 from http:\/\/activemq.apache.org.  Apache Software Foundation. 2007. Retrieved May 28 2016 from http:\/\/activemq.apache.org."},{"key":"e_1_2_1_10_1","unstructured":"Apache Software Foundation. 2012. Retrieved May 28 2016 from https:\/\/avro.apache.org.  Apache Software Foundation. 2012. Retrieved May 28 2016 from https:\/\/avro.apache.org."},{"key":"e_1_2_1_11_1","unstructured":"Apache Software Foundation. 2012. Home Page. Retrieved April 9 2018 from http:\/\/giraph.apache.org.  Apache Software Foundation. 2012. Home Page. Retrieved April 9 2018 from http:\/\/giraph.apache.org."},{"key":"e_1_2_1_12_1","volume-title":"Retrieved","author":"Foundation Apache Software","year":"2015","unstructured":"Apache Software Foundation . 2015 . Home Page . Retrieved August 10, 2015, from http:\/\/hbase.apache.org. Apache Software Foundation. 2015. Home Page. Retrieved August 10, 2015, from http:\/\/hbase.apache.org."},{"key":"e_1_2_1_13_1","unstructured":"Apache Software Foundation Contributors. 2011. Home Page. Retrieved April 9 2018 from https:\/\/hive.apache.org.  Apache Software Foundation Contributors. 2011. Home Page. Retrieved April 9 2018 from https:\/\/hive.apache.org."},{"key":"e_1_2_1_14_1","unstructured":"Apache Software Foundation. 2008. Home Page. Retrieved April 9 2018 from https:\/\/pig.apache.org.  Apache Software Foundation. 2008. Home Page. Retrieved April 9 2018 from https:\/\/pig.apache.org."},{"key":"e_1_2_1_15_1","volume-title":"Retrieved","author":"Foundation Apache Software","year":"2008","unstructured":"Apache Software Foundation . 2008 . Home Page . Retrieved May 28, 2016, from https:\/\/thrift.apache.org. Apache Software Foundation. 2008. Home Page. Retrieved May 28, 2016, from https:\/\/thrift.apache.org."},{"key":"e_1_2_1_16_1","volume-title":"Retrieved","author":"Foundation Apache Software","year":"2011","unstructured":"Apache Software Foundation . 2011 . Home Page . Retrieved July 23, 2015, from https:\/\/hadoop.apache.org. Apache Software Foundation. 2011. Home Page. Retrieved July 23, 2015, from https:\/\/hadoop.apache.org."},{"key":"e_1_2_1_17_1","volume-title":"Retrieved","author":"DB","year":"2015","unstructured":"Arango DB GmbH. 2015 . Home Page . Retrieved August 10, 2015, from https:\/\/www.arangodb.com. ArangoDB GmbH. 2015. Home Page. Retrieved August 10, 2015, from https:\/\/www.arangodb.com."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13174-014-0011-3"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536261"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/588"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0857-0"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2790395.2790401"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5821\/hpgm15.3"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389013"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPCI.2012.6486469"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM","author":"Blandford D. K.","unstructured":"D. K. Blandford , G. E. Blelloch , and I. A. Kash . 2003. Compact representations of separable graphs . In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM , Baltimore, Maryland, USA. D. K. Blandford, G. E. Blelloch, and I. A. Kash. 2003. Compact representations of separable graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, Baltimore, Maryland, USA."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)","author":"Blandford D. K.","unstructured":"D. K. Blandford , G. E. Blelloch , and I. A. Kash . 2004. An experimental analysis of a compact graph representation . In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04) . SIAM, New Orleans, Louisiana, USA. D. K. Blandford, G. E. Blelloch, and I. A. Kash. 2004. An experimental analysis of a compact graph representation. In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04). SIAM, New Orleans, Louisiana, USA."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767921"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623660"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-006-9168-x"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735477"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920881"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2008.12.001"},{"key":"e_1_2_1_38_1","volume-title":"Retrieved","author":"Cao L.","year":"2011","unstructured":"L. Cao . 2011 . GoldenOrb . Retrieved July 25, 2015, from https:\/\/github.com\/jzachr\/goldenorb. L. Cao. 2011. GoldenOrb. Retrieved July 25, 2015, from https:\/\/github.com\/jzachr\/goldenorb."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/646010.676990"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298309"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806638"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2014.7040962"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/10973509_9"},{"key":"e_1_2_1_45_1","unstructured":"Q. Chen S. Bai Z. Li Z. Gou B. Suo and W. Pan. 2014. GraphHP: A Hybrid Platform for Iterative Graph Processing. Technical Report. arXIV:1706.07221.  Q. Chen S. Bai Z. Li Z. Gou B. Suo and W. Pan. 2014. GraphHP: A Hybrid Platform for Iterative Graph Processing. Technical Report. arXIV:1706.07221."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807297"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391232"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISKE.2008.4731013"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168846"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.126"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the 2nd USENIX Workshop on Hot Topics inCloud Computing (HotCloud\u201910)","author":"Chohan N.","unstructured":"N. Chohan , C. Castillo , M. Spreitzer , M. Steinder , A. Tantawi , and C. Krintz . 2010. See Spot run: Using spot instances for mapreduce workflows . In Proceedings of the 2nd USENIX Workshop on Hot Topics inCloud Computing (HotCloud\u201910) . USENIX, 1--7. N. Chohan, C. Castillo, M. Spreitzer, M. Steinder, A. Tantawi, and C. Krintz. 2010. See Spot run: Using spot instances for mapreduce workflows. In Proceedings of the 2nd USENIX Workshop on Hot Topics inCloud Computing (HotCloud\u201910). USENIX, 1--7."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"e_1_2_1_53_1","volume-title":"Social Networks Overview: Current Trends and Research Challenges","author":"T. E. Commission","unstructured":"T. E. Commission . 2010. Social Networks Overview: Current Trends and Research Challenges . Information Society and Media, Publications Office of the European Union , Luxembourg. T. E. Commission. 2010. Social Networks Overview: Current Trends and Research Challenges. Information Society and Media, Publications Office of the European Union, Luxembourg."},{"key":"e_1_2_1_54_1","unstructured":"G. Coulouris J. Dollimore T. Kindberg and G. Blair. 2012. Distributed Systems Concepts and Design (5th ed.). Addison-Wesley Boston MA   G. Coulouris J. Dollimore T. Kindberg and G. Blair. 2012. Distributed Systems Concepts and Design (5th ed.). Addison-Wesley Boston MA"},{"key":"e_1_2_1_55_1","volume-title":"Board on Mathematical Sciences and Their Applications, Division on Engineering and Physical Sciences and National Research Council.","author":"Committee on the Analysis of Massive Data","year":"2013","unstructured":"Committee on the Analysis of Massive Data , Committee on Applied and Theoretical Statistics , Board on Mathematical Sciences and Their Applications, Division on Engineering and Physical Sciences and National Research Council. 2013 . Frontiers in Massive Data Analysis. National Academies Press , Washington, DC. Committee on the Analysis of Massive Data, Committee on Applied and Theoretical Statistics, Board on Mathematical Sciences and Their Applications, Division on Engineering and Physical Sciences and National Research Council. 2013. Frontiers in Massive Data Analysis. National Academies Press, Washington, DC."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847263.2847339"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 6th Symposium on Operating Systems Design and Implementation (OSDI\u201904)","author":"Dean J.","unstructured":"J. Dean and S. Ghemawat . 2004. MapReduce: Simplified data processing on large clusters . In Proceedings of the 6th Symposium on Operating Systems Design and Implementation (OSDI\u201904) . ACM, 107--113. J. Dean and S. Ghemawat. 2004. MapReduce: Simplified data processing on large clusters. In Proceedings of the 6th Symposium on Operating Systems Design and Implementation (OSDI\u201904). ACM, 107--113."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899056"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.08.003"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2016.97"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840587"},{"key":"e_1_2_1_63_1","unstructured":"N. Doekemeijer and A. Varbanescu. 2014. A Survey of Parallel Graph Processing Frameworks. Technical Report. Delft University of Technology Delft Netherlands.  N. Doekemeijer and A. Varbanescu. 2014. A Survey of Parallel Graph Processing Frameworks. Technical Report. Delft University of Technology Delft Netherlands."},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the 2nd TPC Technology Conference (TPCTC\u201910)","author":"Dominguez-Sal D.","year":"2010","unstructured":"D. Dominguez-Sal , N. Martinez-Bazan , V. Muntes-Mulero , P. Baleta , and O. Lluis Larriba-Pey . 2010 . A discussion on the design of graph database benchmarks . In Proceedings of the 2nd TPC Technology Conference (TPCTC\u201910) . Springer-Verlag Berlin, 25--40. D. Dominguez-Sal, N. Martinez-Bazan, V. Muntes-Mulero, P. Baleta, and O. Lluis Larriba-Pey. 2010. A discussion on the design of graph database benchmarks. In Proceedings of the 2nd TPC Technology Conference (TPCTC\u201910). Springer-Verlag Berlin, 25--40."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.107"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-013-0884-0"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851476.1851593"},{"key":"e_1_2_1_68_1","volume-title":"Fault-Tolerant Design","author":"Elena D.","unstructured":"D. Elena . 2013. Fault-Tolerant Design . Springer-Verlag , New York, NY . D. Elena. 2013. Fault-Tolerant Design. Springer-Verlag, New York, NY."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568525"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471478385.ch9"},{"key":"e_1_2_1_71_1","volume-title":"Static and Dynamic Graph Partitioning. A Comparative Study of Existing Algorithms","author":"Elsner U.","unstructured":"U. Elsner . 2002. Static and Dynamic Graph Partitioning. A Comparative Study of Existing Algorithms . Logos Verlag, Berlin , Germany . U. Elsner. 2002. Static and Dynamic Graph Partitioning. A Comparative Study of Existing Algorithms. Logos Verlag, Berlin, Germany."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2016.31"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463693"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060674"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1137\/05064299X"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2621934.2621936"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380200605"},{"key":"e_1_2_1_79_1","volume-title":"The Differences Between SSD and HDD Technology Regarding Forensic Investigations","author":"Geier F.","unstructured":"F. Geier . 2015. The Differences Between SSD and HDD Technology Regarding Forensic Investigations . Linnaeus University, Sm\u00e5land , Sweden . F. Geier. 2015. The Differences Between SSD and HDD Technology Regarding Forensic Investigations. Linnaeus University, Sm\u00e5land, Sweden."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.5555\/207505"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.37"},{"key":"e_1_2_1_82_1","doi-asserted-by":"crossref","unstructured":"A. Gharaibeh T. Reza E. Santos-Neto L. Beltrao Costa S. Sallinen and M. Ripeanu. 2013. Efficient large-scale graph processing on hybrid CPU and GPU systems. arXiv:1312.3018.  A. Gharaibeh T. Reza E. Santos-Neto L. Beltrao Costa S. Sallinen and M. Ripeanu. 2013. Efficient large-scale graph processing on hybrid CPU and GPU systems. arXiv:1312.3018.","DOI":"10.1145\/2535753.2535755"},{"key":"e_1_2_1_83_1","unstructured":"Google. 2008. Retrieved May 28 2016 from https:\/\/github.com\/google\/protobuf.  Google. 2008. Retrieved May 28 2016 from https:\/\/github.com\/google\/protobuf."},{"key":"e_1_2_1_84_1","volume-title":"Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201912)","author":"Gonzalez J. E.","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . 2012. PowerGraph: Distributed graph-parallel computation on natural graphs . In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201912) . USENIX, 17--30. J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. 2012. PowerGraph: Distributed graph-parallel computation on natural graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201912). USENIX, 17--30."},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39467-6_17"},{"key":"e_1_2_1_86_1","volume-title":"Retrieved","author":"List Graph","year":"2010","unstructured":"he Graph 500 List . 2010 . Home Page . Retrieved March 25, 2016, from http:\/\/www.graph500.org. he Graph 500 List. 2010. Home Page. Retrieved March 25, 2016, from http:\/\/www.graph500.org."},{"key":"e_1_2_1_87_1","volume-title":"Retrieved","author":"GraphBase Inc.","year":"2015","unstructured":"GraphBase Inc. 2015 . Home Page . Retrieved August 10, 2015, from http:\/\/graphbase.net. GraphBase Inc. 2015. Home Page. Retrieved August 10, 2015, from http:\/\/graphbase.net."},{"key":"e_1_2_1_88_1","volume-title":"Retrieved","author":"Green C.","year":"2013","unstructured":"C. Green . 2013 . An Introduction to Graph Databases . Retrieved July 28, 2015, from http:\/\/www.information-age.com\/technology\/information-management\/123457275\/an-introduction-to-graph-databases. C. Green. 2013. An Introduction to Graph Databases. Retrieved July 28, 2015, from http:\/\/www.information-age.com\/technology\/information-management\/123457275\/an-introduction-to-graph-databases."},{"key":"e_1_2_1_89_1","volume-title":"Proceedings of the Conference on Parallel Object-Oriented Scientific Computing (POOSC\u201905)","author":"Gregor D.","unstructured":"D. Gregor and A. Lumsdaine . 2005. The parallel BGL: A generic library for distributed graph computations . In Proceedings of the Conference on Parallel Object-Oriented Scientific Computing (POOSC\u201905) . Glasgow, UK, 1--18. D. Gregor and A. Lumsdaine. 2005. The parallel BGL: A generic library for distributed graph computations. In Proceedings of the Conference on Parallel Object-Oriented Scientific Computing (POOSC\u201905). Glasgow, UK, 1--18."},{"key":"e_1_2_1_90_1","volume-title":"Retrieved","author":"Rodriguez Marko A.","year":"2009","unstructured":"Marko A. Rodriguez . 2009 . Aurelius . Retrieved August 22, 2016, from http:\/\/s3.thinkaurelius.com\/docs\/titan\/0.5.4\/gremlin.html. Marko A. Rodriguez. 2009. Aurelius. Retrieved August 22, 2016, from http:\/\/s3.thinkaurelius.com\/docs\/titan\/0.5.4\/gremlin.html."},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1109\/MTAGS.2010.5699427"},{"key":"e_1_2_1_92_1","volume-title":"Retrieved","author":"Gunelius S.","year":"2014","unstructured":"S. Gunelius . 2014 , July 12. The Data Explosion in 2014 Minute by Minute\u2014Infographic . Retrieved July 25, 2015, from http:\/\/aci.info\/2014\/07\/12\/the-data-explosion-in-2014-minute-by-minute-infographic. S. Gunelius. 2014, July 12. The Data Explosion in 2014 Minute by Minute\u2014Infographic. Retrieved July 25, 2015, from http:\/\/aci.info\/2014\/07\/12\/the-data-explosion-in-2014-minute-by-minute-infographic."},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2015.20"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488433"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592799"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37658-0_4"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2016.38"},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2008.56"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359141"},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"e_1_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/2524211.2524218"},{"key":"e_1_2_1_104_1","volume-title":"The Laws of the Web: Patterns in the Ecology of Information","author":"Huberman B. A.","unstructured":"B. A. Huberman . 2001. The Laws of the Web: Patterns in the Ecology of Information . MIT Press , Cambridge . B. A. Huberman. 2001. The Laws of the Web: Patterns in the Ecology of Information. MIT Press, Cambridge."},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/72551.72554"},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_2_1_107_1","volume-title":"Retrieved","author":"Jackson J.","year":"2013","unstructured":"J. Jackson . 2013 . Facebook's Graph Search puts Apache Giraph on the map . Retrieved July 25, 2015 from PCWorld: http:\/\/www.pcworld.com\/article\/2046680\/facebooks-graph-search-puts-apache-giraph-on-the-map.html. J. Jackson. 2013. Facebook's Graph Search puts Apache Giraph on the map. Retrieved July 25, 2015 from PCWorld: http:\/\/www.pcworld.com\/article\/2046680\/facebooks-graph-search-puts-apache-giraph-on-the-map.html."},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484429"},{"key":"e_1_2_1_110_1","volume-title":"Proceedings of the 16th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid'16)","author":"Jamadagni N.","unstructured":"N. Jamadagni and Y. Simmhan . 2016. GoDB: From Batch Processing to Distributed Querying over Property Graphs . In Proceedings of the 16th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid'16) . IEEE Cartagena, Colombia, 281--290. N. Jamadagni and Y. Simmhan. 2016. GoDB: From Batch Processing to Distributed Querying over Property Graphs. In Proceedings of the 16th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid'16). IEEE Cartagena, Colombia, 281--290."},{"key":"e_1_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2013.106"},{"key":"e_1_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020580"},{"key":"e_1_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0364-z"},{"key":"e_1_2_1_115_1","volume-title":"Proceedings of the International Conference on Parallel Processing (ICPP\u201995)","author":"Karypis G.","unstructured":"G. Karypis and V. Kumar . 1995. Multilevel graph partitioning schemes . In Proceedings of the International Conference on Parallel Processing (ICPP\u201995) . Raleigh, NC, 1--12. G. Karypis and V. Kumar. 1995. Multilevel graph partitioning schemes. In Proceedings of the International Conference on Parallel Processing (ICPP\u201995). Raleigh, NC, 1--12."},{"key":"e_1_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35314-7_67"},{"key":"e_1_2_1_117_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"e_1_2_1_118_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600227"},{"key":"e_1_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915209"},{"key":"e_1_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.11.004"},{"key":"e_1_2_1_121_1","unstructured":"Kobrix Software. 2015. Retrieved August 10 2015 from http:\/\/www.hypergraphdb.org\/index.  Kobrix Software. 2015. Retrieved August 10 2015 from http:\/\/www.hypergraphdb.org\/index."},{"key":"e_1_2_1_122_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2015.7166627"},{"key":"e_1_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880037.1880041"},{"key":"e_1_2_1_124_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4400-4_4"},{"key":"e_1_2_1_125_1","doi-asserted-by":"publisher","DOI":"10.1145\/2007183.2007185"},{"key":"e_1_2_1_126_1","unstructured":"A. Kyrola and C. Guestrin. 2014. GraphChi-DB: Simple Design for a Scalable Graph Database System\u2014on Just a PC. CoRR abs\/1403.0701.  A. Kyrola and C. Guestrin. 2014. GraphChi-DB: Simple Design for a Scalable Graph Database System\u2014on Just a PC. CoRR abs\/1403.0701."},{"key":"e_1_2_1_127_1","volume-title":"Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12)","author":"Kyrola A.","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . 2012. GraphChi: Large-scale graph computation on just a PC . In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12) . USENIX, Hallywood, CA, USA, 31--46. A. Kyrola, G. Blelloch, and C. Guestrin. 2012. GraphChi: Large-scale graph computation on just a PC. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12). USENIX, Hallywood, CA, USA, 31--46."},{"key":"e_1_2_1_128_1","unstructured":"Avinash Lakshman and Prashant Malik. 2015. Retrieved August 10 2015 from http:\/\/cassandra.apache.org.  Avinash Lakshman and Prashant Malik. 2015. Retrieved August 10 2015 from http:\/\/cassandra.apache.org."},{"key":"e_1_2_1_129_1","doi-asserted-by":"publisher","DOI":"10.1145\/355841.355847"},{"key":"e_1_2_1_131_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094114.2094118"},{"key":"e_1_2_1_132_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807604"},{"key":"e_1_2_1_133_1","volume-title":"Brussels: Science and Technology Options Assessment (STOA).","author":"Leimbach T.","year":"2014","unstructured":"T. Leimbach , D. Hallinan , D. Bachlechner , A. Weber , M. Jaglo , L. Hennen , and G. Hunt . 2014 . Potential and Impacts of Cloud Computing Services and Social Network Websites. European Parliamentary Research Service . Brussels: Science and Technology Options Assessment (STOA). T. Leimbach, D. Hallinan, D. Bachlechner, A. Weber, M. Jaglo, L. Hennen, and G. Hunt. 2014. Potential and Impacts of Cloud Computing Services and Social Network Websites. European Parliamentary Research Service. Brussels: Science and Technology Options Assessment (STOA)."},{"key":"e_1_2_1_134_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810534"},{"key":"e_1_2_1_135_1","volume-title":"Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters.","author":"Leskovec J.","year":"2008","unstructured":"J. Leskovec , K. J. Lang , A. Dasgupta , and M. W. Mahoney . 2008 . Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Pittsburgh, PA . arXiv:0810.1355 (cs.DS). J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. 2008. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Pittsburgh, PA. arXiv:0810.1355 (cs.DS)."},{"key":"e_1_2_1_136_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983687"},{"key":"e_1_2_1_137_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378191.1378213"},{"key":"e_1_2_1_138_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055959.1055970"},{"key":"e_1_2_1_139_1","volume-title":"Single server systems can tackle big data. Retrieved","author":"Lorica B.","year":"2015","unstructured":"B. Lorica . 2013. Single server systems can tackle big data. Retrieved July 25, 2015 from O'Reilly Radar : http:\/\/radar.oreilly.com\/2013\/04\/single-server-systems-can-tackle-big-data.html. B. Lorica. 2013. Single server systems can tackle big data. Retrieved July 25, 2015 from O'Reilly Radar: http:\/\/radar.oreilly.com\/2013\/04\/single-server-systems-can-tackle-big-data.html."},{"key":"e_1_2_1_140_1","volume-title":"Big Data Now (29--30).","author":"Lorica B.","unstructured":"B. Lorica . 2014. One year later: Some single server systems that can tackle big data . In Big Data Now (29--30). Sebastopol, CA : O'Reilly Media Inc . B. Lorica. 2014. One year later: Some single server systems that can tackle big data. In Big Data Now (29--30). Sebastopol, CA: O'Reilly Media Inc."},{"key":"e_1_2_1_141_1","volume-title":"Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI\u201910)","author":"Low Y.","unstructured":"Y. Low , J. Gonzalez , A. Kyrola , D. Bickson , C. Guestrin , and J. Hellerstein . 2010. GraphLab: A new framework for parallel machine learning . In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI\u201910) . AUAI, Catalina Island, 340--349. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. Hellerstein. 2010. GraphLab: A new framework for parallel machine learning. In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI\u201910). AUAI, Catalina Island, 340--349."},{"key":"e_1_2_1_142_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_2_1_143_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735517"},{"key":"e_1_2_1_144_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_2_1_145_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021743"},{"key":"e_1_2_1_146_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064191"},{"key":"e_1_2_1_147_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161100"},{"key":"e_1_2_1_148_1","volume-title":"Retrieved","author":"Maier D.","year":"2015","unstructured":"D. Maier , A. Fiedler , E. Weigelt , and C. Maier . 2015 . Retrieved August 10, 2015 from https:\/\/sites.google.com\/site\/jcoredb. D. Maier, A. Fiedler, E. Weigelt, and C. Maier. 2015. Retrieved August 10, 2015 from https:\/\/sites.google.com\/site\/jcoredb."},{"key":"e_1_2_1_149_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926287"},{"key":"e_1_2_1_150_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_151_1","doi-asserted-by":"publisher","DOI":"10.5555\/1985522.1985540"},{"key":"e_1_2_1_152_1","volume-title":"Proceedings of the IEEE 33rd International Conference on Data Engineering (ICDE\u201917)","author":"Martella C.","unstructured":"C. Martella , D. Logothetis , A. Loukas , and G. Siganos . 2015. Spinner: Scalable graph partitioning in the cloud . In Proceedings of the IEEE 33rd International Conference on Data Engineering (ICDE\u201917) . IEEE, 1083--1094. C. Martella, D. Logothetis, A. Loukas, and G. Siganos. 2015. Spinner: Scalable graph partitioning in the cloud. In Proceedings of the IEEE 33rd International Conference on Data Engineering (ICDE\u201917). IEEE, 1083--1094."},{"key":"e_1_2_1_153_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_2_1_154_1","volume-title":"The Impact of Fast Networks on Graph Analytics. Retrieved","author":"McSherry F.","year":"2015","unstructured":"F. McSherry and M. Schwarzkopf . 2015 . The Impact of Fast Networks on Graph Analytics. Retrieved August 28, 2015 , from http:\/\/www.frankmcsherry.org\/pagerank\/distributed\/performance\/2015\/07\/08\/pagerank.html#fn0. F. McSherry and M. Schwarzkopf. 2015. The Impact of Fast Networks on Graph Analytics. Retrieved August 28, 2015, from http:\/\/www.frankmcsherry.org\/pagerank\/distributed\/performance\/2015\/07\/08\/pagerank.html#fn0."},{"key":"e_1_2_1_155_1","doi-asserted-by":"publisher","DOI":"10.1145\/204865.204889"},{"key":"e_1_2_1_156_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2442980"},{"key":"e_1_2_1_157_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1039"},{"key":"e_1_2_1_158_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_2_1_159_1","doi-asserted-by":"publisher","DOI":"10.14257\/ijmue.2014.9.2.20"},{"key":"e_1_2_1_160_1","volume-title":"BPP: Large graph storage for efficient disk based. arXiv:1401.2327.","author":"Najeebullah K.","year":"2014","unstructured":"K. Najeebullah , K. Khan , M. Waqas Nawaz , and Y.-K. Lee . 2014 b. BPP: Large graph storage for efficient disk based. arXiv:1401.2327. K. Najeebullah, K. Khan, M. Waqas Nawaz, and Y.-K. Lee. 2014b. BPP: Large graph storage for efficient disk based. arXiv:1401.2327."},{"key":"e_1_2_1_161_1","volume-title":"Retrieved","author":"Technology Neo","year":"2015","unstructured":"Neo Technology . 2015 . Home Page . Retrieved August 10, 2015, from http:\/\/neo4j.com. Neo Technology. 2015. Home Page. Retrieved August 10, 2015, from http:\/\/neo4j.com."},{"key":"e_1_2_1_162_1","unstructured":"NetMesh Inc. 2015. Retrieved August 10 2015 from http:\/\/infogrid.org\/trac.  NetMesh Inc. 2015. Retrieved August 10 2015 from http:\/\/infogrid.org\/trac."},{"key":"e_1_2_1_163_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_2_1_164_1","volume-title":"Hermes: Dynamic Partitioning for Distributed Social Network Graph Databases","author":"Nicoara D.","year":"2015","unstructured":"D. Nicoara , S. Kamali , K. Daudjee , and L. Chen . 2015 . Hermes: Dynamic Partitioning for Distributed Social Network Graph Databases . University of Waterloo , Waterloo, Canada . D. Nicoara, S. Kamali, K. Daudjee, and L. Chen. 2015. Hermes: Dynamic Partitioning for Distributed Social Network Graph Databases. University of Waterloo, Waterloo, Canada."},{"key":"e_1_2_1_165_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611354.2611365"},{"key":"e_1_2_1_166_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.84877"},{"key":"e_1_2_1_167_1","doi-asserted-by":"publisher","DOI":"10.5555\/2650280.2650336"},{"key":"e_1_2_1_168_1","unstructured":"Objectivity Inc. 2015. Retrieved August 10 2015 from http:\/\/www.objectivity.com\/products\/infinitegraph.  Objectivity Inc. 2015. Retrieved August 10 2015 from http:\/\/www.objectivity.com\/products\/infinitegraph."},{"key":"e_1_2_1_169_1","unstructured":"Joshua O'Madadhain Danyel Fisher Tom Nelson Scott White and Yan-Biao Boey. 2003. Retrieved June 25 2016 from http:\/\/jung.sourceforge.net.  Joshua O'Madadhain Danyel Fisher Tom Nelson Scott White and Yan-Biao Boey. 2003. Retrieved June 25 2016 from http:\/\/jung.sourceforge.net."},{"key":"e_1_2_1_170_1","volume-title":"Retrieved","author":"DB","year":"2015","unstructured":"Orient DB LTD. 2015 . OrientDB vs Neo4j . Retrieved August 10, 2015, from http:\/\/orientdb.com\/orientdb-vs-neo4j. OrientDB LTD. 2015. OrientDB vs Neo4j. Retrieved August 10, 2015, from http:\/\/orientdb.com\/orientdb-vs-neo4j."},{"key":"e_1_2_1_171_1","doi-asserted-by":"publisher","DOI":"10.1145\/1713254.1713276"},{"key":"e_1_2_1_172_1","volume-title":"Proceedings of the 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201915)","author":"Ousterhout K.","year":"2015","unstructured":"K. Ousterhout , R. Rasti , S. Ratnasamy , S. Shenker , and B.-G. Chun . 2015 . Making sense of performance in data analytics frameworks . In Proceedings of the 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201915) . USENIX, 293--307. K. Ousterhout, R. Rasti, S. Ratnasamy, S. Shenker, and B.-G. Chun. 2015. Making sense of performance in data analytics frameworks. In Proceedings of the 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201915). USENIX, 293--307."},{"key":"e_1_2_1_173_1","unstructured":"L. Page S. Brin R. Motwani and T. Winograd. 1998. The PageRank Citation Ranking: Bringing Order to the Web. Stanford InfoLab.  L. Page S. Brin R. Motwani and T. Winograd. 1998. The PageRank Citation Ranking: Bringing Order to the Web. Stanford InfoLab."},{"key":"e_1_2_1_174_1","unstructured":"P. Patel A. Ranabahu and A. Sheth. 2009. Service Level Agreement in Cloud Computing. Kno.e.sis Centre Wright State University Fairborn Ohio USA.  P. Patel A. Ranabahu and A. Sheth. 2009. Service Level Agreement in Cloud Computing. Kno.e.sis Centre Wright State University Fairborn Ohio USA."},{"key":"e_1_2_1_175_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513228.2513287"},{"key":"e_1_2_1_176_1","doi-asserted-by":"crossref","unstructured":"F. Pellegrini. 2011. Current challenges in parallel graph partitioning. Comptes Rendus M\u00e9c. 339 (2--3) 90--95.  F. Pellegrini. 2011. Current challenges in parallel graph partitioning. Comptes Rendus M\u00e9c. 339 (2--3) 90--95.","DOI":"10.1016\/j.crme.2010.11.004"},{"key":"e_1_2_1_177_1","volume-title":"Challenge Involves More Than Just Managing Volumes of Data. Retrieved","author":"Pettey C.","year":"2011","unstructured":"C. Pettey . 2011 . Gartner Says Solving \u2018Big Data \u2019 Challenge Involves More Than Just Managing Volumes of Data. Retrieved July 21, 2015, from http:\/\/www.gartner.com\/newsroom\/id\/1731916. C. Pettey. 2011. Gartner Says Solving \u2018Big Data\u2019 Challenge Involves More Than Just Managing Volumes of Data. Retrieved July 21, 2015, from http:\/\/www.gartner.com\/newsroom\/id\/1731916."},{"key":"e_1_2_1_178_1","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/962135"},{"key":"e_1_2_1_179_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"e_1_2_1_180_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2011.02.004"},{"key":"e_1_2_1_181_1","volume-title":"Proceedings of the 9th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201910)","author":"Power R.","unstructured":"R. Power and J. Li . 2010. Piccolo: Building fast, distributed programs with partitioned tables . In Proceedings of the 9th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201910) . USENIX, 293--306. R. Power and J. Li. 2010. Piccolo: Building fast, distributed programs with partitioned tables. In Proceedings of the 9th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201910). USENIX, 293--306."},{"key":"e_1_2_1_182_1","volume-title":"JPregel. Retrieved","author":"Prakasam K.","year":"2015","unstructured":"K. Prakasam and M. Chandrasekhar . 2010 . JPregel. Retrieved July 24, 2015 , from http:\/\/kowshik.github.io\/JPregel. K. Prakasam and M. Chandrasekhar. 2010. JPregel. Retrieved July 24, 2015, from http:\/\/kowshik.github.io\/JPregel."},{"key":"e_1_2_1_183_1","volume-title":"Proceedings of the 2016 IEEE International Conference on Cloud Engineering (IC2E\u201916)","author":"Pundir M.","unstructured":"M. Pundir , M. Kumar , L. M. Leslie , I. Gupta , and R. H. Campbell . 2016. Supporting on-demand elasticity in distributed . In Proceedings of the 2016 IEEE International Conference on Cloud Engineering (IC2E\u201916) . IEEE, 12--21. M. Pundir, M. Kumar, L. M. Leslie, I. Gupta, and R. H. Campbell. 2016. Supporting on-demand elasticity in distributed. In Proceedings of the 2016 IEEE International Conference on Cloud Engineering (IC2E\u201916). IEEE, 12--21."},{"key":"e_1_2_1_184_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43352-2_15"},{"key":"e_1_2_1_185_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.76"},{"key":"e_1_2_1_186_1","unstructured":"I. Robinson J. Webber and E. Eifrem. 2015. Graph Databases. O'Reilly Sebastopol CA.   I. Robinson J. Webber and E. Eifrem. 2015. Graph Databases. O'Reilly Sebastopol CA."},{"key":"e_1_2_1_187_1","doi-asserted-by":"publisher","DOI":"10.1145\/2169090.2169092"},{"key":"e_1_2_1_188_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_2_1_189_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_2_1_190_1","doi-asserted-by":"publisher","DOI":"10.1109\/INDICON.2014.7030513"},{"key":"e_1_2_1_191_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_2_1_192_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732294"},{"key":"e_1_2_1_193_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2735353"},{"key":"e_1_2_1_194_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556573"},{"key":"e_1_2_1_195_1","unstructured":"K. Schloegel G. Karypis and V. Kumar. 2001. Graph partitioning for high performance scientific simulations. In CRPC Parallel Computing Handbook. Morgan Kaufmann San Francisco CA 491--541.   K. Schloegel G. Karypis and V. Kumar. 2001. Graph partitioning for high performance scientific simulations. In CRPC Parallel Computing Handbook. Morgan Kaufmann San Francisco CA 491--541."},{"key":"e_1_2_1_196_1","unstructured":"R. Sedgewick and K. Wayne. 2011. Algorithms (4th ed.). Addison-Wesley Professional Upper Saddle River NJ.   R. Sedgewick and K. Wayne. 2011. Algorithms (4th ed.). Addison-Wesley Professional Upper Saddle River NJ."},{"key":"e_1_2_1_197_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43659-3_24"},{"key":"e_1_2_1_198_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_2_1_199_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505617"},{"key":"e_1_2_1_200_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007267"},{"key":"e_1_2_1_201_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_2_1_202_1","unstructured":"J. Siek L.-Q. Lee and A. Lumsdaine. 2002. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Upper Saddle River NJ.   J. Siek L.-Q. Lee and A. Lumsdaine. 2002. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Upper Saddle River NJ."},{"key":"e_1_2_1_203_1","volume-title":"Floe: A Dynamic, Continuous Dataflow Framework for Elastic Clouds. Technical Report","author":"Simmhan Y.","year":"2013","unstructured":"Y. Simmhan and A. Kumbhare . 2013 . Floe: A Dynamic, Continuous Dataflow Framework for Elastic Clouds. Technical Report . University of Southern California , Los Angeles, CA . Y. Simmhan and A. Kumbhare. 2013. Floe: A Dynamic, Continuous Dataflow Framework for Elastic Clouds. Technical Report. University of Southern California, Los Angeles, CA."},{"key":"e_1_2_1_204_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.66"},{"key":"e_1_2_1_205_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09873-9_38"},{"key":"e_1_2_1_206_1","unstructured":"Y. Simmhan C. Wickramaarachchi A. Kumbhare M. Frincu S. Nagarkar S. Ravi and V. Prasanna. 2014. Scalable analytics over distributed time-series graphs using GoFFish. arXiv:1406.5975.  Y. Simmhan C. Wickramaarachchi A. Kumbhare M. Frincu S. Nagarkar S. Ravi and V. Prasanna. 2014. Scalable analytics over distributed time-series graphs using GoFFish. arXiv:1406.5975."},{"key":"e_1_2_1_207_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_2_1_208_1","volume-title":"2015 Social Media Marketing Industry Report. Social Media Examiner","author":"Stelzner M. A.","unstructured":"M. A. Stelzner . 2015. 2015 Social Media Marketing Industry Report. Social Media Examiner , Poway, CA . M. A. Stelzner. 2015. 2015 Social Media Marketing Industry Report. Social Media Examiner, Poway, CA."},{"key":"e_1_2_1_209_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2011.06.012"},{"key":"e_1_2_1_210_1","volume-title":"Proceedings of the 9th International Semantic Web Conference (ISWC\u201910)","author":"Stutz P.","unstructured":"P. Stutz , A. Bernstein , and W. Cohen . 2010. Signal\/Collect: Graph algorithms for the (Semantic) web . In Proceedings of the 9th International Semantic Web Conference (ISWC\u201910) . Springer-Verlag Berlin, 764--780. P. Stutz, A. Bernstein, and W. Cohen. 2010. Signal\/Collect: Graph algorithms for the (Semantic) web. In Proceedings of the 9th International Semantic Web Conference (ISWC\u201910). Springer-Verlag Berlin, 764--780."},{"key":"e_1_2_1_211_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_2_1_212_1","volume-title":"Nguyen Binh Doung, and X. Xiao","author":"Sun P.","year":"2017","unstructured":"P. Sun , Y. Wen , T. Nguyen Binh Doung, and X. Xiao . 2017 . GraphMP : An efficient semi-external-memory big system on a single machine. arXiv:1707.02557. P. Sun, Y. Wen, T. Nguyen Binh Doung, and X. Xiao. 2017. GraphMP: An efficient semi-external-memory big system on a single machine. arXiv:1707.02557."},{"key":"e_1_2_1_213_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_2_1_214_1","volume-title":"Retrieved","author":"SYSTAP","year":"2015","unstructured":"SYSTAP , LLC. 2015 . Home Page . Retrieved August 10, 2015, from http:\/\/mapgraph.io. SYSTAP, LLC. 2015. Home Page. Retrieved August 10, 2015, from http:\/\/mapgraph.io."},{"key":"e_1_2_1_215_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2011.74"},{"key":"e_1_2_1_216_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40047-6_47"},{"key":"e_1_2_1_217_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2487984"},{"key":"e_1_2_1_218_1","volume-title":"Proceedings of the 35th Annual Simulation Symposium. IEEE, 337--345","author":"Tian J.","unstructured":"J. Tian , J. Hahner , C. Becker , I. Stepanov , and K. Rothermel . 2002. Graph-based mobility model for mobile ad hoc network simulation . In Proceedings of the 35th Annual Simulation Symposium. IEEE, 337--345 . J. Tian, J. Hahner, C. Becker, I. Stepanov, and K. Rothermel. 2002. Graph-based mobility model for mobile ad hoc network simulation. In Proceedings of the 35th Annual Simulation Symposium. IEEE, 337--345."},{"key":"e_1_2_1_219_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_2_1_220_1","unstructured":"M. Treaster. 2005. A survey of fault-tolerance and fault-recovery techniques in parallel systems. arXiv:cs\/0501002.  M. Treaster. 2005. A survey of fault-tolerance and fault-recovery techniques in parallel systems. arXiv:cs\/0501002."},{"key":"e_1_2_1_221_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_2_1_222_1","volume-title":"Twitter\/FlockDB. Retrieved","author":"Kallen N.","year":"2015","unstructured":"N. Kallen , R. Pointer , J. Kalucki and Ed Ceaser. 2012 . Twitter\/FlockDB. Retrieved July 28, 2015 , from https:\/\/github.com\/twitter\/flockdb#readme. N. Kallen, R. Pointer, J. Kalucki and Ed Ceaser. 2012. Twitter\/FlockDB. Retrieved July 28, 2015, from https:\/\/github.com\/twitter\/flockdb#readme."},{"key":"e_1_2_1_223_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_224_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2525943"},{"key":"e_1_2_1_225_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465371"},{"key":"e_1_2_1_226_1","doi-asserted-by":"publisher","DOI":"10.1145\/1900008.1900067"},{"key":"e_1_2_1_227_1","volume-title":"Proceedings of the 6th Biennial Conference on Innovative Data Systems Research (CIDR\u201913)","author":"Wang G.","unstructured":"G. Wang , W. Xie , A. Demers , and J. Gehrke . 2013. Asynchronous largescale graph processing made easy . In Proceedings of the 6th Biennial Conference on Innovative Data Systems Research (CIDR\u201913) . 1--12. G. Wang, W. Xie, A. Demers, and J. Gehrke. 2013. Asynchronous largescale graph processing made easy. In Proceedings of the 6th Biennial Conference on Innovative Data Systems Research (CIDR\u201913). 1--12."},{"key":"e_1_2_1_228_1","volume-title":"Proceedings of the 2015 USENIX Annual Technical Conference (ATC\u201915)","author":"Wang K.","unstructured":"K. Wang and G. Xu . 2015. GraphQ: Graph query processing with abstraction refinement\u2014scalable and programmable analytics over very large graphs on a single PC . In Proceedings of the 2015 USENIX Annual Technical Conference (ATC\u201915) . USENIX, 387--401. K. Wang and G. Xu. 2015. GraphQ: Graph query processing with abstraction refinement\u2014scalable and programmable analytics over very large graphs on a single PC. In Proceedings of the 2015 USENIX Annual Technical Conference (ATC\u201915). USENIX, 387--401."},{"key":"e_1_2_1_229_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.58"},{"key":"e_1_2_1_230_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"e_1_2_1_231_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_14"},{"key":"e_1_2_1_232_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688508"},{"key":"e_1_2_1_233_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427"},{"key":"e_1_2_1_234_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078447.3078456"},{"key":"e_1_2_1_235_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733097"},{"key":"e_1_2_1_236_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600222"},{"key":"e_1_2_1_237_1","doi-asserted-by":"publisher","DOI":"10.1145\/2790755.2790795"},{"key":"e_1_2_1_238_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_2_1_239_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904488"},{"key":"e_1_2_1_240_1","volume-title":"GRE: A graph runtime engine for large-scale distributed graph-parallel applications. arXiv:1310.5603.","author":"Yan J.","year":"2013","unstructured":"J. Yan , G. Tan , and N. Sun . 2013 . GRE: A graph runtime engine for large-scale distributed graph-parallel applications. arXiv:1310.5603. J. Yan, G. Tan, and N. Sun. 2013. GRE: A graph runtime engine for large-scale distributed graph-parallel applications. arXiv:1310.5603."},{"key":"e_1_2_1_241_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213895"},{"key":"e_1_2_1_242_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611354.2611365"},{"key":"e_1_2_1_243_1","volume-title":"Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201908)","author":"Yu Y.","unstructured":"Y. Yu , M. Isard , D. Fetterly , M. Budiu , \u00da. Erlingsson, P. Kumar Gunda , and J. Currey . 2008. DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language . In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201908) . USENIX, 1--14. Y. Yu, M. Isard, D. Fetterly, M. Budiu, \u00da. Erlingsson, P. Kumar Gunda, and J. Currey. 2008. DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201908). USENIX, 1--14."},{"key":"e_1_2_1_244_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.38"},{"key":"e_1_2_1_245_1","volume-title":"Retrieved","author":"Zaharia Matei","year":"2012","unstructured":"Matei Zaharia . 2012 . Home Page . Retrieved March 23, 2016, from http:\/\/spark.apache.org. Matei Zaharia. 2012. Home Page. Retrieved March 23, 2016, from http:\/\/spark.apache.org."},{"key":"e_1_2_1_246_1","volume-title":"Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation (NSDI\u201912)","author":"Zaharia M.","unstructured":"M. Zaharia , M. Chowdhury , T. Das , A. Dave , J. Ma , M. McCauley , and I. Stoica . 2012. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing . In Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation (NSDI\u201912) . USENIX, 1--14. M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, and I. Stoica. 2012. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation (NSDI\u201912). USENIX, 1--14."},{"key":"e_1_2_1_247_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2008.11.009"},{"key":"e_1_2_1_248_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-015-1378-z"},{"key":"e_1_2_1_249_1","doi-asserted-by":"publisher","DOI":"10.1145\/2287036.2287041"},{"key":"e_1_2_1_250_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.272"},{"key":"e_1_2_1_251_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.235"},{"key":"e_1_2_1_252_1","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST\u201915)","author":"Zheng D.","unstructured":"D. Zheng , D. Mhembere , R. Burns , J. Vogelstein , C. E. Priebe , and A. S. Szalay . 2015. Flashgraph: Processing billion-node graphs on an array of commodity SSDs . In Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST\u201915) . USENIX, 45--58. D. Zheng, D. Mhembere, R. Burns, J. Vogelstein, C. E. Priebe, and A. S. Szalay. 2015. Flashgraph: Processing billion-node graphs on an array of commodity SSDs. In Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST\u201915). USENIX, 45--58."},{"key":"e_1_2_1_253_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.111"},{"key":"e_1_2_1_254_1","doi-asserted-by":"publisher","DOI":"10.1109\/CloudCom.2013.8"},{"key":"e_1_2_1_255_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0280-z"},{"key":"e_1_2_1_256_1","volume-title":"Proceedings of the 2015 USENIX Annual Technical Conference (ATC\u201915)","author":"Zhu X.","unstructured":"X. Zhu , W. Han , and W. Chen . 2015. GridGraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning . In Proceedings of the 2015 USENIX Annual Technical Conference (ATC\u201915) . USENIX, 375--386. X. Zhu, W. Han, and W. Chen. 2015. GridGraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In Proceedings of the 2015 USENIX Annual Technical Conference (ATC\u201915). USENIX, 375--386."},{"key":"e_1_2_1_257_1","volume-title":"Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201916)","author":"Zhu X.","unstructured":"X. Zhu , W. Chen , W. Zheng , and X. Ma . 2016. Gemini: A computation-centric distributed graph processing system . In Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201916) . USENIX, 301--316. X. Zhu, W. Chen, W. Zheng, and X. Ma. 2016. Gemini: A computation-centric distributed graph processing system. In Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201916). USENIX, 301--316."}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3199523","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3199523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:17Z","timestamp":1750273637000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3199523"}},"subtitle":["A Taxonomy and Open Challenges"],"short-title":[],"issued":{"date-parts":[[2018,6,12]]},"references-count":256,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,5,31]]}},"alternative-id":["10.1145\/3199523"],"URL":"https:\/\/doi.org\/10.1145\/3199523","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,12]]},"assertion":[{"value":"2017-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}