Introduction

The adaptive radix tree is variant of a radix tree that has adaptive node sizes. Adaptive node sizes give space-efficiency and betters leverages modern hardware architectures. As a result, the adaptive radix tree should see better performance than other tree data-structures.

I’ve built my own implementation of an adaptive radix tree in Java to explore this further, which can be found here.

More information can be found by reading: “The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases” by Viktor Leis.

Associated Posts

As well as implementing the collection, some benchmarks will be executed to compare the performance against comparison-based trees. Some implementation detail and benchmark discussion will be shared in posts published over the coming weeks: