GraphX: A resilient distributed graph system on spark

1st International Workshop on Graph Data Management Experiences and Systems, GRADES 2013 - Co-located with SIGMOD/PODS 2013

Volumn , Issue , 2013, Pages

  Xin, Reynold S ^a   Gonzalez, Joseph E ^a   Franklin, Michael J ^a   Stoica, Ion ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TASKS; GRAPH ALGORITHMS; GRAPH CONSTRUCTION; GRAPH REPRESENTATION; INTERACTIVE DATA MINING; LINES OF CODE; MASSIVE GRAPH; TARGETED ADVERTISING;

ELECTRIC SPARKS; FAULT TOLERANCE; INFORMATION MANAGEMENT; TOOLS;

COMPUTATIONAL EFFICIENCY;

EID: 84880566945     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2484425.2484427     Document Type: Conference Paper

References (12)

1. A. Abou-Rjeili and G. Karypis. Multilevel algorithms for partitioning power-law graphs. In IPDPS, 2006.
2. R. Albert, H. Jeong, and A. L. Barabási. Error and attack tolerance of complex networks. In Nature, volume 406, pages 378-482, 2000.
3. A. Buluç and J. R. Gilbert. The combinatorial blas: design, implementation, and applications. IJHPCA, 25(4):496-509, 2011.
4. U. V. Çatalyürek, C. Aykanat, and B. Uçar. On two-dimensional sparse matrix partitioning: Models, methods, and a recipe. SIAM J. Sci. Comput., 32(2):656-683, 2010.
5. R. Cheng et al. Kineograph: taking the pulse of a fast-changing and connected world. In EuroSys, 2012.
6. J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI '12.
7. K. Lang. Finding good nearly balanced cuts in power law graphs. Technical Report YRL-2004-036, Yahoo! Research Labs, Pasadena, CA, Nov. 2004.
8. J. Leskovec et al. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29-123, 2008.
9. G. Malewicz, M. H. Austern, A. J. Bik, J. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD, pages 135-146, 2010.
10. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab, 1999.
11. P. Stutz, A. Bernstein, and W. Cohen. Signal/collect: graph algorithms for the (semantic) web. In ISWC, 2010.
12. M. Zaharia et al. Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. NSDI, 2012.