Streaming graph partitioning for large distributed graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 1222-1230

  Stanton, Isabelle ^a   Kliot, Gabriel ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

distributed graphs; experimental evaluation; graph partitioning; streaming algorithms

Indexed keywords

AS GRAPH; CLUSTER OF NODES; COMMUNICATION COST; DATA SETS; DISTRIBUTED COMPUTATIONS; DISTRIBUTED GRAPHS; EXPERIMENTAL EVALUATION; GRAPH PARTITIONING; LARGE GRAPHS; OFFLINE; PAGERANK COMPUTATIONS; PARTITIONING METHODS; SOCIAL NETWORKS; STREAMING ALGORITHM;

ALGORITHMS; COMMUNICATION; DATA MINING; DISTRIBUTED COMPUTER SYSTEMS; GRAPHIC METHODS;

GRAPH THEORY;

EID: 84866012887     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339722     Document Type: Conference Paper

References (33)

1. http://facebook.com/press/info.php?statistics, Jan 2012.
2. http://pywebgraph.sourceforge.net.
3. http://research.microsoft.com/ldg, Jan 2012.
4. http://research.microsoft.com/trinity, Jan 2012.
5. http://staffweb.cms.gre.ac.uk/~wc06/partition.
6. K. Jin Ahn and S. Guha. Graph sparsification in the semi-streaming model. ICALP, 2009.
7. R. Alberich, J. Miro-Julia, and F. Rossello. Marvel universe looks almost like a real social network. arXiv, 2002.
8. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, 2006.
9. R. Andersen and Y. Peres. Finding sparse cuts locally using evolving sets. In STOC, pages 235-244, 2009.
10. K. Andreev and H. Racke. Balanced graph partitions. Theory of Computing Systems, 39:929-939, 2006.
11. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. J.ACM, 2009.
12. B. Bahmani, A. Chowdhury, and A. Goel. Fast incremental and personalized pagerank. PVLDB, 4(3):173-184, 2010.
13. A-L Barabasi and R Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
14. S. Barnard. PMRSB: Parallel multilevel recursive spectral bisection. In Supercomputing, 1995.
15. S. Bykov, A. Geller, G. Kliot, J. Larus, R. Pandya, and J. Thelin. Orleans: Cloud computing for everyone. In ACM Symposium on Cloud Computing, 2011.
16. G. Even, J. Naor, S. Rao, and B. Schieber. Fast approximate graph partitioning algorithms. SIAM J. Comput, 28(6):2187-2214, 1999.
17. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Supercomputing, 1995.
18. P. Holme and B. J. Kim. Growing scale-free networks with tunable clustering. Phys. Rev. E, 2002.
19. G. Karypis and V. Kumar. Multilevel graph partitioning schemes. In ICPP, pages 113-122, 1995.
20. J. Kelner and A. Levin. Spectral sparsification in the semi-streaming setting. STACS, pages 440-451, 2011.
21. H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In WWW, 2010.
22. J. Leskovec. http://snap.stanford.edu/snap, 2012.
23. J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani. Kronecker graphs: An approach to modeling networks. JMLR, 2010.
24. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. Hellerstein. GraphLab: A new framework for parallel machine learning. In UAI, 2010.
25. G. Malewicz, M. Austern, A. Bik, J. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. PODC, 2009.
26. A. Mislove, M. Marcon, K. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In ACM/USENIX IMC, 2007.
27. M. E. J. Newman. The structure of scientific collaboration networks. Natl Acad Sci, 98:404-9, 2001.
28. A. Das Sarma, S. Gollapudi, and R. Panigrahy. Sparse cut projections in graph streams. In ESA, pages 480-491, 2009.
29. A. Das Sarma, S. Gollapudi, and R. Panigrahy. Estimating pagerank on graph streams. J. ACM, 58(3):13, 2011.
30. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998.
31. M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M.J. Franklin, S. Shenker, , and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. NSDI, 2012.
32. M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica. Spark: Cluster Computing with Working Sets. In HotCloud, 2010.
33. M. Zelke. Intractability of min- and max-cut in streaming graphs. IPL, 111(3):145-150, 2011.