I would most-definitely like to see the Single predicate sharded across groups solved in 2020.
Also, an idea for a TBD feature - I’d like to see support towards general graph algorithms, such as Similarity, Centrality (Who’s the center of a network given a set of nodes), and Paths (Shortest path between two people). I find this is one gaping hole when comparing DGraph to Neo4j.
For graph algorithms, we already have shortest path. Similarity and Centrality and such – we don’t have any plans to add those. They can be built on top of Dgraph.