Basically I have 2 hour experience with Dgraph and I am doing research if Dgraph supports a few basic use-case. Upon some research I have come to an understand that since Dgraph is distributed some operations like
select * are not performance friendly.
I will be doing research and updating my post with my understanding, and here are my use cases:
Sample Graph: http://tinkerpop.apache.org/docs/3.2.9/images/tinkerpop-modern.png
Sample Graph Description:
4 people nodes and 3 software nodes with a bunch of inter-connections.
Find all types of nodes/vertices in the database.
NEO4J: MATCH n RETURN DISTINCT label(n)
Find all nodes/vertices that belong to type “people”
NEO4J: MATCH (p:people) RETURN p
peoplewho created a
NEO4J: MATCH (p:people)–>(s:software) RETURN p, s
disclaimer: sample queries are for understanding purposes and might not be 100% accurate.