B-Tree

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.

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.

Diagram comparing LSM tree levels with a B‑tree node hierarchy.

Why LSM Trees Outperform B-Trees for Write Heavy Workloads

The article explains the fundamental design of LSM trees, contrasts them with B‑trees for write‑intensive scenarios, and outlines when each structure shines.

Illustration of an LSM tree merging levels of data files.

Why LSM Trees Outperform B‑Trees for Write‑Intensive Workloads

LSM trees turn random writes into sequential appends, dramatically boosting write performance over B‑trees. Learn the mechanics behind compaction, bloom filters, and real‑world adoption.

Diagram comparing LSM and B‑Tree write paths.

Why Log Structured Merge Trees Outperform B Trees for Writes

An in‑depth look at why LSM trees beat B‑trees on writes, covering architecture, trade‑offs, and practical implications.