Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index
A B-Tree is the most widely used range index for larger-thanmemory data systems. It organizes data in pages (usually 4 KB) that efficiently align with disk IO operations, fully utilizing each IO operation to narrow down the search space. On the other hand, a B-Tree’s page-based organization leads to inefficient caching and high write amplification, as it needs to cache the entire page as a whole while often only a small subset of records are hot, and it needs to write the entire page for a single record update
more details