Cache-Oblivious Representation of B-Tree Structures

Lukáš Ondráček, Ondřej Mička

We propose a general data structure CORoBTS for storing B-tree-like search trees dynamically in a cache-oblivious way combining the van Emde Boas memory layout with packed memory a…