THE SEARCH PROBLEM: WHY YOUR COMPUTER FINDS THINGS FASTER THAN YOU DO

Summary from the TLDR Dev newsletter

This blog post explores the limitations of binary search trees compared to B-trees when dealing with disk I/O. While binary trees are efficient in memory, their performance degrades a lot on disk due to the high cost of each disk access. On the other hand, B-trees, by storing multiple keys per node that fit within a single disk block, reduce the number of disk reads required for searching.