Implementation of a compressing B-tree
The goal of this bachelor thesis was the implementation of a main memory-based compressing B-tree. With main memory databases becoming more significant, data structures optimized for such databases are becoming increasingly important. Such data structures has to be optimized for performance and memory consumption. Therefore in the course of this thesis a B-tree was implemented which uses delta compression as well as optimization of the node structures to achieve these goals. Furthermore multiple node types were evaluated and benchmarked.