Re:DGraph – Scalable, Distributed, Low-Latency, High-Through...
by maxdemarzi on Monday March 21, 2016 @01:44AM
(#11326431)
Wait, I don't understand. If I create a relationship "User 1" -[:LIKES]->"Chocolate Ice Cream". Does the "Chocolate Ice Cream" know which users liked it or not?
[ Parent
| on HN ]
Re:DGraph – Scalable, Distributed, Low-Latency, High-Through...
by yazaddaruvala on Monday March 21, 2016 @01:55AM
(#11326462)
My takeaway is that "Chocolate Ice Cream" would not know about "User 1" unless an explicit relationship "Chocolate Ice Cream" -[:liked_by]->"User 1" is created
Re:DGraph – Scalable, Distributed, Low-Latency, High-Through...
by nl on Monday March 21, 2016 @06:39AM
(#11327180)
I'm guessing not.
This isn't unusual - it's somewhat analogous to the derived (inferred) relationship thing in RDF-style graph databases (eg, Sydney is-in Australia, Australia is-in Oceania, therefor Sydney is-in Oceania).
This sounds like a great idea, but in practice doesn't always work so well. You end up with an explosion of relations, some of which are completely useless.
I'm not opposed to this decision being a choice.