Tag
data-migration
- Aug 14, 2026 Verifying a Backfill with Range Checksums Instead of Full Comparison How partitioning a dataset into key ranges and comparing per-range digests localises a skipped or double-written record, and why the digest must be order-independent. distributed systems
- Feb 1, 2026 Switching the Write Path: Cutover, Rollback, and the Point of No Return How to move writes to a replacement store without a window of two writers, what rollback actually requires after new-only data exists, and how to decide when reversal stops being possible. software architecture
- Jun 19, 2025 Rolling Back a Change That Already Mutated State Why reverting a binary does not revert its writes, which mutations admit a compensating action, and how to decide before deployment whether a rollback path exists at all. distributed systems
- Mar 19, 2025 Resumable Backfills: Watermarks, Chunk Boundaries, and Gap-Free Progress How a long-running backfill records where it stopped, why the watermark must advance over a total order rather than a clock, and what idempotent chunks cost. distributed systems
- Apr 5, 2024 Backfilling a New Store While the Old One Still Takes Writes How to copy historical rows into a replacement without a consistent cut, how keyset pagination and version guards handle concurrent updates, and what a reconciliation pass can and cannot prove. software architecture