Implementation of BT-trees
Data Structures and Algorithms
2015-05-07 v1
Abstract
This document presents the full implementation details of BT-trees, a highly efficient ordered map, and an evaluation which compares BT-trees with unordered maps. BT- trees are often much faster than other ordered maps, and have comparable performance to unordered map implementations. However, in benchmarks which favor unordered maps, BT-trees are not faster than the fastest unordered map implementations we know of.
Keywords
Cite
@article{arxiv.1505.01210,
title = {Implementation of BT-trees},
author = {Lars F. Bonnichsen and Christian W. Probst and Sven Karlsson},
journal= {arXiv preprint arXiv:1505.01210},
year = {2015}
}