The article explains why a single order operation can involve multiple services and databases, introduces the challenges of distributed transactions, and compares three common solutions—Two‑Phase Commit, TCC, and Saga—detailing their mechanisms, strengths, weaknesses, and suitable scenarios.
The article explains why ACID guarantees break down in distributed systems, introduces the BASE and CAP trade‑offs, then details six concrete transaction solutions—2PC, 3PC, TCC, Saga, local message tables, and reliable messages—highlighting their processes, drawbacks, and a decision framework for selecting the right approach.
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.
This article explains why local transactions fail in micro‑service architectures, introduces the Two‑Phase Commit (2PC) protocol with its coordinator and participant roles, details each phase with examples, shows how XA and JTA implement 2PC in Java, and discusses its drawbacks and interview‑ready alternatives.
This article walks through ten essential MySQL InnoDB interview questions, covering why InnoDB uses B+ trees, MVCC isolation levels, two‑phase commit, gap locks, buffer‑pool LRU design, undo‑log mechanics, binlog formats, lock‑upgrade behavior, double‑write buffering, and the differences between clustered and non‑clustered indexes.
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.
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.
This article explains the fundamentals of distributed transactions, illustrates why they are essential for multi‑service operations such as e‑commerce order processing, and compares four major solutions—two‑phase commit, three‑phase commit, TCC, and message‑queue based eventual consistency—detailing their workflows, advantages, and drawbacks.
The article explains how to achieve transaction consistency in distributed internet systems by balancing CAP trade‑offs and presents common design approaches such as 2PC, 3PC, TCC, reliable message delivery, best‑effort notification, and database‑transaction plus compensation mechanisms.
This article explains the fundamentals of distributed transactions, covering ACID properties, the CAP theorem, two‑phase commit, TCC compensation, and a message‑queue based eventual consistency approach, while highlighting their advantages, drawbacks, and practical application scenarios.
The article explains why distributed transactions are inevitable in microservice architectures, outlines the challenges of data consistency, fault handling, and performance, and presents practical solutions such as message‑queue eventual consistency, two‑phase commit, Saga patterns, and tooling like Spring Cloud, Atomikos, and Narayana.
This article explains the fundamentals of ACID transactions, the challenges of multi‑data‑source operations, surveys common distributed‑transaction solutions such as 2PC, 3PC, TCC, transaction‑status tables and message‑queue based eventual consistency, and then details the implementation of Seata’s AT mode in a micro‑service e‑commerce scenario.
This article provides a comprehensive overview of mainstream distributed transaction solutions, explains the CAP theorem and consistency models, compares various approaches such as 2PC, 3PC, TCC, Saga, and demonstrates how to configure and use Seata's AT mode in a micro‑service environment.
This article introduces eight essential distributed‑transaction techniques—including 2PC, 3PC, TCC, Saga, distributed locks, local message tables, reliable message transactions, and best‑effort notifications—detailing their workflows, advantages, drawbacks, and suitable business scenarios to help engineers choose the right solution.
This article explains the principles of distributed transaction messages, comparing 2PC, TCC, and transactional messaging, and provides detailed walkthroughs of RocketMQ and Kafka implementations, including their two‑phase processes, broker handling, and source‑code insights for ensuring data consistency in asynchronous systems.
This article explains ACID properties of single‑node transactions, the challenges of multi‑data‑source operations, surveys common distributed‑transaction solutions such as 2PC, 3PC, TCC, status‑table and message‑queue approaches, and details the implementation of Seata's AT mode with lock and rollback mechanisms.
This article examines the challenges of maintaining data consistency across micro‑service boundaries, walks through real‑world payment and gifting scenarios, compares classic solutions such as 2PC, saga, TCC, local‑message tables and transaction messages, and finally recommends a pragmatic approach for building reliable distributed transaction mechanisms.
This article explains the fundamentals of database transactions, the ACID properties, and why distributed transactions are needed, then walks through the implementation details of redo/undo logs, local transactions, CAP and BASE theory, and evaluates five major distributed‑transaction solutions—2PC, TCC, local‑message tables, maximum‑effort notification, and Saga—with concrete examples, pros, and cons.
This article explains the concept of distributed transactions, compares common solutions such as 2PC, 3PC, TCC, and message‑based eventual consistency, and provides a detailed walkthrough of configuring and using the Seata middleware—including AT mode workflow, server and client setup, and real‑world testing—so developers can confidently implement reliable cross‑service transactions.
This article explains core distributed‑system concepts such as the CAP theorem, ACID and BASE transaction models, idempotent design, and various distributed transaction mechanisms including two‑phase and three‑phase commit, TCC/Saga compensation, message‑based transactions, and popular frameworks like JDTS and Seata.
This article explains the fundamentals of single‑ and multi‑data‑source transactions, surveys common distributed transaction models such as 2PC, 3PC, TCC, status‑table and message‑middleware approaches, and then details the implementation of Seata's AT mode with diagrams, code snippets, and lock handling.
This article explains consistency in distributed systems, distinguishing strong and eventual consistency, outlines the CAP and FLP impossibility theorems, and details common consensus mechanisms such as two‑phase commit, three‑phase commit, and the Paxos algorithm.
This article explains the concept of consistency in distributed systems, distinguishes strong and weak (eventual) consistency, outlines typical use cases and challenges, and reviews key protocols such as 2‑Phase Commit, 3‑Phase Commit, Paxos, and Raft, while referencing the FLP and CAP theorems.
This article explains the challenges of distributed transactions in micro‑service architectures and presents Seata's various solutions—including two‑phase commit, XA, AT, TCC, Saga and message‑based approaches—while covering fundamental concepts such as ACID, CAP and BASE.
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.
This article explains the challenges of distributed transactions in microservice architectures, compares two‑phase and three‑phase commit protocols, introduces Alibaba Seata's middleware and its AT mode, and walks through the complete execution flow with code examples and component diagrams.
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.
The article explains how Paxos can be generalized by defining its round number (rnd) over any partially ordered set, enabling both forced and non‑forced conflict exclusion mechanisms similar to 2PC, and showing how this expands Paxos’s applicability to multi‑dimensional transaction ordering and simplifies distributed database architectures.
This article explains the fundamentals of ACID, compares monolithic and distributed transaction models, and details various distributed transaction strategies—including 2PC, 3PC, TCC, local message tables, MQ transactions, max‑effort notifications, Saga, and Seata—highlighting their mechanisms, trade‑offs, and practical considerations.
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.
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.
This article explains the fundamentals of single‑source and multi‑source transactions, reviews common distributed‑transaction patterns such as 2PC, 3PC, TCC, transaction‑status tables and message‑queue based eventual consistency, and then details the implementation and isolation mechanisms of Seata’s AT mode for microservice architectures.
This article explains the fundamentals of distributed consistency, covering consistency levels, ACID and CAP principles, BASE theory, and practical protocols such as 2PC, 3PC, and TCC, while also discussing real‑world patterns like cache consistency and reliable messaging.
This article explains the challenges of distributed transactions in high‑concurrency systems, compares classic two‑phase commit (2PC) with modern message‑queue‑based reliable delivery, outlines their mechanisms, pros and cons, and provides interview‑ready insights and practical implementation tips for Java developers.
This article analyzes the challenges of distributed transactions in multi‑node systems and compares various solutions—including 2PC, 3PC, TCC, Saga, local message tables, and MQ‑based approaches—detailing their mechanisms, trade‑offs, and practical implementations with concrete examples from order and cart services.
This article explains the fundamentals of distributed transactions, covering ACID, CAP and BASE theories, and reviews various consistency solutions such as two‑phase commit, three‑phase commit, TCC, local message tables, MQ approaches and the Seata framework, highlighting their advantages and drawbacks.
This article explains the fundamentals of distributed transactions, the ACID properties, various consistency models (strong, weak, eventual), sharding strategies (vertical and horizontal), the CAP and BASE theories, and the practical implementations of two‑phase, three‑phase, and TCC commit protocols, highlighting their advantages and drawbacks.
This article explains the ACID properties of database transactions, distinguishes between single‑node and distributed transactions, describes the two‑phase and three‑phase commit protocols, discusses transaction states, fault tolerance, and recovery mechanisms, and shows how replication and consensus can provide high availability for transaction processing.
This article explains the core principles and a range of consistency protocols—including CAP, ACID, BASE, 2PC, 3PC, Paxos, Raft, Gossip, NWR, Quorum, and Lease—detailing their roles, mechanisms, trade‑offs, and typical use cases in distributed systems.
This article explains the fundamentals of transactions, compares monolithic and distributed transaction models, and walks through various distributed transaction solutions such as 2PC, 3PC, TCC, local message tables, MQ transactions, max‑effort notifications, Saga, and Seata, highlighting their trade‑offs and practical considerations.
This article explains the evolution from centralized to distributed architectures, the role of Zookeeper in solving consistency problems, the mechanics and drawbacks of 2‑phase and 3‑phase commits, and key consensus algorithms such as Paxos, Raft, ZAB, as well as CAP and BASE theories that guide practical system design.
The article explains consistency concepts in distributed systems—including strong and weak (eventual) consistency, CAP and FLP theorems, and key protocols such as 2PC, 3PC, and Paxos—detailing their mechanisms, advantages, and challenges.
This article explains distributed transactions, covering ACID properties, consistency models, sharding strategies, the CAP and BASE principles, and detailed mechanisms such as two‑phase commit, three‑phase commit, and the TCC pattern, illustrating how to maintain data integrity across multiple databases.
This article provides an in‑depth overview of mainstream distributed transaction solutions—including 2PC, 3PC, TCC, Saga, local message tables, and MQ‑based transactions—explains the theoretical foundations such as CAP and BASE, and offers a step‑by‑step tutorial for setting up Seata’s AT mode with Spring Cloud, Nacos, and MySQL.
To handle distributed transactions in micro‑service systems, the article compares 2PC, TCC, maximum‑effort notification and reliable messaging, then shows how Spring Boot can use RabbitMQ delayed queues—leveraging dead‑letter exchanges, TTL and routing—to achieve eventual consistency for order‑payment workflows.
The article explains the concept of distributed transactions, why they are needed in micro‑service architectures, presents the CAP and BASE theories, and reviews major solutions such as two‑phase commit, three‑phase commit, TCC, local message tables, message‑based transactions, max‑effort notifications, Sagas and the Seata framework.
This article explores the challenges of distributed transactions, explains database ACID fundamentals, introduces CAP and BASE theories, compares solutions such as two‑phase commit, TCC, local message tables, MQ transactional messages, and the Sagas model, and presents the open‑source .NET CAP framework with its features and implementation details.
This article explains the principles, workflows, advantages and drawbacks of various distributed transaction solutions—including XA two‑phase commit, Java Transaction API, chained transaction managers, three‑phase commit, TCC, reliable message‑based eventual consistency and maximum‑effort notification—while comparing ACID and BASE theories for modern backend systems.
This article examines distributed transaction protocols—including XA two‑phase commit, JTA, three‑phase commit, TCC, and message‑based eventual consistency—detailing their mechanisms, advantages, drawbacks, and practical usage scenarios in modern backend systems.
This article explains the fundamentals of distributed system consistency, covering weak and strong consistency, the CAP theorem, ACID vs BASE, and detailed overviews of protocols such as 2PC, 3PC, Paxos, Raft, Gossip, NWR, Quorum, and Lease mechanisms.
This article explains the importance of distributed transactions in micro‑service architectures, reviews ACID properties, compares various solutions such as 2PC/3PC, XA, local message tables, transactional messages, TCC, Saga, and introduces the Seata framework with its AT, TCC, and Saga modes, while also discussing consistency versus consensus with Paxos.
This article explores the fundamentals of distributed transactions in microservice architectures, detailing ACID properties, classic protocols like 2PC/3PC and XA, modern patterns such as TCC, Saga, local message tables, transaction messages, and the Seata framework, while comparing their trade‑offs with Paxos consensus.
This article explains YugabyteDB's two‑layer logical architecture, its tablet‑based distributed storage built on Raft groups, the RocksDB‑backed local DocDB, and how it implements distributed transactions using Hybrid Logical Clocks, two‑phase commit, and MVCC, while comparing it with TiDB, CockroachDB and other rivals.
This article explains the challenges of distributed transactions in micro‑service architectures and reviews major solutions such as 2PC/3PC, XA, TCC, Saga, local message tables, transactional messages, and the Seata framework, comparing their consistency, performance, and implementation trade‑offs.
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.
This article explains why data consistency is critical in microservice architectures, introduces the Saga pattern and its execution and recovery mechanisms, compares it with two‑phase commit and TCC, and presents a centralized Saga design using ServiceComb for reliable distributed transactions.
This article explains the challenges of distributed systems such as node failures and network anomalies, then introduces the CAP theorem, BASE theory, two‑phase and three‑phase commit protocols, and details consensus algorithms including Paxos, Raft, ZAB, and Amazon Dynamo's NWR model, highlighting their trade‑offs and practical usage.
This article explains the concept of consistency in distributed systems, distinguishes strong and weak consistency, outlines common use cases and challenges, introduces the CAP theorem, and details several consensus protocols including 2‑phase commit, 3‑phase commit, and the Paxos algorithm.
This article explains the limitations of single‑database transactions in multi‑data‑source micro‑service scenarios, reviews common distributed‑transaction models such as 2PC, 3PC, TCC, status‑table and message‑queue based final consistency, and details the implementation of Seata's AT mode for achieving global ACID properties.
This article explains how to use Apache RocketMQ's 2PC-based transactional messaging feature, covering the overall workflow, key concepts such as half messages and compensation, and providing complete Java/Spring Boot code examples for producers, transaction listeners, and consumers.
This article explains the fundamentals of distributed consistency, covering weak and strong consistency, the CAP theorem, ACID and BASE models, and detailed overviews of 2PC, 3PC, Paxos, Raft, Gossip, NWR, Quorum, and Lease mechanisms, highlighting their trade‑offs and practical use cases.
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.
This article explains the fundamentals of database transactions, the ACID properties, how they differ in distributed environments, and details two‑phase and three‑phase commit protocols while offering personal insights on the challenges of implementing distributed transactions.
This article, excerpted from the book "Software Architecture Design: Integrating Large‑Scale Website Technical and Business Architecture," systematically presents seven practical solutions—including two eventual‑consistency approaches, two compromise methods, TCC, state‑machine retry with idempotence, and reconciliation—to address the pervasive challenges of distributed transactions in micro‑service systems.
The article explains how the CAP theorem forces trade‑offs between consistency, availability and partition tolerance, then surveys distributed commit protocols (2PC, 3PC) and consensus algorithms (Paxos, Raft, Zookeeper’s ZAB), and shows their practical use in systems such as ZanKV that combine Raft with RocksDB for strongly consistent, fault‑tolerant key‑value storage.
This article explains the ACID properties of transactions, contrasts them with the CAP theorem and BASE model, and then explores practical distributed‑transaction solutions such as two‑phase commit, TCC, and reliable asynchronous messaging, including their advantages, drawbacks, and implementation tips.
This article explains the challenges of distributed transactions in microservice architectures, covering database transaction fundamentals, the CAP and BASE theories, and evaluates various solutions such as 2PC, TCC, local message tables, MQ transactional messages, Sagas, and introduces the open‑source .NET CAP framework.
This article explains MySQL's XA distributed transaction mechanism, covering its 2‑phase commit process, the roles of resource and transaction managers, internal vs. external XA, essential SQL syntax, practical code examples, common pitfalls, performance considerations, and reference resources.
This article explains the fundamentals of distributed transactions, covering ACID and CAP theory, the BASE model, and compares common solutions such as two‑phase commit, TCC, local message tables, MQ transactional messages, and Sagas, while also introducing the open‑source .NET CAP framework with its features and limitations.
This article explains the fundamentals of distributed transactions, why they arise in modern micro‑service architectures, outlines the ACID properties, presents typical use cases such as payments and order processing, and compares common implementation approaches like 2PC, message‑based eventual consistency, and TCC.
This article explains the fundamentals of database transactions, the ACID properties, and how they are implemented, then delves into distributed transaction challenges and solutions such as two‑phase and three‑phase commit, XA, Saga patterns, choreography vs. orchestration, and message‑based transaction mechanisms.
This article explains the fundamentals of database transactions, the ACID properties, and how they are implemented, then delves into distributed transaction challenges and solutions such as two‑phase commit, three‑phase commit, XA, and Saga patterns, highlighting their trade‑offs and practical usage.
This article explains the fundamentals of database transactions, the ACID properties, implementation details such as transaction logs and concurrency control, and explores distributed transaction solutions including two‑phase and three‑phase commit, XA, Saga patterns, and message‑based approaches.
This article explains the fundamentals of database transactions, the ACID properties, the challenges of distributed transactions, and compares various solutions such as 2PC, TCC, local message tables, MQ transactions, and Saga, helping readers choose appropriate approaches based on consistency and availability requirements.
This article explains the fundamentals of database transactions, the ACID properties, and how they are implemented in relational systems before exploring distributed transaction challenges and solutions such as 2PC, 3PC, TCC, and message‑based approaches.
This article explains the fundamentals of relational database transactions, the ACID properties, and various distributed transaction protocols such as 2PC, 3PC, TCC, message‑based approaches, and 1PC, while discussing their advantages, drawbacks, and practical considerations.
This article clarifies core concepts such as transaction compensation, CAP theorem, idempotency, and BASE, compares rigid ACID‑based transactions with flexible BASE‑based approaches, and provides best‑practice guidance for choosing and implementing 2PC, TCC, and asynchronous assurance patterns in distributed systems.
This article explores the challenges of distributed transactions in microservice architectures, explains consistency theories like CAP and BASE, compares classic 2PC with eBay's event‑queue approach, TCC compensation, and cache‑based eventual consistency, and offers practical guidance for choosing the right solution.
This article explains the challenges of consistency in distributed systems, introduces the CAP theorem and ACID properties, describes common distributed transaction techniques such as local message tables, transactional message middleware like RocketMQ, and details the two‑phase and three‑phase commit protocols with their advantages and drawbacks.
This article explains distributed system fundamentals—CAP theorem, ACID properties, consistency models, and how 2PC and 3PC protocols, along with message‑middleware solutions like RocketMQ, address the challenges of achieving reliable complex distributed transactions.
This article explains the core concepts of distributed system consistency—including the CAP theorem, ACID properties, various distributed transaction techniques, and the two‑phase and three‑phase commit protocols—while illustrating practical implementations with message queues and local message tables.
This article explains the importance of data storage, describes single‑node storage engines and data models, outlines transaction and concurrency control, and covers distributed storage principles, CAP and FLP theorems, 2PC and Paxos protocols, as well as redundancy, backup, and failover mechanisms.
