Databases

An in‑depth comparison of LSM trees and B‑trees that explains why LSM excels on write‑heavy workloads, backed by real‑world examples and practical takeaways.

LSM trees excel in write‑heavy scenarios by batching writes and deferring compaction, while B‑trees suffer from random I/O. This post breaks down the mechanisms that give LSM trees their edge.

An in‑depth look at why copy‑on‑write B‑trees beat traditional in‑place updates, covering algorithmic details, performance metrics, and practical deployment tips.

Copy‑on‑write B‑trees let databases capture point‑in‑time snapshots without blocking writers, enabling true atomic reads and fast recovery.

Copy‑on‑write B‑trees let databases take point‑in‑time snapshots instantly, without blocking writes. This post explains the mechanics, trade‑offs, and real‑world implementations.