2 ms·
B-trees are great! They have better locality than binary trees --- that's why filesystems are universally based on B-trees: seeks are slow. As cache effects bec
by quotemstr 14y ago
B-trees are great! They have better locality than binary trees --- that's why filesystems are universally based on B-trees: seeks are slow. As cache effects become ever more important, B-trees are starting to become important even for problems that fit in main memory.
- leif 14y agoAnd as data and disks grow, we'll see write-optimized structures like LSM trees and Fractal Trees in this matrix as well.