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 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 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 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.
This article explains the principles, advantages, and drawbacks of various distributed transaction solutions—including XA two‑phase commit, three‑phase commit, TCC, Saga, and message‑based eventual consistency—while showing how they are implemented in Java/Spring environments and when each should be used.
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 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 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 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 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 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.