Bf-Tree: modern read-write-optimized concurrent larger-than-memory range index
Summary
Bf-Tree is a modern read-write-optimized concurrent range index designed to handle data larger than RAM. It is implemented in Rust by Microsoft Research and includes a VLDB 2024 paper, design docs, and practical guidance for building and testing. The project demonstrates scalable indexing concepts applicable to large-scale data systems.