3 ms·

To understand the difference between JOINS and direct links in a Graph Database look at: http://www.slideshare.net/lvca/why-relationships-are-cool-but-join-suck

• cwyers 13y ago
  Slide 18 is titled "The JOIN is the evil!" I will probably stop laughing at that, but I can't guarantee when.
• catnaroek 13y ago
  A sales presentation is not going to convince me. I am interested in static guarantees of data integrity. I do not want to be worried whether I am inserting the wrong kind of data to a database, or whether by deleting some data, I am putting the database into an inconsistent state. For this particular need, I have found nothing better than relational databases in practice. There is still room for improvement, e.g. http://math.mit.edu/~dspivak/informatics/talks/CTDBIntroductoryTalk http://math.mit.edu/~dspivak/informatics/talks/CTDBIntroduct... , but that category-theory-based model is a refactoring and extension of the relational model, not a rejection of it.
• 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 ago
    O(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.