An experimental comparison of Pregel-like graph processing systems

Proceedings of the VLDB Endowment

Volumn 7, Issue 12, 2014, Pages 1047-1058

  Han, Minyang ^a   Daudjee, Khuzaima ^a   Ammar, Khaled ^a   Tamer Ozsu M ^a   Wang, Xingfang ^a   Jin, Tianqi ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING;

AMAZON EC2; EXPERIMENTAL COMPARISON; GRAPH PROCESSING; MINIMUM SPANNING TREES; SINGLE SOURCE SHORTEST PATHS;

GRAPH ALGORITHMS;

EID: 84905106228     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2732977.2732980     Document Type: Conference Paper

References (38)

1. Apache Giraph. http://giraph.apache.org.
2. Apache Hama. http://hama.apache.org.
3. GraphLab. http://graphlab.org.
4. J. Alpert and N. Hajaj. We knew the web was big... http://googleblog.blogspot.ca/2008/07/ we-knew-web-was-big.html, 2008.
5. K. Andreev and H. Räcke. Balanced graph partitioning. In SPAA '04, pages 120-124, 2004.
6. S. Austin. Facebook Passes the 900 Million Monthly Users Barrier. http: //blogs.wsj.com/digits/2012/04/23/facebook-passes, 2012.
7. P. Boldi, B. Codenotti, M. Santini, and S. Vigna. UbiCrawler: A Scalable Fully Distributed Web Crawler. Software: Practice & Experience, 34(8):711-726, 2004.
8. P. Boldi, M. Rosa, M. Santini, and S. Vigna. Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In WWW '11, pages 587-596, 2011.
9. P. Boldi and S. Vigna. The Webgraph Framework I: Compression Techniques. In WWW '04, pages 595-602, 2004.
10. A. Ching. Scaling Apache Giraph to a trillion edges. http://www.facebook.com/10151617006153920, 2013.
11. S. Chung and A. Condon. Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm. In IPPS '96, pages 302-308, 1996.
12. M. Ciglan, A. Averbuch, and L. Hluchy. Benchmarking Traversal Operations over Graph Databases. In ICDEW 2012, pages 186-189, 2012.
13. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 3rd edition, 2009.
14. E. David and K. Jon. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010.
15. D. Donato, L. Laura, S. Leonardi, and S. Millozzi. Simulating the Webgraph: A Comparative Analysis of Models. Computing in Science and Engineering, 6(6):84-89, 2004.
16. B. Elser and A. Montresor. An evaluation study of BigData frameworks for graph processing. In IEEE Big Data 2013, pages 60-67, 2013.
17. R. G. Gallager, P. A. Humblet, and P. M. Spira. A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Trans. Program. Lang. Syst., 5(1):66-77, 1983.
18. 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.
19. Y. Guo, M. Biczak, A. L. Varbanescu, A. Iosup, C. Martella, and T. L. Willke. How Well do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis. In IPDPS 2014, 2014.
20. U. Kang, C. E. Tsourakakis, and C. Faloutsos. PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations. In ICDM '09, pages 229-238, 2009.
21. Karypis Lab. METIS and ParMETIS. http://glaros.dtc.umn.edu/gkhome/views/metis.
22. Z. Khayyat. Personal correspondence, Apr 2014.
23. Z. Khayyat, K. Awara, A. Alonazi, H. Jamjoom, D. Williams, and P. Kalnis. Mizan: A system for dynamic load balancing in large-scale graph processing. In EuroSys '13, pages 169-182, 2013.
24. J. M. Kleinberg. Authoritative Sources in a Hyperlinked Environment. J. ACM, 46(5):604-632, 1999.
25. A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: Large-scale Graph Computation on Just a PC. In OSDI '12, pages 31-46, 2012.
26. G. Laporte. The Vehicle Routing Problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(3):345-358, 1992.
27. Y. Low. Is Chromatic Engine still supported. http:// groups.google.com/d/topic/graphlab-kdd/2T0CjLodHFc/, 2013.
28. 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, 2012.
29. 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 SIGMOD/PODS '10, pages 135-146, 2010.
30. N. Przulj. Protein-protein interactions: Making sense of networks via graph-theoretic modeling. BioEssays, 33(2):115-123, 2011.
31. S. Salihoglu and J. Widom. GPS: A Graph Processing System. Technical report, Stanford, 2012.
32. S. Salihoglu and J. Widom. GPS: A Graph Processing System. In SSDBM '13, pages 22:1-22:12, 2013.
33. S. Salihoglu and J. Widom. Optimizing Graph Algorithms on Pregel-like Systems. Technical report, Stanford, 2013.
34. Z. Shang and J. X. Yu. Catch the Wind: Graph Workload Balancing on Cloud. In ICDE '13, pages 553-564, 2013.
35. Y. Tian, A. Balmin, S. A. Corsten, S. Tatikonda, and J. McPherson. From "Think Like a Vertex" to "Think Like a Graph". VLDB '13, 7(3):193-204, 2013.
36. Y. Tian, R. A. Hankins, and J. M. Patel. E_cient aggregation for graph summarization. In SIGMOD/PODS '08, pages 567-580, 2008.
37. L. G. Valiant. A Bridging Model for Parallel Computation. Commun. ACM, 33(8):103-111, 1990.
38. 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.