Amanieu/brie-tree

Fastest concurrent ordered map

A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and allows lookups of entries by value or sorted order position.

An implementation of the C++ Masstree data structure in Rust.

An Adaptive Radix Tree implementation.

A hash table with strong order and fast iteration; access items by key or sequence index

Lock-free adaptive radix tree [OSDI '26]

A hash table with consistent order and fast iteration; access items by key or sequence index

Bf-Tree is a modern read-write-optimized concurrent larger-than-memory range index in Rust from MS Research.

A memory-efficient patricia tree implementation written in Rust