Hi Andre,
I'm happy you were able to solve your problem :)
Improvements to the documentation are always welcome!
To me ST != WT is straight-forward from the javadocs, but I guess it
wouldn't hurt to stress it in the docs.
Do you think you could simplify your implementation a bit to make for a
nic
Hi Vasia!
Many thanks for your reply! Your hints finally enabled me implementing
the problems first-choice solution using delta iteration:
https://gist.github.com/p3et/12deb7d6321b48e9efab
Do you think this could be worth to be contributed as an example within
the Flink documentation? The exa
Hi Andre,
On 4 November 2015 at 16:04, André Petermann <
peterm...@informatik.uni-leipzig.de> wrote:
> Hi Fabian,
>
> thanks for your fast reply!
>
> I created a gist to explain the while-not-empty loop in more detail:
> https://gist.github.com/p3et/9f6e56cf0b68213e3e2b
>
> It is an approach to c
Hi Fabian,
thanks for your fast reply!
I created a gist to explain the while-not-empty loop in more detail:
https://gist.github.com/p3et/9f6e56cf0b68213e3e2b
It is an approach to create a minimal example of the kind of algorithm
corresponding to page 1 of the PDF, in particular frequent substr
Hi Andre,
Thanks for reaching out to the Flink community!
I am not sure your analysis is based on correct assumptions about Flink's
delta iterations.
Flink's delta iterations do support
- working and solution sets of different types
- worksets that grow and shrink or are completely replaced in ea
