You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@flink.apache.org by "ASF GitHub Bot (JIRA)" <ji...@apache.org> on 2016/05/25 11:56:12 UTC
[jira] [Commented] (FLINK-3965) Delegating GraphAlgorithm
[ https://issues.apache.org/jira/browse/FLINK-3965?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15299937#comment-15299937 ]
ASF GitHub Bot commented on FLINK-3965:
---------------------------------------
GitHub user greghogan opened a pull request:
https://github.com/apache/flink/pull/2032
[FLINK-3965] [gelly] Delegating GraphAlgorithm
A DelegatingGraphAlgorithm wraps a GraphAlgorithm result with a delegating proxy object. The delegated object can be replaced when the same algorithm is run on the same input with a mergeable configuration. This allows algorithms to be composed of implicitly reusable algorithms
without publicly sharing intermediate DataSets.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/greghogan/flink 3965_delegating_graphalgorithm
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/flink/pull/2032.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #2032
----
commit 615ba45e83461b482a5902811610f26ff2d7a258
Author: Greg Hogan <co...@greghogan.com>
Date: 2016-05-25T10:43:41Z
[FLINK-3965] [gelly] Delegating GraphAlgorithm
A DelegatingGraphAlgorithm wraps a GraphAlgorithm result with a
delegating proxy object. The delegated object can be replaced when the
same algorithm is run on the same input with a mergeable configuration.
This allows algorithms to be composed of implicitly reusable algorithms
without publicly sharing intermediate DataSets.
----
> Delegating GraphAlgorithm
> -------------------------
>
> Key: FLINK-3965
> URL: https://issues.apache.org/jira/browse/FLINK-3965
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 1.1.0
> Reporter: Greg Hogan
> Assignee: Greg Hogan
> Fix For: 1.1.0
>
>
> Complex and related algorithms often overlap in computation of data. Two such examples are:
> 1) the local and global clustering coefficients each use a listing of triangles
> 2) the local clustering coefficient joins on vertex degree, and the underlying triangle listing annotates edge degree which uses vertex degree
> We can reuse and rewrite algorithm output by creating a {{ProxyObject}} as a delegate for method calls to the {{DataSet}} returned by the algorithm.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)