Anything where you need transitive closure, that is, you need all the nodes that are reachable from a given starting node. You can do it in SQL dialects that s

Anything where you need transitive closure, that is, you need all the nodes that are reachable from a given starting node. You can do it in SQL dialects that support recursive common table expressions. In a previous job, I dealt with Bill of Materials data, which basically a parts list for a hardware product. Parts contain other parts, which contain other parts, and so on, recursively. The data was in SQL Server. I could have moved the data to Neo4j and gotten a much more concise and convenient syntax for traversing the parent-child relationships. But I decided it wasn't worth the trouble of moving data, so I bit the bullet and just wrote the recursive CTE in SQL. That's the biggest problem with graph databases. If your data's already in a SQL database, it often isn't worth it to _move all your data_ just to get a better query syntax.