Tagged articles
Reliable Messaging
13 articles · Page 1 of 1
This Day 60 case study walks through a regional medical appointment platform that has been broken into micro‑services on a container cluster, asking you to select and justify service discovery, TCC/Saga, reliable messaging, Kubernetes, Service Mesh and observability measures, and to explain their benefits and trade‑offs.
KubernetesObservabilityReliable Messaging
0 likes · 36 min read

The article reviews the most common distributed transaction patterns—TCC, Saga, reliable messaging, 2PC, and Seata's AT mode—explaining their principles, ideal use‑cases, implementation details, and trade‑offs so architects can select the most suitable solution for their microservice systems.
2PCReliable MessagingSaga
0 likes · 15 min read

This comprehensive guide explains the core concepts of transactions, local and distributed transaction models, the CAP theorem, various distributed transaction solutions such as 2PC, TCC, reliable messaging, and maximum effort notifications, and compares their trade‑offs for modern microservice architectures.
2PCCAP theoremReliable Messaging
0 likes · 44 min read

This article explains how to handle massive concurrent requests in a group‑buy scenario by using Redis distributed locks to avoid database overselling, MQ delayed messages for timeout processing, and a local outbox table to guarantee reliable cross‑service notifications.
Distributed LockMessage QueueReliable Messaging
0 likes · 8 min read

This article explains why distributed transactions are difficult in micro‑service architectures, illustrates the problem with an e‑commerce order example, and presents seven practical solutions—including 2PC, 3PC, TCC, reliable messaging, best‑effort notification, Seata AT, and eBay's event‑queue—along with guidance on selecting the right approach for different consistency and performance requirements.
2PCReliable MessagingSeata
0 likes · 12 min read

This article explains the basic concepts of transactions, distinguishes local and distributed transactions, introduces the CAP and BASE theories, and compares major distributed‑transaction solutions such as 2PC, XA, Seata, TCC, reliable‑messaging and maximum‑effort notification, highlighting their trade‑offs.
2PCBASE theoryBackend
0 likes · 40 min read

This article provides a comprehensive technical overview of distributed transactions, covering basic concepts, local and distributed transaction models, the CAP and BASE theories, two‑phase commit (2PC), XA and Seata implementations, TCC patterns, reliable‑message consistency with RocketMQ, and maximum‑effort notification approaches, along with a comparative analysis of each solution.
2PCCAP theoremReliable Messaging
0 likes · 42 min read

This article explains the fundamentals of transactions, the challenges of distributed transactions, introduces ACID, CAP and BASE theories, and compares practical solutions such as two‑phase commit, TCC, Seata, reliable message‑based eventual consistency, and maximum‑effort notification, concluding with a comparative analysis of their trade‑offs.
2PCBASE theoryCAP theorem
0 likes · 42 min read


ITPUBOct 29, 2022 · Databases
This article explains the fundamentals of local transactions, highlights their advantages and limitations, introduces the challenges of distributed transactions across services and databases, and reviews common solutions such as 2PC, reliable messaging, TCC, and max‑effort notification.
2PCACIDReliable Messaging
0 likes · 10 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 analyzes the challenges of distributed transactions in microservice architectures, explains ACID, CAP and BASE theories, compares consistency models, and evaluates practical solutions such as two‑phase commit, local message tables, TCC, and reliable messaging with code examples and implementation details.
2PCBASE theoryCAP theorem
0 likes · 26 min read

This article explores the fundamentals of distributed transactions, comparing traditional two‑phase commit with flexible approaches like reliable‑message eventual consistency, TCC, and best‑effort notification, and provides detailed design patterns, implementation steps, and trade‑offs for building robust backend systems.
2PCBackendReliable Messaging
0 likes · 19 min read

This article explains how to design and implement a reliable message service that ensures atomicity between upstream business transactions and downstream message delivery, using status management, callbacks, and scheduled tasks to achieve eventual consistency in distributed systems.
Message QueueReliable Messagingdistributed transactions
0 likes · 9 min read
