Tagged articles
local message table
13 articles · Page 1 of 1
A real-world postmortem of duplicate coupon deductions during a major promotion reveals how retries in local message tables cause duplicate execution; the article dissects four idempotency patterns, their trade-offs, and a layered defense architecture with a practical review checklist.
Architecture PatternsIdempotencydatabase transactions
0 likes · 24 min read

This article analyzes three production failures with local message tables in e-commerce systems — non-atomic writes losing messages, retry storms overwhelming databases, and missing idempotency causing duplicate operations — and provides a six-point production review checklist covering atomic writes, exponential backoff retries, idempotency keys, distributed scheduler locks, table archiving, and dead-letter alerting.
Dead Letter QueueIdempotencySeata
0 likes · 13 min read


liandkSep 30, 2026 · Backend Development
This article provides a comprehensive guide to distributed transactions in microservices, covering CAP/BASE theory, four major patterns (2PC, local message table, TCC, SAGA), eight common production faults with root causes and fixes, selection guidelines, a troubleshooting SOP, and high-availability standards.
2PCBASE theoryCAP theorem
0 likes · 19 min read

This article presents the local message table pattern as a lightweight, production-ready solution for achieving eventual consistency in microservice architectures, covering database schema design, transactional message persistence, scheduled retry mechanisms, idempotent consumption, and real-world incident resolution compared to heavier alternatives like Seata and TCC.
Database DesignIdempotencyMessage Queue
0 likes · 11 min read

This article presents a detailed design for a high‑concurrency (10‑100k QPS) distributed transaction solution that integrates RocketMQ transactional messages, an eBay‑style local message table, and XXL‑Job reconciliation to achieve eventual consistency while handling failures, retries, and data‑explosion challenges.
CAP theoremJavaMessage Queue
0 likes · 34 min read

This article examines the limitations of the CAP theorem in modern microservice architectures, introduces the BASE model for eventual consistency, and evaluates practical solutions such as write RPC retries, synchronous and transactional messaging, and local message tables to achieve reliable data consistency across distributed services.
BASE theoryCAP theoremDistributed Consistency
0 likes · 11 min read

Using a local message table, developers can break down distributed transactions into local database operations and asynchronous MQ messages, ensuring eventual consistency, simplifying implementation, and handling retries, while balancing advantages like simplicity and compatibility against drawbacks such as added maintenance and potential queue dependencies.
Message QueueTransaction Consistencybackend architecture
0 likes · 5 min read

This article explains the concept of a local message table, shows how it can be used to achieve reliable distributed transaction consistency with MQ, and provides complete MySQL DDL and Java service code along with a retry mechanism and analysis of failure scenarios.
JavaMySQLRocketMQ
0 likes · 9 min read


ITPUBDec 6, 2021 · Backend Development
The article explains why the naïve "insert‑then‑publish" pattern can cause data inconsistency in microservice architectures, analyzes failure scenarios, and presents a local message‑table solution that leverages database transactions to achieve eventual consistency while handling duplicate messages.
distributed transactioneventual consistencylocal message table
0 likes · 9 min read

This article explains the fundamentals of distributed transactions, introduces the reliable message eventual consistency approach, analyzes its challenges such as atomicity and message reliability, and presents two practical solutions—local message tables and RocketMQ transactional messages—along with their advantages and drawbacks.
Reliable MessagingRocketMQdistributed transactions
0 likes · 8 min read

This article examines common techniques for handling service call failures in micro‑service architectures—blocking retries, asynchronous queues, TCC compensation transactions, local message tables, and MQ transactions—detailing their implementations, pitfalls, and trade‑offs to achieve reliable data consistency.
Data ConsistencyMessage QueueTCC
0 likes · 16 min read

This article shares practical strategies for handling distributed transactions, idempotent operations, and asynchronous message ordering in microservice architectures, covering pitfalls of RPC inside transactions, compensation patterns, local message tables, and state‑driven messaging to achieve reliable consistency without sacrificing performance.
Idempotencycompensationlocal message table
0 likes · 25 min read


21CTOSep 29, 2017 · Databases
The article examines how to achieve data consistency in distributed internet systems by comparing strong and eventual consistency, detailing local database transactions, two‑phase commit protocols, rollback mechanisms, local message tables, and compensation strategies, and discusses their trade‑offs and suitable application scenarios.
Two-Phase Commitcompensationdistributed transactions
0 likes · 11 min read
