B-Trees: More Than I Thought I'd Want to Know
(benjamincongdon.me)
from tedu@inks.tedunangst.com to inks@inks.tedunangst.com on 04 Jan 11:26
https://inks.tedunangst.com/l/5152
from tedu@inks.tedunangst.com to inks@inks.tedunangst.com on 04 Jan 11:26
https://inks.tedunangst.com/l/5152
In my college Data Structures and Algorithms course, we covered B-Trees, but I didn’t grok why I’d choose to use one. As presented, B-Trees were essentially “better” Binary Search Trees, with some hand-waving done that they had improved performance when used in database applications. I remember needing to memorize a bunch of equations to determine the carrying capacity of a M-degree B-Tree, and a vague understanding of B-Tree lookup/insertion/deletion, but not much else. Which is a shame! They’re interesting structures.
threaded - newest