microsoft/bf-tree

Health v2 · maintenance only

Flags: no_releases

Adoption not part of the score

1064 stars · 44 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

Bf-Tree is a read-write-optimized concurrent range index (key-value store) written in Rust, from Microsoft Research, designed to work efficiently with data larger than memory. It is distributed as a Rust crate and supports consistent CPR-style snapshots and recovery.

Use cases

• embed a fast concurrent key-value index in a Rust application
• store and query data larger than available RAM
• take consistent snapshots of an index and recover from them
• build a storage engine needing read-write optimized range indexing
• replace in-memory maps with a persistent larger-than-memory index

When to choose

• you need a concurrent range index in Rust with snapshot/recovery support
• your working set exceeds memory but you want cache-friendly performance
• you want a research-backed index from Microsoft Research with an MIT license

When to avoid

• you need a full standalone database server or SQL queries
• you need a mature production database with rich ecosystem support
• you need a distributed or replicated store

Facets

library · maturity active

database caching concurrency databases developer-tools performance rust windows cross-platform key-value-store range-index larger-than-memory concurrent-index rust-crate research-project snapshots write-optimized linux macos

Member repositories

For agents

markdown · JSON · MCP: product_card(name="microsoft/bf-tree")