Direct and indirect Edges

This may also be an "it depends" question, but here I have labels A, B and C where entity C is created by entity B on behalf of entity A.

At the creation time of C I know the instance of both B and A
The cardinality will be roughly say ten Bs for each A (though the Bs can be used by many As and there are potentially millions of Cs, which belong to only one B

Sometimes I want to start with all Cs for A and sometimes with all Cs created by a particular B on behalf of A.

So my choice seems to be only have edges:

A->B->C

Or, to also to have:

A->C

There will be storage for A->C of course, but given the low cardinality of B, is A->C overkill and I can just find all C by iterating B for A without too much cost.
Was this page helpful?