Data 0/11

Lesson 4 of 11

Storage engines

Compare how B-trees and LSM trees store updates, and why databases use a write-ahead log.

1,584 words · 8 min read Ultra Premium Useful background: Indexes, Latency numbers

In this lesson

  1. Storage engines
  2. The B-tree side
  3. Build an LSM tree
  4. Where LSM trees pay
  5. B-tree or LSM tree
  6. Row and column stores
  7. What stays true
  8. Common mistakes
  9. Related topics and practice

Ultra Premium

Unlock this lesson

Ultra Premium opens the 11 premium lessons in Data, along with the rest of WhiteBox's premium lessons and problems.

Not ready yet? Read the free lesson: Backpressure