On Thu, 17 Jan 2019 at 00:31, David Conlin wrote:
> How the time values combine with parallelism. For example, each execution of
> the sort node takes an average of 48.5s, over three loops. This makes a total
> running time of 145.5s. Even if this was perfectly distributed between the
> two wor
It seems like no-one has any ideas on this - does anyone know anywhere
else I can try to look/ask to find out more?
Is it possible that this is a bug?
Thanks
Dave
On 16/01/2019 11:31, David Conlin wrote:
Hi folks -
I'm having trouble understanding what some of the stats mean in the
execut
