Metraipolis › archive › dc_338f45a7340d

Generalized DBLog: A Verified Contract for Interleaving Copied Rows with a Change Log — arXiv:2609.08160

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08160
License (as archived)
CC0-1.0
Archived
2026-10-16T13:07:31.995Z
SHA-256 of the archived text
bce69eafeed67e2ac7f432e41a3d93d7f83eb0a9de5d50ddbbbe1b2ac1192dee
Stable URL of this page
https://metraipolis.com/documento/dc_338f45a7340d

How to cite

Generalized DBLog: A Verified Contract for Interleaving Copied Rows with a Change Log — arXiv:2609.08160 — arXiv (en), https://arxiv.org/abs/2609.08160 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_338f45a7340d (Metraipolis archive dc_338f45a7340d, sha256 bce69eafeed67e2ac7f432e41a3d93d7f83eb0a9de5d50ddbbbe1b2ac1192dee)
BibTeX
@misc{dc338f45a7340d,
  title = {Generalized DBLog: A Verified Contract for Interleaving Copied Rows with a Change Log — arXiv:2609.08160},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08160},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_338f45a7340d; sha256 bce69eafeed67e2ac7f432e41a3d93d7f83eb0a9de5d50ddbbbe1b2ac1192dee},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08160. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Change-data capture (CDC) feeds downstream systems like caches, search indexes, and data warehouses from a database's log of committed row changes. When bootstrapping, adding a table, or repairing downstream data, a pipeline must also copy existing rows. Merging this copy with the active log introduces the copy-to-log handoff problem. Changes must not fall through a gap, and older copied state must not overwrite a newer logged update or resurrect a deleted row. DBLog, developed at Netflix, addressed this problem by reading tables in chunks and interleaving those reads with the live log. Watermarks identify the changes that overlap each read, and the log wins when a copied row is stale. Debezium and Flink CDC have since adapted this design. Earlier work proved that applying the original algorithm's copied rows and logged changes in their emitted order reconstructs the source's rows, including the effect of every logged insert, update, and delete processed. Generalized DBLog asks when the same result holds for variants of that design. We state the conditions the source and capture implementation must satisfy. Once copying and reconciliation are complete, we prove that the result holds across all selected tables and key ranges even when their rows were read at different times. A single database snapshot is not required for the copy. Further logged changes advance the reconstructed state one event at a time. We establish these guarantees for classic watermarking, Debezium's signal-table and read-only modes, Flink CDC's parallel chunks, reads and dumps tied to exact log positions, and engine-consistent backups whose log position lies within known bounds. The complete theory is machine-checked in Isabelle/HOL, its core independently verified in Lean 4, and the protocols are also examined by bounded model checking in TLA+.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-09 in cs.DC).
Categorie arXiv: Databases (cs.DB) ; Distributed, Parallel, and Cluster Computing (cs.DC); Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.08160 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T13:02:21.623Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).