|
|
|
|
|
by h0l0cube
2248 days ago
|
|
Is anyone using Dgraph out in the wild? I was meaning to look into it for a toy project to build my own crawler, and news discovery engine, and I have some questions... 1) What extra utility does it provide over other DBMSes with graph abstractions? 2) Is the join-depth problem an actual thing?[0] Does Dgraph solve some real-world problems for you for complex queries? 3) Are there 'pure' graph database systems out there that compete with Dgraph? [0] https://dgraph.io/blog/post/why-google-needed-graph-serving-... |
|
Dgraph is being used by many big and small companies in the wild. Some public examples are Intuit [1] and VMware [2].
1. Graph abstractions all suffer from high fan-out problem. Because all processing of data needs to be done at the abstraction layer, queries which deep traversals or lots of results in intermediate steps end up fetching lots of data repeatedly. This causes query performance to suffer. This is why many performance focused users avoid anything deeper than depth-2 queries with typical DBs / layers.
2. A way to think about this question is: Are data denormalization and duplication actual things? Indeed they are. If the DB did not suffer from join depth performance, these two things wouldn't need to exist.
3. Surely there are.
[1]: https://github.com/intuit/katlas [2]: https://github.com/vmware/purser/blob/master/docs/developers...