Comment Re:Nope, he didn't (Score 2, Insightful) 298
No, and no. The data structure described by Henning-Kamp is not a B-tree, but a heap. Additionally, it's cache-aware, not cache-oblivious.
On a paper submitted by a physicist colleague: "This isn't right. This isn't even wrong." -- Wolfgang Pauli
