Using pregel-like large scale graph processing frameworks for social network analysis

Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012

Volumn , Issue , 2012, Pages 457-463

  Quick, Louise ^a   Wilkinson, Paul ^a   Hardcastle, David ^a  

^a Government Communications Headquarters   (United Kingdom)

Author keywords

Distributed algorithms; Distributed computing; Graph theory; Parallel algorithms

Indexed keywords

ALGORITHMIC DESIGN; CLUSTERING COEFFICIENT; DIAMETER ESTIMATION; GRAPH ANALYTICS; GRAPH PROCESSING; KEY FEATURE; SOCIAL NETWORK ANALYSIS; UNDIRECTED GRAPH;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; PARALLEL ALGORITHMS;

SOCIAL NETWORKING (ONLINE);

EID: 84874249099     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASONAM.2012.254     Document Type: Conference Paper

References (28)

1. Michael Busch, Krishna Gade, Brian Larson, Patrick Lok, Samuel Luckenbill, and Jimmy Lin, Earlybird: Real-Time Search at Twitter in Proc. 28th Intl. Conf. on Data Engineering (ICDE 2012), Washington, DC, April 2012.
2. Johan Ugander, Brian Karrer, Lars Backstrom, and Cameron Marlow, The Anatomy of the Facebook Social Graph. http://arxiv.org/abs/111.4503, 2011.
3. Grzegorz Malewicz, Matthew H. Austern, Aart J.C. Bik, James Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski, Pregel: A System for Large-Scale Graph Processing. in Proc. ACM SIGMOD Intl. Conf. Management of Data 2010, Indianapolis, IN, June 2010, 135-146.
4. Jeffrey Dean and Sanjay Ghemawat, MapReduce: Simplified Data Processing on Large Clusters. in Proc. 6th Symp. Operating Systems Design and Implementation (OSDI 2004), San Fransisco, CA, Dec. 2004, 137-150.
5. Andrzej Bialecki, Michael Cafarella, Doug Cutting, and Owen O'Malley. Hadoop: A Framework for Running Applications on Large Clusters Built of Commodity Hardware. http://lucene.apache.org/hadoop/2005.
6. Jonathan D. Cohen, Graph Twiddling in a MapReduce World. Computing in Science and Engineering, July/August 2009, 29-41.
7. Jimmy Lin and Chris Dyer. Data-Intensive Text Processing with MapReduce. Morgan & Claypool, 2010.
8. Jimmy Lin and Michael Schatz, Design Patterns for Efficient Graph Algorithms in MapReduce. in Proc. 8th Workshop on Mining and Learning with Graphs (MLG 2010), Washington, DC, Aug 2010.
9. U Kang, Charalampos E. Tsourakakis, and Christos Faloutsos, PEGASUS: A Peta-Scale Graph Mining System. in Proc. IEEE Intl. Conf. Data Mining (ICDM 2009), Miami, FL, Dec. 2009, 229-238.
10. U Kang, Charalampos E. Tsourakakis, and Christos Faloutsos, PEGASUS: Mining Peta-Scale Graphs. Knowledge and Information Systems. 27(2), May 2011, 303-325.
11. Yingyi Bu, Bill Hawe, Magdalena Balazinska, and Michael Ernst, HaLoop: Efficient Iterative Data Processing on Large Clusters. in Proc. 36th Intl. Conf. Very Large Data Bases (VLDB 2010), Singapore, 2010, 285-296.
12. Marc Najork, Dennis fetterly, Alan Halverson, Krishnaram Kenthapadi, and Sreenivas Gollapudi, Of Hammers and Nails: An Empirical Comparison of Three Paradigms for Processing Large Graphs. in Proc. 5th Intl. Conf. on Web Search and Data Mining (WSDM 2012), Seattle, February 2012.
13. Douglas Gregor and Andrew Lumsdaine, The Parallel BGL: A Generic Library for Distributed Graph Computations. in Proc. Parallel Object- Oriented Scientific Computing (POOSC), July 2005.
14. Albert Chan and Frank Dehne, CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines. Intl. J. of High Performance Computing Applications. 19(1), 2005, 81-97.
15. Ryan Lichtenwalter and Nitest V. Chawla, DisNet: A Framework for Distributed Graph computation in Proc. ACM/IEEE Conference on Advances in Social Network Analysis and Mining (ASONAM 2011), Kaohsiung, Taiwan, 2011.
16. Elzbieta Krepska, Thilo Kielmann, Wan Fokkink, and Henri Bal, High- Level Framework for Distributed Processing of Large-Scale Graphs. in Proc. 12th Intl. Conf. on Distributed Computing and Networking (ICDCN 2011), Bangalore, India, Jan 2011, 155-166.
17. Giraph. https://github.com/aching/Giraph.
18. Golden-Orb. http://www.raveldata.com/goldenorb.
19. Bagel. https://github.com/mesos/spark/pull/48.
20. Lars Backstrom, Paolo Bolidi, Marco Rosa, Johan Ugander, and Sebastiano Vigna, Four Degrees of Separation. http://arxiv.org/abs/111.4570, 2011.
21. Ashisi Thusoo, Joydeep Sen Sarma, Namit Jain, Zheng Shao, Prasad Chakka, Ning Zhang, Suresh Antay, Hao Lin, and Ragthotham Marthy, Hive - a Petabyte Scale Data Warehouse using Hadoop. in Proc. 26th Intl. Conf. on Data Engineering (ICDE 2010), Long Beach, CA, March 2010.
22. Paolo Boldi, Marco Rosa, and Sebastiano Vigna HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget. in Proc. 20th Intl. Conf. on World Wide Web (WWW 2011), Hyderbad, India, March, 2011.
23. Jure Leskovec and Eric Horvitz, Planetary-Scale Views on a Large Instant-Messaging Network. in Proc. 17th Intl. Conf. on World Wide Web (WWW 2008), Beijing, China, April 2008.
24. Haewoon Kwak, Changhyun Lee, Hosung Pak, and Sue Moon, What is Twitter, a Social Network or a News Media?. in Proc. 19th Intl. Conf. on World Wide Web (WWW 2010), Raleigh, NC, April 2010.
25. Leslie G. Valiant, A bridging Model for Parallel Computation. Comm. ACM 33(8), 1990, 103-11.
26. Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, and Andrea Marino, Finding the Diameter in Real-World Graphs: Experimentally Turning a Lower Bound into an Upper Bound. Lecture Notes in Computer Science. Part 1, v.6346, 2010, 302-313.
27. Siddharth Suri and Sergei Vassilvitskii, Counting Triangles and the Curse of the Last Reducer. in Proc. 20th Intl. Conf. World Wide Web (WWW 2011), Hyderabad, India, March 2011, 607-614.
28. Jonathan D. Cohen. Trusses: Cohesive Subgraphs for Social Network Analysis. https://www.computer.org/cms/Computer.org/dl/mags/cs/2009/04/extras/ msp2009040029s1.pdf.