GraphX
Reynold Xin, Joseph E. Gonzalez, Michael J. M. Franklin et al. · 2013
From social networks to targeted advertising, big graphs capture the structure in data and are central to recent advances in machine learning and data mining. Unfortunately, directly applying existing data-parallel tools to graph computation tasks can be cumbersome and inefficient. The need for intuitive, scalable tools for graph computation has lead to the development of new graph-parallel systems (e.g., Pregel, PowerGraph) which are designed to efficiently execute graph algorithms. Unfortunately, these new graph-parallel systems do not address the challenges of graph construction and transformation which are often just as problematic as the subsequent computation. Furthermore, existing graph-parallel systems provide limited fault-tolerance and support for interactive data mining.
Cited by 581 works. doi:10.1145/2484425.2484427
Authors
References
- The PageRank Citation Ranking : Bringing Order to the Web
- Error and attack tolerance of complex networks
- Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing
- Pregel
- On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- PowerGraph: distributed graph-parallel computation on natural graphs
- The Combinatorial BLAS: design, implementation, and applications
- Multilevel Algorithms for Partitioning Power-Law Graphs
- Kineograph