Buffered Persistence in B+ Trees (Abstract)
Mingzhe Du, Michael Lee Scott · 2025
Existing concurrent B+ trees for Non-Volatile Memory (NVM) persist every update immediately, incurring high persistence overhead and excessive NVM writes, even though such strict durability is often unnecessary. B+ trees are commonly used to index disk- and flash-based databases, where updates are typically buffered and persistence occurs on a millisecond timescale. We propose BD+Tree, a Buffered Durable B+ tree that defers and batches NVM writes. BD+Tree improves performance and reduces NVM wear-out by lowering persistence overhead and improving cache efficiency.