Illustration of a B‑Tree node being duplicated on an SSD.

Why Copy-on-Write B-Trees Fragment Your SSD Storage

Copy‑on‑Write B‑Trees improve database performance but introduce write‑amplification that fragments SSDs; this post explains the mechanics and mitigation strategies.

May 16, 2026 · 7 min · 1314 words · martinuke0
Diagram of a B‑Tree node perfectly aligned with CPU cache lines.

Reclaiming Performance via Cache‑Aware B‑Tree Alignment

A deep dive into cache‑aware B‑Tree alignment, covering theory, practical implementation, and real‑world impact on database and filesystem performance.

May 15, 2026 · 10 min · 2052 words · martinuke0
Diagram comparing LSM tree layers with B‑tree nodes.

Why Log Structured Merge Trees Outperform B‑Trees for Writes

LSM trees batch writes into immutable files, avoiding costly in‑place updates that B‑trees require. This post explains the mechanics behind their superior write performance.

May 15, 2026 · 7 min · 1328 words · martinuke0
Diagram illustrating shared memory pages before and after a write.

How Copy‑On‑Write Optimization Reduces Database Memory Overhead

A deep dive into copy‑on‑write (COW) techniques shows how they cut database memory consumption, enable efficient snapshots, and boost concurrent workloads.

May 15, 2026 · 9 min · 1727 words · martinuke0
Diagram of a B-Tree node being duplicated on write.

Why Copy on Write B-Trees Improve Database Concurrency

Copy‑on‑write B‑trees enable high‑concurrency database operations by allowing readers to see a stable snapshot while writers modify a new version of the tree. The article explains the underlying mechanics, performance benefits, and practical implementation tips.

May 15, 2026 · 8 min · 1524 words · martinuke0
Feedback