surrealdb/vart

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

Prolly is a content-addressed ordered map built on prolly trees. It gives applications immutable snapshots, cheap branching, structural sharing, efficient diffs and merges, sync primitives, and verifiable key/range proofs.

Lock-free adaptive radix tree [OSDI '26]

A memory-efficient patricia tree implementation written in Rust

A low-level, versioned, embedded, ACID-compliant, key-value database for Rust

Fast generic radix trie implemented in Rust

DriftDB - An experimental append-only database with built-in time travel. Query any point in history, guaranteed data integrity, and immutable audit trails. Written in Rust.

Base-16 Modified Patricia Merkle Tree (aka Trie)

Merkleized IAVL+ Tree implementation in Go