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.
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.
ASHes to ASHes, DOS to DOS.
