An evaluation study of BigData frameworks for graph processing

Proceedings - 2013 IEEE International Conference on Big Data, Big Data 2013

Volumn , Issue , 2013, Pages 60-67

  Elser, Benedikt ^a   Montresor, Alberto ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE;

CLOUD SERVICES; DE FACTO STANDARD; DECOMPOSITION PROBLEMS; EVALUATION STUDY; GENERAL PUBLICS; GRAPH PROCESSING; SECOND GENERATION; UNIQUE FEATURES;

BIG DATA;

EID: 84893323289     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BigData.2013.6691555     Document Type: Conference Paper

References (27)

1. Amazon Elastic Compute Cloud (Amazon EC2). http://ec2.amazon. com/.
2. J. Alvarez-Hamelin, L. Dall Asta, A. Barrat, and A. Vespignani. Large scale networks fingerprinting and visualization using the k-core decomposition. Advances in neural information processing systems, 18:41, 2006.
3. G. D. Bader and C. W. Hogue. Analyzing yeast protein-protein interaction data obtained from different sources. Nature biotechnology, 20(10):991-997, Oct. 2002.
4. S. Blanas, J. M. Patel, V. Ercegovac, J. Rao, E. J. Shekita, and Y. Tian. A comparison of join algorithms for log processing in mapreduce. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, SIGMOD '10, pages 975-986, New York, NY, USA, 2010. ACM.
5. J. Cohen. Graph twiddling in a mapreduce world. Computing in Science Engineering, 11(4):29-41, July-Aug. 2009.
6. A. S. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In Proceedings of the 16th international conference on World Wide Web, WWW '07, pages 271-280, New York, NY, USA, 2007. ACM.
7. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In Sixth Symposium on Operating System Design and Implementation (OSDI'04), pages 137-150, San Francisco, CA, December 2004.
8. S. Ewen, K. Tzoumas, M. Kaufmann, and V. Markl. Spinning fast iterative data flows. Proc. VLDB Endow., 5(11):1268-1279, July 2012.
9. http://snap.stanford.edu/index.html. Stanford network analysis project.
10. F. Hueske, M. Peters, M. J. Sax, A. Rheinländer, R. Bergmann, A. Krettek, and K. Tzoumas. Opening the black boxes in data flow optimization. Proc. VLDB Endow., 5(11):1256-1267, July 2012.
11. S. Lattanzi, B. Moseley, S. Suri, and S. Vassilvitskii. Filtering: a method for solving graph problems in mapreduce. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, SPAA '11, pages 85-94, New York, NY, USA, 2011. ACM.
12. I. Leonardi. k-core decomposition of large graphs with hadoop. Master's thesis, Università degli Studi di Trento, March 2011.
13. J. Lin and M. Schatz. Design patterns for efficient graph algorithms in mapreduce. In Proceedings of the Eighth Workshop on Mining and Learning with Graphs, MLG '10, pages 78-85, New York, NY, USA, 2010. ACM.
14. Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein. Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow., 5(8):716-727, Apr. 2012.
15. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Graphlab: A new framework for parallel machine learning. 06 2010.
16. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. Berry. Challenges in parallel graph processing. Parallel Processing Letters, 17(01):5-20, 2007.
17. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, SIGMOD '10, pages 135-146, New York, NY, USA, 2010. ACM.
18. L. Masera. Progettazione e valutazione di algoritmi su grafi in graphlab. Master's thesis, Università degli Studi di Trento, January 2013.
19. A. Montresor, F. De Pellegrini, and D. Miorandi. Distributed k-core decomposition. In Proceedings of the 30th annual ACM SIGACTSIGOPS symposium on Principles of distributed computing, PODC '11, pages 207-208, New York, NY, USA, 2011. ACM.
20. L. E. P. Morales. Large scale distributed graph processing: A comparative analysis. Master's thesis, Università degli Studi di Trento, March 2012.
21. M. Schwarzkopf, D. G. Murray, and S. Hand. The seven deadly sins of cloud computing research. In Proceedings of the 4th USENIX conference on Hot Topics in Cloud Ccomputing, HotCloud'12, pages 1-1, Berkeley, CA, USA, 2012. USENIX Association.
22. S. B. Seidman. Network structure and minimum degree. Social Networks, 5(3):269-287, 1983.
23. S. Seo, E. J. Yoon, J. Kim, S. Jin, J.-S. Kim, and S. Maeng. Hama: An efficient matrix computation with the mapreduce framework. In Proceedings of the 2010 IEEE Second International Conference on Cloud Computing Technology and Science, CLOUDCOM '10, pages 721-726, Washington, DC, USA, 2010. IEEE Computer Society.
24. The Apache Software Foundation. Apache Giraph. http://giraph.apache. org/.
25. The Apache Software Foundation. Apache Hadoop. http://hadoop. apache.org/.
26. L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
27. H.-c. Yang, A. Dasdan, R.-L. Hsiao, and D. S. Parker. Map-reducemerge: simplified relational data processing on large clusters. In Proceedings of the 2007 ACM SIGMOD international conference on Management of data, SIGMOD '07, pages 1029-1040, New York, NY, USA, 2007. ACM