ok great.
Thanks !
On 2019/02/04 18:00:16, Fabian Hueske wrote:
> Yes, I think that should work.
>
> Best, Fabian
>
> Am Mo., 4. Feb. 2019 um 18:35 Uhr schrieb morin.david@gmail.com <
> morin.david@gmail.com>:
>
> > Hello Fabian,
> >
> > Thanks !
> > According to your answers on this
Yes, I think that should work.
Best, Fabian
Am Mo., 4. Feb. 2019 um 18:35 Uhr schrieb morin.david@gmail.com <
morin.david@gmail.com>:
> Hello Fabian,
>
> Thanks !
> According to your answers on this post
> https://stackoverflow.com/questions/50340107/order-of-events-with-chained-keyby-ca
Hello Fabian,
Thanks !
According to your answers on this post
https://stackoverflow.com/questions/50340107/order-of-events-with-chained-keyby-calls-on-same-key,
if I'm right I can use my sort function followed by a keyby and use a Window
for aggregate these events. And the order will be preser
Hi,
A WindowAll is executed in a single task. If you sort the data before the
window, the sorting must also happen in a single task, i.e., with
parallelism 1.
The reasons is that an operator somewhat randomly merges multiple input
partitions. So even if each input partition is sorted, the merging
