1 views collected around this technical thread.
The article explains the principles, implementation techniques, trade‑offs, and typical use cases of strong consistency and eventual consistency in distributed systems, helping architects decide which model best fits the performance, availability, and correctness requirements of their applications.
This article explains the core concepts of the BASE theory—Basically Available, Soft State, and Eventual Consistency—illustrating how distributed systems trade off consistency for higher availability and performance, and provides practical examples and typical application scenarios.
This article explains why cache‑DB consistency is a long‑standing challenge, compares naive full‑load and delete‑cache approaches, analyzes concurrency and failure scenarios, and presents reliable solutions such as updating the database first followed by cache deletion using message queues or binlog subscriptions.
The article explains business compensation mechanisms in distributed microservice architectures, detailing rollback and retry approaches, their implementation patterns, strategies, and practical considerations for achieving eventual consistency while handling failures and outlines best practices for idempotency, monitoring, and workflow engine design.
Michael Perry discusses his book on immutable architecture, exploring the eight myths of distributed computing, the impact of Pat Helland’s “immutability changes everything”, CAP theorem, eventual consistency, location‑independent identities, and CRDTs, while offering practical advice for applying these concepts in real‑world enterprise systems.
This article explains how Apache CouchDB achieves eventual consistency through its MVCC architecture, CAP theorem trade‑offs, incremental replication, and document‑level versioning, illustrating concepts such as local consistency, conflict resolution, and practical use‑cases for building scalable distributed systems.
This article explains the concepts of eventual consistency, hinted handoff queues and anti‑entropy in distributed databases, illustrates how they work with XDB Enterprise examples, and shows how AE restores data integrity after node failures or network partitions.
This article explains the concepts of sequential, causal, and eventual consistency in distributed systems, illustrating their guarantees with examples and diagrams, and discusses related consistency guarantees such as monotonic reads, writes, and read‑your‑writes, helping readers grasp how these models affect system behavior and performance.
Baidu's DuoLiXiong platform, a SaaS suite for local services, achieves stability through comprehensive technical and business specifications, microservice best practices, rigorous code reviews, automated monitoring, eventual consistency, idempotency, and future automated scaling and intelligent fault tolerance for critical operations.
This article explains the fundamentals of distributed consistency, covering strong, weak, and eventual consistency, the CAP theorem, BASE model, and how ACID principles relate to modern distributed systems, helping engineers balance availability and data integrity in large‑scale architectures.
The article explores event‑driven architecture in microservices, detailing transaction consistency challenges, eventual consistency solutions, domain‑driven design, bounded contexts, and practical patterns such as local transaction tables, event sourcing, and materialized views to achieve reliable distributed systems.
The article explains how traditional ACID transaction guarantees break down in microservice environments, discusses the challenges of distributed transactions, and presents event‑driven architectures, eventual consistency, domain services, materialized views, and practical patterns such as local transaction tables and event sourcing to achieve reliable consistency across services.
This article examines common pitfalls and six practical strategies for maintaining data consistency between MySQL and Redis caches, comparing naive approaches with optimal solutions such as cache double‑delete, asynchronous serialization via message queues, and binlog‑driven eventual consistency, and offers recommendations for real‑time and eventual consistency scenarios.
This article examines why cache consistency cannot be fully guaranteed, analyzes common inconsistency scenarios between Redis and MySQL, compares four update strategies, and offers practical recommendations such as updating the database before deleting cache, using short expiration times, delayed double‑delete, MQ or binlog approaches to achieve eventual consistency.
The article explains how micro‑service architectures create data‑consistency challenges that require distributed transaction strategies, compares strong‑consistency protocols like 2PC/3PC with eventual‑consistency approaches such as TCC and Saga patterns, and discusses their trade‑offs, implementation complexity, and suitability for real‑world scenarios like a points‑based sign‑in system.
This article explains the concept of anti‑entropy as a key mechanism for achieving eventual consistency in distributed database systems, illustrates how XDB Enterprise handles node failures and data drift, and shows practical examples of repairing inconsistencies using the AE service.
This article explains the concept of eventual consistency in distributed databases, introduces the Hint Switch (HH) queue used by XDB Enterprise to handle failed writes, and discusses how replication factor and node failures affect data consistency, illustrated with practical examples and diagrams.
This article explains the concepts of sequential, causal, and eventual consistency models, illustrating their definitions, guarantees, and practical examples—including process interactions and real‑world scenarios—while comparing their strengths, trade‑offs, and related consistency guarantees such as monotonic reads, writes, and read‑your‑writes.
The article outlines essential practices for migrating to microservices, covering service dependency rules to avoid circular dependencies, interface version compatibility strategies, isolation techniques for data, deployment and business logic, and methods to ensure eventual data consistency using scheduled retries and transactional messaging.
This article analyzes data consistency challenges between databases and Redis caches in high‑traffic applications, examines write order pitfalls and concurrency issues, and presents the Cache‑Aside pattern with retry and expiration strategies to achieve eventual consistency.