Why B‑Trees Outperform LSM Trees for Read‑Heavy Workloads
A deep dive into the structural differences that make B‑trees superior for read‑intensive scenarios, backed by benchmarks and real‑world engineering insights.
Posts
Why Copy-on-Write B-Trees Improve Database Concurrency Control
Copy-on-Write B‑Trees provide immutable snapshots for readers while writers work on new nodes, enabling high concurrency with minimal blocking.
How Copy-on-Write Optimizes Linux Process Creation
Copy‑on‑write lets the kernel clone a process without copying its memory pages, deferring duplication until a write occurs, which dramatically speeds up fork.
Optimizing Write Throughput with Log-Structured Merge Trees
A deep dive into LSM‑tree internals, compaction strategies, and configuration knobs that let you squeeze maximum write performance from modern storage engines.
Why Copy-on-Write B-Trees Accelerate Database Snapshots
This article explains how copy‑on‑write B‑trees work, why they speed up database snapshots, and what trade‑offs developers should consider.