rdaum/rart-rs

Lock-free adaptive radix tree [OSDI '26]

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.

A memory-efficient patricia tree implementation written in Rust

An immutable, copy-on-write, versioned adaptive radix trie data-structure

Fast generic radix trie implemented in Rust

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

Adaptive Radix Trie implementation

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

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