Counting predicate cardinality should be fast

Issues Dgraph
, , ,
3

Approximation as in Implement approximate counts using HyperLogLog++ algorithm would work well for me. I would need this not for a single but multiple predicates though:

  pred1 as var(func: has(<dgraph.graphql.schema>))
  pred2 as var(func: has(<dgraph.graphql.xid>))
  pred3 as var(func: has(<dgraph.type>))

  result (func: uid(pred1,pred2,pred3)) {
    count(uid)
  }

Would that work as well?