A object has two in-degrees, the type of degree is different, how to shard？
You mean node has two predicates? Dgraph does sharding based on predicate and does an auto-rebalance when required. See here.
okay，still thank you，I want to know whether the node will exist in two shards？Dgraph does sharding based on predicate.
uid corresponding to computer will exist in
predicate shard and
There are many such cases, which will cause great data redundancy
It doesn’t store all the information of the computer node but a unique identifier (
uid) of that node.
okay，thank you for your help！