3 ms·
+1. We take for granted the maturity of RDB systems, but it makes for a stark comparison to GraphDBs. Calculating over or walking over graphs sucks because the
by usgroup 8y ago
+1. We take for granted the maturity of RDB systems, but it makes for a stark comparison to GraphDBs.
Calculating over or walking over graphs sucks because there is usually a better, less brute way for any particular query.
Unless you have a set of use cases that require the ability to query across near enough random and unindexable subsets of a graph (eg Facebook), you’ll probably be better off with a DB and a spot of flattening.