Dgraph client libraries in various programming languages.
*grpc.ClientConn
per Dgraph instance, or routing traffic through a load
balancer. Mutations are made in a round robin fashion, resulting in a
semi-random initial predicate distribution.address
predicate); oruid
predicate of the same node (changes to [uid]
predicates can be concurrently written); or@upsert
set in
the schema (see upserts).