The B-tree has at least two lessons, independently of whether you ever re-implement one: (a) using trees instead of flat search gains an O(log n) over O(n) algo

The B-tree has at least two lessons, independently of whether you ever re-implement one: (a) using trees instead of flat search gains an O(log n) over O(n) algorithmic factor, and (b) using chunky flat elements sized to the bandwidth-delay product of storage results in significant wall-clock (constant factor?) gains. I fail to see how CHS provides equivalently valuable lessons? https://news.ycombinator.com/item?id=39826433 https://news.ycombinator.com/item?id=39826433