B-Trees

Diagram of a B‑Tree with highlighted copy‑on‑write nodes.

Why Copy-on-Write B-Trees Accelerate Database Snapshots

Learn how copy‑on‑write B‑trees work, why they make snapshots cheap, and what trade‑offs you should weigh when choosing this storage engine.

Illustration comparing B‑Tree nodes and LSM Tree levels.

Memory Management Tradeoffs: B‑Trees vs. LSM Trees

A deep dive into the memory management trade‑offs between B‑Trees and LSM Trees, with practical guidance for database developers.

Illustration of a Log‑Structured Merge tree versus a B‑tree.

Why LSM Trees Outperform B-Trees for Write Heavy Workloads

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.

Diagram of a B‑tree node split during a copy‑on‑write operation.

Why Copy-on-Write B-Trees Outperform Traditional In-Place Updates

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.

Illustration of a B‑tree node being duplicated for a snapshot.

Why Copy-on-Write B-Trees Enable Atomic Database Snapshots

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