Hi Marcus, Yes, each key would has it's own window managed, so the aggregation on window is sum of the value by each key, not sum of all element. You can imagine that each key has its own sliding window assignor that decides each element in each keyed stream belong to which windows, but all keyed stream use the same strategy. That is the definition of sliding window in Streaming API. And the definition of yours is not supported by Flink intuitively. One way is to implement it by yourself with ProcessFunction.
Best Regards, Tony Wei mclendenin <marcusc...@gmail.com>於 2017年10月11日 週三，下午8:52寫道： > Hi Tony, > > In the documentation on keyed windows vs non-keyed it says that it will > split the stream into parallel keyed streams with windows being executed in > parallel across the keys. I would think that this would mean that each key > has it's own window managed independently. > > > https://ci.apache.org/projects/flink/flink-docs-release-1.2/dev/windows.html#keyed-vs-non-keyed-windows > > > > > -- > Sent from: > http://apache-flink-user-mailing-list-archive.2336050.n4.nabble.com/ >
