An instantaneous, space for time copy of a logical volume

LVM snapshots capture a block device in time

An LVM snapshot is neither a copy nor a reflink: it is a fixed-size copy-on-write exception store attached to an origin logical volume. lvcreate -s -L 5G -n snap vg/data allocates 5 GiB from the volume group, and the device-mapper snapshot target records the original contents of each origin chunk the first time it is written. Creation is instant whatever the origin’s size, because nothing is copied. ...

April 10, 2028 · 5 min · XB Field Notes
Instant filesystem state captures that restore fast and cost little

ZFS snapshots give the filesystem a rewind button

A ZFS snapshot is a name attached to a dataset’s block tree at one transaction group. Nothing is copied, nothing is quiesced, and the cost is a few metadata blocks: zfs snapshot tank/data@before-upgrade returns before the shell prompt redraws. Because ZFS never overwrites a live block in place, the old tree stays valid on disk until the last reference to it goes away, and the snapshot is that reference. ...

March 21, 2028 · 5 min · XB Field Notes
Cover for metric label cardinality, with observe, decide and act steps.

High-cardinality labels increase stored series before anyone queries them

A Prometheus series is identified by a metric name and its complete label set. Adding customer or request identity to a counter can create many series even when every dashboard immediately sums those identities away. Query aggregation changes the returned result; it does not remove the raw series that were ingested. Storage and ingestion costs arise before a user opens the dashboard. ...

January 10, 2028 · 6 min · XB Field Notes
A database point where dirty data meets the disk cleanly.

A checkpoint flushes dirty buffers to disk

A checkpoint establishes a starting point for PostgreSQL crash recovery. It synchronizes the data-file changes required for that checkpoint and records the corresponding recovery information. WAL must reach durable storage before dependent data pages are written. This ordering allows committed work to survive without forcing every modified table page to disk at each commit, while recovery can replay later changes when necessary. ...

January 6, 2028 · 4 min · XB Field Notes
A logical parent routes rows to physical partitions with separate indexes and lifecycles.

Partitioning splits one table into many pieces that look like one

Declarative partitioning lets PostgreSQL expose one logical table while storing its rows in separate partitions. The parent routes writes and provides a common query target; the physical partitions hold the data. Its strongest benefits often concern lifecycle management and selective access, but the choice also affects keys, query shape, and operational locking. ...

December 23, 2027 · 5 min · XB Field Notes
Redis AOF synchronization policies and recovery from its base and incremental files.

Redis append-only log trades speed for durability

An append-only file records Redis mutations for recovery, but choosing AOF is not the same as promising that no acknowledged write can ever disappear. Durability depends on the fsync policy, effective configuration, storage behavior, and which failure you mean. Start with a recovery objective rather than the reassuring word “log.” ...

November 17, 2027 · 6 min · XB Field Notes
A point-in-time view that shares unchanged data with its source until modification.

Btrfs snapshots are copy-on-write, not copies

A btrfs snapshot is not a copy of anything. btrfs subvolume snapshot creates a new subvolume whose root points at the same extent tree as the source, so every extent the two share is referenced twice and stored once. Creation is a metadata operation measured in milliseconds whether the subvolume holds a gigabyte or ten terabytes. ...

November 14, 2027 · 5 min · XB Field Notes
An LRU cache moves accessed entries to the recent end and evicts from the old end.

An LRU cache evicts the least recently used entry

LRU chooses a victim by recency, not by popularity, age, or business importance. When a bounded cache needs space, an exact least-recently-used policy removes the entry whose last qualifying access occurred longest ago. That rule can exploit temporal locality, but it neither guarantees useful hits nor keeps cached data fresh. ...

November 12, 2027 · 5 min · XB Field Notes