Main memory latency is a huge factor in modern performance analysis. And I was sad to see that this wasn't even covered in the article. The biggest win for a B-tree for in-memory use IMHO isn't actually the size advantage, it's the fact that you can prefetch each node and not have to pay the full round trip latency for log2(N) lookups.
It's only easy if your system isn't maxed or if your data segment isn't already at its limits. (64 bit addresses cause yet another round of bloat.)
That being said, for a large enough server farm, yes, linear improvements are totally beneficial. (And a small enough server farm.) But its important to keep in perspective that not all betters are created equal ;)
http://news.ycombinator.com/item?id=305937
4 gigs of DRAM costs less than $100, today. Who cares if software is bloated?