0 views collected around this technical thread.
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 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 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 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 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 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 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 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 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.