Development of B-epsilon Tree Object Store
The Be-Tree Storage Stack implements a key-value store and is written in Rust. It can be used directly on top of block storage (that is, an HDD or an SSD) and supports copy-on-write, checksums, snapshots and other convenient features. The underlying data structures use B-epsilon trees, which allow limiting fragmentation by making use of larger node sizes.
We would like to update and extend the implementation to improve its performance and robustness. Moreover, it should offer an object store interface in addition to the key-value interface. This topic requires the storage stack to be extended in Rust and, optionally, a JULEA backend to be written in C. Depending on personal preference, the underlying tree structures can also be modified and optimized.
More background information can be found in a previous thesis.
Contact: Michael Kuhn