|
|
|
|
|
by mrjn
2248 days ago
|
|
(Author of Dgraph here) 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... |
|
It was probably a misstep to criticize Google, as you did in the link in my post. Your ressentiment only highlighted that respected people at Google voted against your technology. It did catch my attention, but it might have burnt some bridges, and left me with a lingering question mark.
I think if you're sincere about adoption of your technology, it has to be couched in clear terms of how it will fulfill business needs, and I'd like to see that. I'm intrigued by this performance gain, but I need a strong argument to help me decide if it's worth the opportunity cost to try Dgraph to make something.