5 ms·
I think it would have been easier for me to understand if they put everything in terms of a B+ tree, where the leaf nodes contain keys and values.
by misframer 12y ago
I think it would have been easier for me to understand if they put everything in terms of a B+ tree, where the leaf nodes contain keys and values.
- meritt 12y agoInnoDB does indeed use a B+ tree. A more thorough article on the topic is http://blog.jcole.us/2013/01/10/btree-index-structures-in-innodb/ http://blog.jcole.us/2013/01/10/btree-index-structures-in-in... or the book High Performance MySQL.
- misframer 12y agoI know it uses a B+ tree. I wanted to mention that the article doesn't mention them at all. I'm familiar with the High Performance MySQL book -- I work with one of the authors :).
- meritt 12y agoCool. I was more taking the opportunity in replying to you to point out that this article isn't very good :)
- peterwwillis 12y agoI remember when I was learning SQL, I thought "Why doesn't the database just look up the records faster by storing them in a B+ tr.... Oh, wait, it does that already." SQL is FAST!