An Introduction to Bε-trees and Write-Optimization
Summary
This USENIX LOGIN article introduces the Bε-tree, a write-optimized data structure for on-disk storage. It compares Bε-trees to B-trees and LSM-trees, presents performance measurements, and guides readers on designing applications to exploit write-optimized storage.