Performance

Illustration of zero-copy data path in a network driver.

Zero-Copy Deserialization Techniques for High Throughput Network Drivers

Learn how zero-copy deserialization eliminates data copies in high‑speed network drivers, with practical code patterns and performance benchmarks.

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 memory pages being shared and duplicated on write.

Why Copy on Write Accelerates Fast Process Cloning

COW lets the OS clone a process in microseconds by postponing actual copying, a technique that underpins containers, virtualization, and high‑performance servers.

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.

Diagram of a B‑tree node being split with copy‑on‑write semantics.

Why Copy-on-Write B-Trees Improve Database Concurrency Performance

This article explains how copy‑on‑write (COW) B‑trees work, why they improve concurrency, and what trade‑offs they introduce for modern database engines.