Data Structures
B-Trees:Wide Nodes for Disk (and Why Databases Do Not Use BSTs)
A B-tree packs many keys per node so one disk page is one hop. Why databases and filesystems use this shape, and how B+ trees keep values in the leaves.
Read More1 post(s)