Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems

by Martin Kleppmann

As a rule of thumb, LSM-trees are typically faster for writes, whereas B-trees are thought to be faster for reads