Split predicates into multiple groups

[diggy (Dgraph Bot)]

Moved from GitHub dgraph/4585

Posted by rahst12:

Experience Report

A given predicate always belongs to same group, i.e will always go same node (and its replicas)
So this node/server will eventually fill-up and there is no way to horizontally scale the storage.

Note: Feature requests are judged based on user experience and modeled on Go Experience Reports. These reports should focus on the problems: they should not focus on and need not propose solutions.

What you wanted to do

What you actually did

Why that wasn’t great, with examples

Any external references to support your case

Splitting predicates into multiple groups

A given predicate always belongs to same group, i.e will always go same node (and its replicas) So this node/server will eventually fill-up and there is no way to horizontally scale the storage. Has any work been done on splitting the predicate into multiple groups? ( https://docs.dgraph.io/design-concepts/#group) If not, what solutions are offered, without vertically scaling (which has limits and be expensive) ?

[diggy (Dgraph Bot)]

MichelDiz commented :

Hey @rahst12, this was accepted but it was already in the 2020 roadmap as the name “Single predicate sharded across groups (TBD)”.

Cheers.