flink-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Stephan Ewen <se...@apache.org>
Subject Re: difference between reducefunction and GroupReduceFunction
Date Fri, 22 May 2015 10:00:05 GMT
Performance-wise, a "GroupReduceFunction" with Combiner should right not be
slightly faster than the ReduceFunction, but not much.

Long term, the ReduceFunction may become faster, because it will use hash
aggregation under the hood.


On Fri, May 22, 2015 at 11:58 AM, santosh_rajaguru <sanit4u@gmail.com>
wrote:

> Thanks Maximilian.
>
> My use case is similar to the example given in the graph analysis.
> In graph analysis, the reduce function used is a normal reduce function.
> I executed that with both scenarios and your justification is right. the
> normal reduce function have a combiner before sorting unlike the
> GroupReduce
> function.
> my question, how is it effecting the performance as the result is same in
> both the situation.
>
>
> Thanks and Regards,
> Santosh
>
>
>
>
>
> --
> View this message in context:
> http://apache-flink-mailing-list-archive.1008284.n3.nabble.com/difference-between-reducefunction-and-GroupReduceFunction-tp5768p5785.html
> Sent from the Apache Flink Mailing List archive. mailing list archive at
> Nabble.com.
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message