BS-tree: A gapped data-parallel B-tree

Dimitrios Tsitsigkos, Achilleas Michalopoulos, Nikos Mamoulis +1

We propose BS-tree, an in-memory implementation of the B+-tree that adopts the structure of the disk-based index (i.e., a balanced, multiway tree), setting the node size to a memor…