I run community detection algorithms(unionFind, Louvain) to partition my graph database.
However, I recently encountered some performance problem because of super nodes.
I have the linking structure like below.
and other similar structures.
Basically, we want to use the property node(like device node) the users shared to link them.
Majority(99%) of the property nodes are only linked to ONE user.
However, some extreme ones link to 10K+ users which form super nodes.
Any suggested way to solve the super node performance issue?