I have use case of fraud detection where in I have a graph of 40M edges representing users and their properties, 2 users having same property value are connected via same property value node.
Relations [edges] via which these 2 users are connected are reversible.
My query is like : find all the users which have any of the property value same as the given user.
I want to put aggregation and return users with max match.
Any idea would for how to draw up optimal schema would be a great help.