as far as I see this will need to be manually implemented in DGraph
You are correct. In Dgraph, you have to handle this yourself.
There are two different options for grouping nodes.
- As you suggest, have a
grouppredicate in your schema. And then set this to be the name of the group. With appropriate indexing, you can then search for all members of a group, filter in/out groups when doing normal queries etc. - Instead, you could have a different predicate for each group. E.g. All nodes in group A could have a
group_apredicate. All members of group B could have agroup_bpredicate. Then you can use the has function to filter and search in queries.
We recommend to use the second approach. This is because it scales better and results in lots of smaller predicates rather than one large predicate.