What I want to do 『Dgraph colocates data per predicate (* P *, in RDF terminology), thus the smallest unit of data is one predicate. To shard the graph, one or many predicates are assigned to a group.』 i want to know whether has the plan which split Partitioning granularity to imporve the throughp…

Whether going to change sharding mechanism to improve the thoughput?

MichelDiz (Michel Diz) May 6, 2021, 1:23pm 6

Not sure, but looks like it will take time.

Topic		Replies	Views
Does Dgraph have a scalability problems with graphs having single heavy predicate? Dgraph	8	94	December 11, 2024
Idea - Shard predicate / Edge across groups Dgraph rfc	2	1066	April 20, 2021
Dgraph Scalability Users	4	490	January 6, 2020
Dgraph High Write Throughput Dgraph performance , area:performance	0	662	November 12, 2020
Database sharding: How to scale a graph database - Dgraph Blog Blog	3	834	December 1, 2021