Skip to content
Snippets Groups Projects
Commit 0c9d39bb authored by Joseph E. Gonzalez's avatar Joseph E. Gonzalez
Browse files

More organizational changes and dropping the benchmark plot.

parent 34496d6a
No related branches found
No related tags found
No related merge requests found
...@@ -66,17 +66,7 @@ computation in one system with a single composable API. The GraphX API ...@@ -66,17 +66,7 @@ computation in one system with a single composable API. The GraphX API
enables users to view data both as a graph and as enables users to view data both as a graph and as
collection (i.e., RDDs) without data movement or duplication. By collection (i.e., RDDs) without data movement or duplication. By
incorporating recent advances in graph-parallel systems, GraphX is able to optimize incorporating recent advances in graph-parallel systems, GraphX is able to optimize
the execution of graph operations. In preliminary experiments we find that the GraphX the execution of graph operations.
system is able to achieve performance comparable to state-of-the-art
graph-parallel systems while easily expressing the entire analytics pipelines.
<p style="text-align: center;">
<img src="img/graphx_performance_comparison.png"
title="GraphX Performance Comparison"
alt="GraphX Performance Comparison"
width="50%" />
<!-- Images are downsized intentionally to improve quality on retina displays -->
</p>
## GraphX Replaces the Spark Bagel API ## GraphX Replaces the Spark Bagel API
...@@ -279,11 +269,15 @@ val outputGraph: Graph[Double, Double] = ...@@ -279,11 +269,15 @@ val outputGraph: Graph[Double, Double] =
## Structural Operators ## Structural Operators
<a name="structural_operators"></a> <a name="structural_operators"></a>
## Join Operators
<a name="join_operators"></a>
## Map Reduce Triplets (mapReduceTriplets) ## Map Reduce Triplets (mapReduceTriplets)
<a name="mrTriplets"></a> <a name="mrTriplets"></a>
# Graph Builders # Graph Builders
<a name="graph_builders"></a> <a name="graph_builders"></a>
...@@ -295,7 +289,8 @@ val userGraph: Graph[(String, String), String] ...@@ -295,7 +289,8 @@ val userGraph: Graph[(String, String), String]
# Optimized Representation # Optimized Representation
The Property Graph is internally represented as a collection of RDDs This section should give some intuition about how GraphX works and how that affects the user (e.g.,
things to worry about.)
<p style="text-align: center;"> <p style="text-align: center;">
<img src="img/edge_cut_vs_vertex_cut.png" <img src="img/edge_cut_vs_vertex_cut.png"
...@@ -319,6 +314,19 @@ The Property Graph is internally represented as a collection of RDDs ...@@ -319,6 +314,19 @@ The Property Graph is internally represented as a collection of RDDs
# Graph Algorithms # Graph Algorithms
<a name="graph_algorithms"></a> <a name="graph_algorithms"></a>
This section should describe the various algorithms and how they are used.
## PageRank
## Connected Components
## Shortest Path
## Triangle Counting
## K-Core
## LDA
<p style="text-align: center;"> <p style="text-align: center;">
<img src="img/tables_and_graphs.png" <img src="img/tables_and_graphs.png"
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment