3 ms·
They're similar in complexity, but made easier by the fact that graph databases explicitly exist to query these types of relationships. Where someone may not kn
by wooly_bully 8y ago
They're similar in complexity, but made easier by the fact that graph databases explicitly exist to query these types of relationships. Where someone may not know how to find their root manager node in an employee table, it would be an ideal thing to query for in a graph database. There are functions like 'shortestPath' in neo4j for example.