On: Programmer Competency Matrix

[danso]

Thank goodness B-trees are considered the most-advanced of the data structure knowledge. My com sci classes never did a great job of making those applicable.

[quotemstr → danso]

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 → quotemstr]

And as data and disks grow, we'll see write-optimized structures like LSM trees and Fractal Trees in this matrix as well.