Final word on HDDs and B-Trees vs BSTs
Chronicles of DB Indexes - Part 6
Final article on BSTs, B-Trees and HDDs. Next week I'll be focusing more on difference between B-Trees and B+Trees, Clustered & Heap tables, SARGable predicates and ways to navigate aroung trees.
(Fun fact: most of literature refers to B+Trees but writes B-Trees. No clue why. They are structured pretty much differently!)
But let's focus on these two at hand. And I'm publishing two because I got bored of diving deep into HDD + B-Tree vs BST story any more :)
I do hope that it's clear by now that the whole idea of B-Trees is to pack as much data as possbile, so that HDD crane has to do as few movements as possible.
Well, just in case it's NOT 100% clear, hereby I provide these two additional graphic that should make it crystal clear :)
P.S. If you like these posts, please click a LIKE button below them. It doesn’t do much for you, but helps me know which direction to steer future content in :)
Thanks for reading Bitesized Engineering! Subscribe for free to receive new posts and support my work.