This article explains the core principles of distributed consistency, covering CAP, ACID, BASE, and detailed walkthroughs of 2PC, 3PC, Paxos, Raft, Gossip, NWR, Quorum, and Lease mechanisms, highlighting their trade‑offs, failure scenarios, and practical usage in modern systems.
This article introduces the concept and components of database systems, classifies databases into relational, NoSQL, NewSQL and multi‑model types, explains the CAP theorem and its impact on consistency versus availability, and outlines current market trends and future directions in the database industry.
The article explains the origins of the CAP theorem, defines its three core properties, illustrates why a distributed system can satisfy at most two of them, discusses practical workarounds such as eventual consistency, and provides references for further study.
This article examines Spring Cloud’s four major service‑registry options—Eureka, Zookeeper, Consul, and Nacos—detailing their architectures, CAP characteristics, health‑check mechanisms, load‑balancing strategies, and integration features to help developers choose the most suitable solution for microservice governance.
This article explains high availability fundamentals, defines availability, outlines design targets, presents common metrics such as MTBF, MTTR, MTTF, SA, RPO, RTO, discusses CAP theory, essential design elements, and answers practical Q&A on cost, architecture, fault tolerance, testing, and implementation guidance.
This article provides a comprehensive overview of distributed system fundamentals, covering node models, replica concepts, various consistency levels, data distribution strategies, lease-based caching, quorum mechanisms, two‑phase commit, MVCC, Paxos consensus, and the CAP theorem, illustrating each with practical examples and diagrams.
This article explains how to implement a true multi‑region active‑active architecture by enabling bidirectional data synchronization among three or more data centers, covering CAP trade‑offs, distributed ID generation algorithms, center closure strategies, final consistency mechanisms, and a disaster‑recovery design.
From a simple CRUD application to a robust distributed architecture, this article explains why vertical scaling hits limits, how horizontal scaling and system partitioning work, the goals of transparency, scalability and reliability, and key concepts such as sharding, load balancing, CAP and BASE theories.
This article explains why distributed theory and algorithms are crucial for architects, outlines the four foundational theories and eight key protocols, discusses their four evaluation dimensions, and provides a step‑by‑step learning roadmap illustrated with stories and practical examples.
This article explains the fundamentals of distributed systems, covering why they arise, vertical and horizontal scaling, system splitting, sharding and partitioning strategies, load balancing, replication, the CAP theorem, and the BASE model, all illustrated with practical examples and code snippets.
This article provides a comprehensive technical guide to distributed transactions, covering ACID fundamentals, consistency models, sharding techniques, CAP and BASE theories, and detailed implementations of two‑phase, three‑phase, and TCC protocols, while highlighting their advantages, limitations, and practical considerations.
From CAP and BASE trade‑offs to the rigorous Paxos consensus and the more approachable Raft protocol, this article explains how modern distributed systems achieve consistency despite partitions, failures, and latency, detailing roles, phases, and safety guarantees that underpin reliable micro‑service architectures.
This article explains how Ant Financial’s payment system grew from 20,000 transactions per minute in 2010 to 540,000 TPS in 2019 by adopting logical data centers (LDC), unitized architecture (RZone, GZone, CZone), OceanBase’s Paxos‑based consensus, and sophisticated traffic steering and disaster‑recovery strategies.
This article dissects Alipay's massive Double‑11 payment surge, explaining how its Logical Data Center (LDC) and unit‑based architecture—RZone, GZone, and CZone—scale to hundreds of thousands of transactions per second, manage traffic routing, implement disaster‑recovery, and navigate the CAP theorem using OceanBase and Paxos.
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 provides a comprehensive overview of distributed system fundamentals, covering core concepts such as nodes, replicas, consistency models, data distribution strategies, lease and quorum mechanisms, two‑phase commit, MVCC, Paxos, and the CAP theorem, along with practical considerations for designing robust, scalable services.
This article provides a comprehensive overview of distributed system fundamentals, covering system models, replica concepts, consistency levels, performance metrics, data distribution strategies, basic replica protocols, lease mechanisms, quorum, logging, MVCC, Paxos, and the CAP theorem.
This article explains how 58 Recruitment’s ETX framework applies CAP and BASE theories, along with log‑first and TCC patterns, to achieve distributed eventual consistency and high availability for large‑scale transaction processing in backend systems.
This article explains how Ant Financial’s logical data center (LDC) architecture uses unitization, database sharding, and CAP‑aware design—including RZone, GZone, and CZone—to achieve tens of millions of TPS during Double‑11, while providing multi‑active disaster recovery and high availability.
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.
The article compares Eureka and Zookeeper as service registry solutions, explaining how Eureka follows an AP model with high availability and eventual consistency, while Zookeeper adopts a CP model prioritizing strong consistency, and discusses their suitable scenarios, limitations, and design considerations for distributed systems.
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 distributed consistency, covering the CAP theorem, BASE model, two‑phase and three‑phase commit protocols, Paxos and Raft consensus algorithms, Zookeeper’s ZAB protocol, and Amazon Dynamo’s NWR model with vector clocks for conflict resolution.
This article analyzes the massive traffic handling of Alipay during Double 11, explaining the LDC (Logical Data Center) unit‑based design, the RZone‑GZone‑CZone hierarchy, traffic steering, disaster‑recovery mechanisms, and how OceanBase and Paxos enable CAP compliance for ultra‑high‑availability payments.
This article explains how Ant Financial’s logical data center (LDC) architecture, based on user‑sharded RZones, GZones, and CZones, combined with OceanBase’s Paxos‑based consensus, enables massive horizontal scaling, high availability, and disaster‑tolerant processing of over half a million payment transactions per second during Double‑11.
The article explains high availability as a source of system complexity, describing how redundancy, hardware and software failures, external disasters, and state‑decision mechanisms such as dictatorial, negotiated, and democratic approaches affect both compute and storage layers, and discusses trade‑offs like the CAP theorem.
This article explains the role of a service registry in micro‑service architectures, introduces the CAP theorem, outlines three main registration approaches, and compares popular solutions such as Eureka, Consul, Zookeeper, and Nacos, highlighting their consistency, availability, and operational considerations.
The article explains how Ant Financial’s Logical Data Center (LDC) and unit‑based architecture, combined with sharding, CAP analysis, and OceanBase’s Paxos‑based consensus, enable the payment platform to sustain tens of millions of transactions per second during Double‑11 events while ensuring high availability and disaster recovery.
This article uses a relatable memory‑service scenario to illustrate the CAP theorem, explaining how consistency, availability, and partition tolerance cannot all be achieved simultaneously in distributed systems and exploring practical trade‑offs through successive design attempts.
This article explains the fundamentals of distributed systems, covering the CAP and BASE theorems, caching strategies, message queues, database choices, JVM optimization, and practical architectural improvements applied to New Oriental's mobile app to enhance availability and performance.
This article systematically explains the fundamental concepts and typical pitfalls of distributed systems—including CAP and BASE theories, message‑queue reliability issues, distributed cache challenges, sharding strategies, and transaction models—while offering practical mitigation techniques for each problem.
This article outlines why distributed systems are needed, explains how they address cost and high‑availability issues through coordinated nodes, and discusses the new challenges such as service discovery, load balancing, avalanche prevention, monitoring, data sharding, replication, and distributed transactions, while offering practical and theoretical learning paths.
This article explains the CAP theorem, its trade‑offs, the BASE model, various consistency levels, and how parameters N, W, and R are used to achieve strong or eventual consistency in distributed database systems.
This article explores the fundamentals of distributed systems, explaining what they are, why they’re used, design considerations such as replication and partitioning, the implications of the CAP theorem, common distribution strategies, typical architectural patterns, and the advantages and challenges of building and operating such systems.
This article explains the CAP theorem, the trade‑offs among consistency, availability, and partition tolerance, introduces the BASE model and its properties, and details how different database systems implement various consistency guarantees such as strong, eventual, and causal consistency.
This comprehensive article explains the core concepts of distributed systems—including node modeling, failure types, replica strategies, consistency levels, performance metrics, data distribution techniques, lease mechanisms, quorum, logging, two‑phase commit, MVCC, Paxos, and the CAP theorem—providing a solid foundation for designing robust, scalable architectures.
This article explains how Ant Financial’s logical data center (LDC) and unitized architecture, combined with OceanBase’s Paxos‑based consensus, enable the massive TPS growth for Double‑11 payments while addressing sharding, CAP trade‑offs, traffic diversion, and multi‑site disaster recovery.
The article explains how Alipay achieves massive payment throughput during Double‑11 by using logical data centers (LDC), unit‑based system design, multi‑active disaster‑recovery, and CAP‑theorem analysis, highlighting the role of OceanBase and PAXOS in ensuring consistency and availability.
This article explains the key characteristics of distributed systems, introduces the CAP and BASE theories, compares strong, weak and eventual consistency models, and reviews common distributed transaction solutions such as two‑phase commit, TCC and message‑based approaches, highlighting their trade‑offs and practical considerations.
This article explains core distributed‑system concepts—including the CAP theorem, ACID and BASE models, consistency guarantees, and the mechanics of 2PC, 3PC, and TCC transaction protocols—while also discussing availability strategies and practical design considerations.
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 examines a decade of Alibaba’s experience with ZooKeeper‑based service discovery, arguing that ZooKeeper’s strong consistency and limited scalability make it unsuitable as a registration center and outlining design principles that favor availability, eventual consistency, and richer health‑check mechanisms.
Drawing on Alibaba's decade‑long experience, this article analyses service‑discovery requirements, CAP trade‑offs, consistency versus availability, health‑check design, disaster recovery, and exception handling to argue that ZooKeeper, while excellent for coordination, is often unsuitable as the primary registration center for large‑scale microservice environments.
This article explains the rise of NoSQL databases, the CAP theorem and its CP/AP trade‑offs, critiques of CAP, and the BASE model, illustrating concepts with examples such as HBase and discussing how these principles guide modern distributed data systems.
During the COVID‑19 pandemic, Tencent and Guangzhou built the “Suikang” mask‑reservation mini‑program in two days, handling 1.7 billion visits by shifting from real‑time inventory checks to a four‑layer “lossy” architecture—CDN caching, batch releases, Redis, Kafka queues, and asynchronous processing—to trade consistency for high availability and rapid response.
This article analyzes the limitations of ZooKeeper for service discovery, covering consistency, partition tolerance, scalability, persistence, health‑checking, disaster‑recovery, and operational complexities, and explains why modern registration centers should favor AP designs and richer health‑check mechanisms.
This article explains the core concepts of replication, consistency, and fault tolerance in distributed systems, discusses strong and asynchronous replication methods, and details the CAP theorem with its consistency, availability, and partition tolerance trade‑offs, illustrating AP and CP scenarios such as Eureka and Zookeeper clusters.
This article explains how Ant Financial’s LDC (Logical Data Center) architecture, unitized RZone/GZone/CZone design, OceanBase database, and CAP-aware strategies enable the payment platform to handle double‑11 traffic peaks of over 540,000 transactions per second while ensuring high availability, disaster recovery, and eventual consistency.
This article objectively compares NewSQL databases with middleware‑based sharding solutions, examining architecture, distributed transactions, CAP constraints, performance, high availability, scaling, SQL support, storage engines, maturity, and provides practical guidance for choosing the right approach.
This article explains how Ant Financial’s massive Double‑11 payment traffic is handled through logical data centers (LDC), unit‑based architecture (RZone, GZone, CZone), traffic routing, disaster‑recovery strategies, and a CAP analysis that highlights the role of OceanBase’s Paxos‑based consensus in achieving high availability and eventual consistency.
This article examines the pressures driving banks to redesign their core database systems, compares three distributed‑access approaches, explains the components of modern distributed databases, analyzes two‑phase and three‑phase commit issues, and evaluates consensus algorithms, CAP/BASE trade‑offs, GTM design, and point‑in‑time recovery.
The article explains how Alipay’s Logical Data Center (LDC) architecture, with its RZone, GZone, and CZone unitization, combined with OceanBase’s Paxos‑based consensus, enables massive TPS growth, traffic diversion, and disaster‑recovery while navigating the CAP theorem constraints.
The article explains why Zookeeper’s CP consistency model and performance characteristics make it unsuitable for high‑availability service registries, advocating an AP‑oriented approach for service discovery in large‑scale systems.
This article explains the necessity of distributed transactions in modern systems, introduces the CAP and BASE consistency theories, and reviews practical solutions such as the XA two‑phase commit, TCC compensation model, and message‑queue based eventual consistency approaches.
This article walks through the evolution of distributed architectures, detailing single‑node, tiered services, caching, clustering, read/write splitting, CAP and BASE theories, Paxos consensus, and Zookeeper's ZAB protocol, providing a comprehensive guide for building resilient large‑scale systems.
This article introduces core concepts of distributed systems, covering node models, replica types, consistency levels, data distribution strategies, lease and quorum mechanisms, logging techniques, two‑phase commit, MVCC, Paxos, and the CAP theorem, providing a comprehensive overview for engineers and researchers.
This article objectively compares NewSQL distributed databases with middleware‑based sharding solutions, examining their architectures, distributed transaction handling, scalability, performance, high‑availability, and operational considerations, and provides guidance on selecting the appropriate approach based on workload, consistency, and organizational constraints.
This article provides a comprehensive overview of distributed‑system fundamentals, covering node concepts, failure types, replication models, consistency levels, performance and availability metrics, data‑distribution strategies, replica control protocols, lease mechanisms, quorum, two‑phase commit, MVCC, Paxos, and the CAP theorem.
This article explains what NoSQL databases are, introduces the CAP theorem that underlies their design trade‑offs, outlines typical application scenarios, discusses their limitations, classifies the main NoSQL families, and reviews four widely used systems—Redis, HBase, Cassandra, and MongoDB.
This article walks through building an e‑commerce platform using microservices, covering module decomposition, domain‑driven design, service splitting, technology stack choices, distributed transaction strategies, circuit‑breaker patterns, centralized configuration, monitoring, and capacity planning to guide developers from concept to deployment.
This article explains the concepts of local and distributed transactions, introduces the CAP theorem, and demonstrates how message‑queue‑based designs with logging and idempotency can ensure data consistency and reliability in distributed banking scenarios.
This article explains the ACID principles of relational databases versus the CAP principles of NoSQL systems, illustrates why distributed systems can only satisfy two of consistency, availability, and partition tolerance, and discusses how Eureka and Zookeeper embody AP and CP choices, especially during high‑traffic events like Double‑11.
This article explains the CAP theorem, the trade‑offs among consistency, availability and partition tolerance, describes strong, weak and eventual consistency models, and introduces the BASE approach as a practical alternative for large‑scale distributed systems.
This article introduces the foundational concepts and principles of distributed systems—including basic concepts, consistency models, CAP theorem, logical clocks, and advanced protocols like Paxos, Raft, and Zab—serving as the first part of a comprehensive Big Data mastery series.
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.
The paper presents a highly scalable, low‑overhead Host‑based Intrusion Detection System architecture designed for hundreds of thousands of servers, emphasizing cluster high‑availability, strong consistency via a CP‑oriented etcd backend, Go‑based agents with efficient resource management, modular sandboxing, and robust process monitoring to ensure reliable, secure operation at massive scale.
The article describes YouZan's business reconciliation platform for distributed systems, which detects and quantifies data inconsistencies by offering easy plug‑in integration, a four‑step orchestrated workflow, high‑throughput offline processing with Spark, second‑level real‑time event handling, a three‑layer architecture, and health monitoring for transaction chains.
The article explains distributed final consistency challenges, compares heavyweight transaction frameworks with lightweight techniques such as idempotency, retries, state machines, recovery logs, and async verification, and outlines CAP, BASE principles and practical implementation steps for backend systems.
This article explains the origins of service registration and discovery in microservice architectures, outlines the problems they address, describes their key characteristics, and compares implementation approaches such as DNS, Zookeeper, Dubbo, and Eureka, highlighting the CAP‑theorem trade‑offs between Zookeeper (CP) and Eureka (AP).
This article explains why transactions are essential, traces their origin from early XA specifications, examines the CAP and BASE theories that expose challenges in distributed systems, and reviews practical solutions such as two‑phase commit, three‑phase commit, TCC, asynchronous messaging, Saga and Gossip protocols, highlighting their trade‑offs and when to apply each.
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 the CAP theorem, its implications for distributed systems, details the Paxos consensus algorithm and its availability optimizations, and introduces ZooKeeper's ZAB protocol, showing how they together address consistency‑availability trade‑offs in real‑world deployments.
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.
The article explains the necessity of transactions, traces their origins from database XA specifications to modern distributed systems, compares CAP and BASE theories, and reviews mainstream solutions such as two‑phase commit, three‑phase commit, TCC, asynchronous messaging, and the Saga pattern.
This article explains the evolution and core concepts of mainstream distributed architectures—including SOA, microservices, and service mesh—covers fundamental consistency theories such as CAP and BASE, and outlines practical high‑availability and scalability techniques for building resilient cloud‑native systems.
This article explores the evolution and core concepts of modern distributed architectures—including SOA, microservices, and service mesh—explains key theories such as CAP and BASE, and provides practical guidelines for achieving high availability, scalability, and efficient content delivery through techniques like load balancing, CDN, and gray‑release strategies.
The article explains the CAP theorem, its three properties—consistency, availability, and partition tolerance—how they influence database design, compares CA, CP, and AP classifications with examples, and discusses related concepts such as ACID, BASE, and practical design choices for distributed systems.
This article outlines essential distributed system concepts—including system decomposition, concurrency, caching strategies, online vs. offline processing, push/pull communication, load limiting, service degradation, CAP theorem, and eventual consistency—to help engineers design scalable, reliable architectures for high‑traffic applications.
The article recounts the evolution from early laser typesetting to the design of OceanBase, a distributed database that balances performance, cost and consistency for financial services, detailing five key technical innovations, market forces, and the broader implications for the database industry.
This article explores the importance of data consistency in distributed systems, illustrating real‑world scenarios, explaining consistency models such as strong, weak and eventual, and detailing the challenges and theories like CAP and BASE that guide system designers in balancing consistency, availability, and partition tolerance.
Distributed systems rely on consensus to ensure consistent results, but achieving it faces fundamental challenges such as network unreliability, node failures, and trade‑offs captured by the CAP theorem, FLP impossibility, and various algorithms like Paxos, Raft, and Byzantine Fault Tolerance, each balancing consistency, availability, and safety.
This article explains the core challenges of achieving consistency in distributed systems, describes consensus algorithms such as Paxos and Raft, discusses theoretical limits like the FLP impossibility and CAP theorem, and shows how trade‑offs among consistency, availability, and partition tolerance shape practical system design.
The article explores Twitter’s Manhattan storage system, detailing its architecture, CAP trade‑offs across various database types, the design of its modular storage engines, high‑performance operations, and the DevOps practices that enable reliable, low‑latency handling of billions of requests in a massive distributed environment.
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 explores core distributed system design principles, detailing the CAP theorem and its implications, the BASE extension, shared‑nothing architecture, various load‑balancing algorithms and deployment modes, as well as high‑availability strategies such as active‑standby, active‑active, and clustering to eliminate single points of failure.
This article examines the challenges of consistency in large‑scale distributed service systems, presents real‑world case studies such as payment transfers and order processing, and outlines practical patterns—including ACID/BASE theory, two‑phase and three‑phase commit, TCC, query, compensation, periodic reconciliation, and reliable messaging—to help engineers design robust, eventually consistent architectures.
This article explains the theory and practical techniques behind synchronizing state across data centers using a two‑site three‑center model, covering distributed protocols like Paxos and Raft, CAP trade‑offs, latency challenges, and high‑availability designs for robust database replication.
This article explores core system architecture concepts—including the CAP theorem and its BASE extension, the shared‑nothing design, various load‑balancing algorithms and deployment modes, and high‑availability patterns such as active‑standby, active‑active and clustering—providing practical guidance for building scalable, reliable distributed applications.
This article introduces core distributed‑system concepts—including the definition of consensus, the two‑phase and three‑phase commit protocols, the CAP theorem and its engineering implications, and logical‑clock mechanisms such as Lamport timestamps, vector clocks, and version vectors—explaining their models, challenges, and practical trade‑offs.
This article explains the fundamentals of transactions, the ACID properties, isolation levels, distributed transactions, the CAP theorem, and the BASE model, illustrating how they shape consistency, availability, and reliability in modern database and distributed system design.
This article examines the fundamental challenges of achieving consistency in distributed systems, explains the CAP theorem, compares two‑phase and three‑phase commit protocols, explores XA transactions, and presents practical compensation patterns such as local message tables, non‑transactional and transactional MQ designs, highlighting their trade‑offs and applicability.
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.
An in‑depth overview of NoSQL databases explains the limitations of traditional relational systems, details ACID properties, introduces the CAP theorem and BASE model, compares RDBMS with NoSQL, outlines advantages, disadvantages, history, classifications, and real‑world usage examples.
This article explores the core difficulties of distributed systems—including network latency, failures, the CAP theorem, consistency models, and common techniques such as consistent hashing, quorum, vector clocks, lease mechanisms, gossip protocols, and distributed transaction protocols—providing practical insights and references for building robust scalable architectures.
This article explains the CAP theorem—its three core properties, why a distributed system can satisfy at most two of them, the formal proof, practical strategies for handling partitions, and how modern databases and architectures attempt to work around its constraints.
This article explains the principles of distributed storage, the CAP theorem and consistency models, compares popular distributed file systems, and provides a detailed overview of MogileFS architecture, features, and operation workflow.
