[
https://issues.apache.org/jira/browse/FLINK-1536?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14353834#comment-14353834
]
Vasia Kalavri commented on FLINK-1536:
--------------------------------------
Hi [~ayd],
can you please give me some details on what you mean by graph input method?
Gelly represents a Graph as a DataSet of Vertices and a DataSet of Edges. You
can read on how we can create a graph from files, collections or DataSets in
the [Gelly
guide|http://ci.apache.org/projects/flink/flink-docs-master/gelly_guide.html#graph-creation].
Let me know if you have questions!
-V.
> GSoC project: Graph partitioning operators for Gelly
> ----------------------------------------------------
>
> Key: FLINK-1536
> URL: https://issues.apache.org/jira/browse/FLINK-1536
> Project: Flink
> Issue Type: New Feature
> Components: Gelly, Java API
> Reporter: Vasia Kalavri
> Priority: Minor
> Labels: graph, gsoc2015, java
>
> Smart graph partitioning can significantly improve the performance and
> scalability of graph analysis applications. Depending on the computation
> pattern, a graph partitioning algorithm divides the graph into (maybe
> overlapping) subgraphs, optimizing some objective. For example, if
> communication is performed across graph edges, one might want to minimize the
> edges that cross from one partition to another.
> The problem of graph partitioning is a well studied problem and several
> algorithms have been proposed in the literature. The goal of this project
> would be to choose a few existing partitioning techniques and implement the
> corresponding graph partitioning operators for Gelly.
> Some related literature can be found [here|
> http://www.citeulike.org/user/vasiakalavri/tag/graph-partitioning].
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
