Re: Cartesian product over windows

2017-02-23 Thread Robert Metzger
in a single task? > > > > -- > View this message in context: http://apache-flink-user- > mailing-list-archive.2336050.n4.nabble.com/Cartesian-product-over-windows- > tp11676p11716.html > Sent from the Apache Flink User Mailing List archive. mailing list archive > at Nabble.com. >

Re: Cartesian product over windows

2017-02-17 Thread Sonex
Hi Till, when you say parallel windows, what do you mean? Do you mean the use of timeWindowAll which has all the elements of a window in a single task? -- View this message in context: http://apache-flink-user-mailing-list-archive.2336050.n4.nabble.com/Cartesian-product-over-windows

Re: Cartesian product over windows

2017-02-17 Thread Till Rohrmann
Hi Ioannis, with a flatMap operation which replicates elements and assigning them a proper key followed by a keyBy operation you can practically generate all different kinds of partitionings. So if you first collect the data in parallel windows, you can then replicate half of the data of each win

Cartesian product over windows

2017-02-16 Thread Ioannis Kontopoulos
Hello everyone, Given a stream of events (each event has a timestamp and a key), I want to create all possible combinations of the keys in a window (sliding, event time) and then process those combinations in parallel. For example, if the stream contains events with keys 1,2,3,4 in a given window