[jira] [Commented] (FLINK-1536) Graph partitioning operators for Gelly

["Rohit (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/FLINK-1536?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15286388#comment-15286388 ] 

Rohit commented on FLINK-1536:
------------------------------

Hi,

Just wanted to know what is the current state for this JIRA. I am working on graph stream mining as part of my PhD work and is looking for graph processing systems which can support graph stream partitioning. Is there any existing feature in gelly which can take custom partition strategy? If not Can I work on this JIRA and extend it to support dynamic graph partitioning for evolving graphs like calling the partitioning again after significant mutation of the graph?

> 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
>            Reporter: Vasia Kalavri
>            Priority: Minor
>
> 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)