About the partitioning


I’m a beginner in Dgraph, this project is very interesting for me. In order to understand as well the architecture of Dgraph, I would like to know how dgraph do the job of partitioning the big graph in a distributed system. It seems Dgraph used edge-cut, however, I don’t find any docs to detail the strategy of partitioning.

Thanks in advance.

You can read about the sharding strategy at https://docs.dgraph.io/deploy/#understanding-dgraph-cluster. We do shard data by the predicate which is also called the edge.

This topic was automatically closed 30 days after the last reply. New replies are no longer allowed.