// TODO: I’m martinuke0

Welcome to my corner of the internet. This website is a personal blog which I use as a platform to document my learning journey and showcase it for the world to see.
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 illustrating shared memory pages before and after copy-on-write.

Why Copy-on-Write Improves Memory Efficiency in Linux Kernels

Learn how Linux’s copy‑on‑write mechanism shares memory pages, cuts RAM consumption, and reduces page‑fault costs without sacrificing security.

May 15, 2026 · 7 min · 1388 words · martinuke0
Illustration of memory pages being shared and duplicated on write.

How Copy on Write Semantics Optimize Memory Management

Copy‑on‑write lets programs share data until it changes, cutting memory use and speeding up operations.

May 15, 2026 · 8 min · 1530 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