// 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.
Illustration of a log file streaming into persistent storage.

Designing Write-Ahead Logs for Zero Data Loss Recovery

A deep dive into WAL design strategies that achieve zero data loss, with practical patterns and validation steps for modern databases.

May 14, 2026 · 8 min · 1527 words · martinuke0
Illustration comparing B‑Tree nodes and LSM Tree levels.

Memory Management Tradeoffs: B‑Trees vs. LSM Trees

A deep dive into the memory management trade‑offs between B‑Trees and LSM Trees, with practical guidance for database developers.

May 14, 2026 · 8 min · 1492 words · martinuke0
Illustration of two threads exchanging data atomically.

Solving Data Races with Lock‑Free Atomic Compare‑and‑Swap

A deep dive into lock‑free programming using atomic compare‑and‑swap, covering theory, implementation patterns, and real‑world best practices.

May 14, 2026 · 8 min · 1669 words · martinuke0
Diagram of memory pages being shared and duplicated on write.

Why Copy on Write Improves Memory Efficiency in Linux

Copy‑on‑Write (CoW) lets Linux share pages until they’re modified, dramatically cutting memory footprints for forks, containers, and snapshots.

May 14, 2026 · 9 min · 1836 words · martinuke0
Diagram comparing LSM tree layers with B‑tree nodes.

Why Log-Structured Merge Trees Outperform B-Trees for Write Throughput

Explore how LSM trees boost write performance compared to B‑trees, the mechanics behind their design, and the trade‑offs involved.

May 14, 2026 · 7 min · 1447 words · martinuke0
Feedback