A persistent B+Tree (clustered index) implementation in Rust.
-
Updated
Oct 14, 2021 - Rust
A persistent B+Tree (clustered index) implementation in Rust.
It’s a pure safe BTree that can be used to build your own special-purpose btree data structure
Benchmarking Rust storage engines
Add a description, image, and links to the btree topic page so that developers can more easily learn about it.
To associate your repository with the btree topic, visit your repo's landing page and select "manage topics."