Hi Andra,
CoGroup is not implemented as a Cartesian product, so O(V*E) is not a very
accurate approximation.
All this depends on what you count. Let's assume single-node execution and
that everything fits in memory, and let's count comparisons and UDFs on
groups.
Then, coGroup sorts both inputs,
Hi everyone,
I am not 100% sure about this one, so I thought that I could set my
thoughts straight via the mailing list.
Here's the use case. You coGroup a data set of vertices with a data set of
edges. That gives you a complexity of* O(|V| * |E|)*, where |V| is the
total number of vertices and |
