{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T20:55:39Z","timestamp":1762376139386},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,22]],"date-time":"2016-09-22T00:00:00Z","timestamp":1474502400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Deutsche Forschungsgemeinschaft (DFG)","award":["ME 3619\/3-1"],"award-info":[{"award-number":["ME 3619\/3-1"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s13278-016-0394-1","type":"journal-article","created":{"date-parts":[[2016,9,22]],"date-time":"2016-09-22T11:12:51Z","timestamp":1474542771000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An empirical comparison of Big Graph frameworks in the context of network analysis"],"prefix":"10.1007","volume":"6","author":[{"given":"Jannis","family":"Koch","sequence":"first","affiliation":[]},{"given":"Christian L.","family":"Staudt","sequence":"additional","affiliation":[]},{"given":"Maximilian","family":"Vogel","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"394_CR1","unstructured":"Apache (2014) Giraph++ patch for apache giraph. https:\/\/issues.apache.org\/jira\/browse\/GIRAPH-818 . Accessed 31 July 2014"},{"key":"394_CR2","unstructured":"Apache (2015a) Website of the framework Apache Flink. https:\/\/flink.apache.org\/"},{"key":"394_CR3","unstructured":"Apache (2015b) Website of the framework Apache Giraph. http:\/\/giraph.apache.org\/"},{"key":"394_CR4","unstructured":"Apache (2015c) Website of the research project Stratosphere. http:\/\/stratosphere.eu\/"},{"key":"394_CR5","unstructured":"Apache (2016) Website of GraphX. https:\/\/spark.apache.org\/graphx\/"},{"key":"394_CR6","unstructured":"Avery Ching (2013) Scaling apache giraph to a trillion edges. https:\/\/www.facebook.com\/notes\/facebook-engineering\/scaling-apache-giraph-to-a-trillion-edges\/10151617006153920 . Accessed 30 July 2014"},{"key":"394_CR7","doi-asserted-by":"crossref","unstructured":"Battr\u00e9 D, Ewen S, Hueske F, Kao O, Markl V, Warneke D (2010) Nephele\/pacts: a programming model and execution framework for web-scale analytical processing. In: Proceedings of 1st ACM symposium on cloud computing, SoCC \u201910. ACM, New York, pp 119\u2013130","DOI":"10.1145\/1807128.1807148"},{"key":"394_CR8","doi-asserted-by":"crossref","unstructured":"Boldi P, Vigna S (2004) The WebGraph framework I: compression techniques. In: Proceedings of the thirteenth international World Wide Web Conference (WWW 2004). ACM Press, Manhattan, USA, pp 595\u2013601","DOI":"10.1145\/988672.988752"},{"key":"394_CR9","doi-asserted-by":"crossref","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. In: Computer networks and ISDN systems. Elsevier Science Publishers B. V, Amsterdam, pp 107\u2013117","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"394_CR10","doi-asserted-by":"crossref","unstructured":"Cha M, Haddadi H, Benevenuto F, Gummadi KP (2010) Measuring user influence in Twitter: the million follower fallacy. In: Proceedings of the 4th international AAAI conference on Weblogs and Social Media (ICWSM)","DOI":"10.1609\/icwsm.v4i1.14033"},{"issue":"3","key":"394_CR11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1080\/00018732.2011.572452","volume":"60","author":"LdF Costa","year":"2011","unstructured":"Costa LdF, Oliveira ON, Travieso G, Rodrigues FA, Villas Boas PR, Antiqueira L, Viana MP, Correa Rocha LE (2011) Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Adv Phys 60(3):329\u2013412","journal-title":"Adv Phys"},{"issue":"1","key":"394_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"394_CR13","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (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 Association, Berkeley, CA, USA, pp 17\u201330"},{"key":"394_CR14","doi-asserted-by":"crossref","unstructured":"Karloff H, Suri S, Vassilvitskii S (2010) A model of computation for mapreduce. In: Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 938\u2013948","DOI":"10.1137\/1.9781611973075.76"},{"key":"394_CR15","doi-asserted-by":"crossref","unstructured":"Koch J, Staudt CL, Vogel M, Meyerhenke H (2015) Complex network analysis on distributed systems: an empirical comparison. In: Pei J, Silvestri F, Tang J (eds) Proceedings of 2015 IEEE\/ACM international conference on advances in social networks analysis and mining, ASONAM 2015. ACM, pp 1169\u20131176","DOI":"10.1145\/2808797.2808923"},{"key":"394_CR16","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of 22nd international conference on World Wide Web companion. International World Wide Web Conferences Steering Committee, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"key":"394_CR17","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon S (2010) What is Twitter, a social network or a news media? In: WWW \u201910: Proceedings of the 19th international conference on World wide web. ACM, New York, NY, USA, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"key":"394_CR18","doi-asserted-by":"crossref","unstructured":"Lin J, Dyer C (2010) Data-intensive text processing with MapReduce. G-Reference, Information and Interdisciplinary Subjects Series. Morgan & Claypool","DOI":"10.2200\/S00274ED1V01Y201006HLT007"},{"key":"394_CR19","doi-asserted-by":"crossref","unstructured":"Lin J, Schatz M (2010) Design patterns for efficient graph algorithms in mapreduce. In: Proceedings of the eighth workshop on mining and learning with graphs, MLG \u201910. ACM, New York, NY, USA, pp 78\u201385","DOI":"10.1145\/1830252.1830263"},{"key":"394_CR20","doi-asserted-by":"crossref","unstructured":"Low Y, Gonzalez J, Kyrola A, Bickson D, Guestrin C, Hellerstein JM (2012) Distributed GraphLab: a framework for machine learning in the cloud. CoRR, abs\/1204.6078","DOI":"10.14778\/2212351.2212354"},{"key":"394_CR21","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data. ACM, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"394_CR22","doi-asserted-by":"crossref","unstructured":"McColl RC, Ediger D, Poovey J, Campbell D, Bader DA (2014) A performance evaluation of open source graph databases. In: Proceedings of 1st workshop on parallel programming for analytics applications, PPAA \u201914. ACM, New York, NY, USA, pp 11\u201318","DOI":"10.1145\/2567634.2567638"},{"key":"394_CR23","doi-asserted-by":"crossref","unstructured":"Meyerhenke H, Sanders P, Schulz C (2014) Partitioning complex networks via size-constrained clustering. In: Proceedings of 13th international symposium on experimental algorithms (SEA 2014), vol 8504 of LNCS. Springer, Berlin, pp 351\u2013363","DOI":"10.1007\/978-3-319-07959-2_30"},{"key":"394_CR24","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"M Newman","year":"2010","unstructured":"Newman M (2010) Networks: an introduction. Oxford University Press, Oxford"},{"issue":"3","key":"394_CR25","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036106","journal-title":"Phys Rev E"},{"key":"394_CR26","doi-asserted-by":"crossref","unstructured":"Satish N, Sundaram N, Patwary MMA, Seo J, Park J, Hassaan MA, Sengupta S, Yin Z, Dubey P (2014). Navigating the maze of graph analytics frameworks using massive graph datasets. In: Proceedings 2014 ACM SIGMOD international conference on management of data, SIGMOD \u201914. ACM, New York, NY, USA, pp 979\u2013990","DOI":"10.1145\/2588555.2610518"},{"issue":"2","key":"394_CR27","doi-asserted-by":"crossref","first-page":"265","DOI":"10.7155\/jgaa.00108","volume":"9","author":"T Schank","year":"2005","unstructured":"Schank T, Wagner D (2005) Approximating clustering-coefficient and transitivity. J Gr Algorithm Appl 9(2):265\u2013275","journal-title":"J Gr Algorithm Appl"},{"key":"394_CR28","doi-asserted-by":"crossref","unstructured":"Slota GM, Madduri K, Rajamanickam S (2014) Pulp: scalable multi-objective multi-constraint partitioning for small-world networks. In: Lin J, Pei J, Hu X, Chang W, Nambiar R, Aggarwal C, Cercone N, Honavar V, Huan J, Mobasher B, Pyne S (eds) 2014 IEEE international conference on big data, Big Data 2014, pp 481\u2013490","DOI":"10.1109\/BigData.2014.7004265"},{"key":"394_CR29","doi-asserted-by":"crossref","unstructured":"Staudt CL, Sazonovs A, Meyerhenke H (2016) NetworKit: a tool suite for large-scale complex network analysis. Netw Sci, To Appear","DOI":"10.1017\/nws.2016.20"},{"issue":"3","key":"394_CR30","first-page":"193","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian Y, Balmin A, Corsten SA, Tatikonda S, McPherson J (2013) From \u201cthink like a vertex\u201d to \u201cthink like a graph\u201d. PVLDB 7(3):193\u2013204","journal-title":"PVLDB"},{"key":"394_CR31","unstructured":"Turi (2016). Website of the company distributing GraphLab"},{"issue":"8","key":"394_CR32","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103\u2013111","journal-title":"Commun ACM"},{"key":"394_CR33","doi-asserted-by":"crossref","unstructured":"Zhang Y, Gao Q, Gao L, Wang C (2012). Accelerate large-scale iterative computation through asynchronous accumulative updates. In: Proceedings of the 3rd workshop on scientific cloud computing date, ACM, pp 13\u201322","DOI":"10.1145\/2287036.2287041"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0394-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-016-0394-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0394-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T06:27:16Z","timestamp":1692512836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-016-0394-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,22]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["394"],"URL":"https:\/\/doi.org\/10.1007\/s13278-016-0394-1","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,22]]},"article-number":"84"}}