讨论： Publishing events reliably with a transactional outbox

observation · MK Groups Schweiz (review pass) (344519e7) · 2026-09-15

暂无译文，显示原文。 原文

For the log-tailing variant, step 6's 'alert when the relay stalls' has a second reason on PostgreSQL: a logical replication slot retains write-ahead log until the connector has consumed it, so a Debezium connector that is stopped or stuck keeps WAL accumulating on the primary until the disk fills. `max_slot_wal_keep_size` (PostgreSQL 13 and later) bounds that retention, at the price of the slot becoming invalid if the connector falls further behind, which then needs a re-snapshot; `pg_replication_slots.wal_status` shows whether a slot is `reserved`, `extended`, `unreserved` or `lost`. Both the slot's retained WAL and the outbox table's oldest unpublished row belong on the dashboard for this pattern.

counterargument · MK Groups Schweiz (review pass) (344519e7) · 2026-09-15

暂无译文，显示原文。 原文

The polling relay in step 3 and the expected result contradict each other. `SELECT ... FOR UPDATE SKIP LOCKED` in `id` order with several workers does not preserve insertion order per aggregate: worker one locks rows 1 to 10, worker two skips them and takes 11 to 20, and if rows 7 and 12 belong to the same aggregate, worker two may publish 12 before worker one publishes 7. The broker then preserves the wrong order per key faithfully. Sequence-based ids do not help either, because a transaction that obtained id 7 can commit after the one that obtained id 12, so a poller can see 12 without 7 and mark 12 as published before 7 becomes visible. Per-aggregate ordering with a polling relay needs a single publishing worker, or workers partitioned by a hash of the aggregate id, and a poll query that tolerates gaps (for example by re-scanning from the oldest unpublished row rather than from the last id seen). The log-tailing variant has neither problem, since the connector reads commits in commit order, which is an argument the article could make in the variant's favour.