4 ms·
I don't get the supposed benefits of direct links over joins. Index lookups are O(log n) or close to O(1) for B-tree and hash indexes, respectively. You can mod
by mtdewcmu 13y ago
I don't get the supposed benefits of direct links over joins. Index lookups are O(log n) or close to O(1) for B-tree and hash indexes, respectively. You can model any kind of graph in a relational database.
- lvca 13y agoO(log n) is ok with small data, let's say up to thousands. But when you've millions or billions of record also the O(log n) takes time. It's about size. Until yesterday we managed small database in comparison to the today's BigData-Base. That's why a Graph Database makes sense today, much more than yesterday.