Implementation of BT-trees

TL;DR

This paper details the implementation of BT-trees, an efficient ordered map data structure, and compares its performance with unordered maps, showing it is often faster than other ordered maps and competitive with unordered maps.

Contribution

Provides comprehensive implementation details of BT-trees and evaluates their performance against unordered maps, highlighting their efficiency and competitive speed.

Findings

BT-trees are often much faster than other ordered maps.

BT-trees have comparable performance to unordered maps.

In certain benchmarks, BT-trees are not faster than the fastest unordered maps.

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.