Tagged articles
eventual consistency
74 articles · Page 1 of 1
The author shares six critical Spring Event best practices derived from production incidents, covering graceful shutdown requirements, startup event loss prevention, suitability for eventual consistency over strong consistency, reliability through retry mechanisms, and mandatory idempotency for subscribers.
IdempotencyKafkaSpring Event
0 likes · 11 min read

This article explains why CAP theorem is insufficient for architecture decisions, critiques eventual consistency's vagueness, defines four session-based consistency models, details linearizability as the gold standard, and provides a decision chain for selecting consistency levels based on business needs and cost.
CAP theoremconsistency modelsdisaster recovery
0 likes · 8 min read

A real-world postmortem of duplicate coupon deductions during a major promotion reveals how retries in local message tables cause duplicate execution; the article dissects four idempotency patterns, their trade-offs, and a layered defense architecture with a practical review checklist.
Architecture PatternsIdempotencydatabase transactions
0 likes · 24 min read

The article presents fc-async, an open-source universal asynchronous processing SDK that uses Spring's @TransactionalEventListener with fallbackExecution to decouple async tasks from business transactions, persists requests in MySQL, retries via XXL-Job, and consumes via Kafka, achieving eventual consistency without invading core code.
KafkaMySQLSpring
0 likes · 12 min read

This article analyzes three production failures with local message tables in e-commerce systems — non-atomic writes losing messages, retry storms overwhelming databases, and missing idempotency causing duplicate operations — and provides a six-point production review checklist covering atomic writes, exponential backoff retries, idempotency keys, distributed scheduler locks, table archiving, and dead-letter alerting.
Dead Letter QueueIdempotencySeata
0 likes · 13 min read


liandkSep 30, 2026 · Backend Development
This article provides a comprehensive guide to distributed transactions in microservices, covering CAP/BASE theory, four major patterns (2PC, local message table, TCC, SAGA), eight common production faults with root causes and fixes, selection guidelines, a troubleshooting SOP, and high-availability standards.
2PCBASE theoryCAP theorem
0 likes · 19 min read

This article analyzes four patterns for keeping Elasticsearch synchronized with MySQL — synchronous dual-write, message-queue async, CDC via Canal/binlog, and scheduled reconciliation — explaining why CDC with version-based deduplication and periodic checksums is the production-grade choice for eventual consistency at scale.
CDCCanalData Consistency
0 likes · 16 min read

This article explains distributed transaction concepts, CAP theorem trade-offs, and three solutions: two-phase commit (2PC), try-confirm-cancel (TCC), and message queue-based eventual consistency with idempotency requirements.
2PCCAP theoremIdempotency
0 likes · 16 min read

This article explores why cross-service state management is harder than API design in distributed systems, using a refund example to illustrate how local transactions, idempotency, state machines, Outbox patterns, and manual intervention achieve recoverable convergence when operations span multiple services and external channels.
ConsistencyIdempotencyOutbox Pattern
0 likes · 21 min read

This article presents the local message table pattern as a lightweight, production-ready solution for achieving eventual consistency in microservice architectures, covering database schema design, transactional message persistence, scheduled retry mechanisms, idempotent consumption, and real-world incident resolution compared to heavier alternatives like Seata and TCC.
IdempotencyMessage Queuedatabase design
0 likes · 11 min read

The article analyzes common pitfalls of Spring Event—such as publishing during shutdown or early startup, unsuitability for strong‑consistency use cases, and the need for graceful shutdown, idempotent listeners, and extra reliability measures—while comparing it with message‑queue solutions.
IdempotencyPublish‑SubscribeSpring
0 likes · 12 min read

The article examines why payment callbacks that arrive later than order cancellations cause money‑in‑order‑canceled anomalies, outlines the three core eventual‑consistency problems—message ordering, duplicate consumption, and message loss—and presents a complete engineering solution using business idempotency keys, a transactional outbox, state‑machine handling, and reconciliation compensation.
IdempotencyKafkaTransactional Outbox
0 likes · 35 min read

This article details a production-ready event-driven architecture for DDD microservices, covering the complete domain event flow, local event table for message loss prevention, three idempotency patterns for duplicate consumption, ordering solutions, five common pitfalls, and a five-layer eventual consistency architecture.
IdempotencyLocal Event TableMessage Queue
0 likes · 12 min read

The article examines why ultra‑high‑throughput systems must move from costly strong consistency to eventual consistency, explaining consistency layering, the trade‑offs of coordination latency, availability, and tail latency, and how local message tables, idempotent delivery, compensation (Saga) and periodic reconciliation together ensure data eventually aligns without sacrificing performance.
ConsistencySagaTransactional Outbox
0 likes · 17 min read

The article explains why reciting the 2PC protocol fails in real‑world interviews, then walks through the two dominant solutions—two‑phase commit and MQ‑based eventual consistency—detailing their mechanisms, trade‑offs, and a concrete interview response template that showcases practical experience and theoretical depth.
Message QueueTwo-Phase Commitdistributed transactions
0 likes · 6 min read

During peak events like Alibaba's Double‑11 and WeChat's red‑packet frenzy, distributed systems must trade strict consistency for availability; this article explains the CAP theorem, introduces the BASE model, compares CP and AP designs, and provides real‑world case studies and selection guidelines.
ACIDBASE theoryCAP theorem
0 likes · 15 min read

Every delay you notice in WeChat messages, flash‑sale pages, or bank transfers stems from the same underlying distributed‑system trade‑off, and this article explains the CAP theorem, its three guarantees, common misconceptions, and how CP versus AP architectures shape real‑world services.
BASE modelCAP theoremCP vs AP
0 likes · 11 min read

The article uses a night‑market analogy to explain practical microservice design, covering domain‑based service decomposition, service discovery, communication protocols, data consistency strategies, fault‑tolerance, rate limiting, and monitoring, while warning against over‑splitting and unnecessary complexity.
Circuit BreakerDistributed Tracingeventual consistency
0 likes · 14 min read

This article explains RocketMQ's transactional message mechanism, detailing its three‑phase workflow, half‑message handling, transaction checks, key implementation tips, and production‑grade best practices for achieving reliable eventual consistency in distributed systems.
JavaRocketMQTransactional Messaging
0 likes · 7 min read

This article examines eventual and linear consistency in leader‑based replication, explains read‑your‑writes and shared‑data scenarios, discusses replication lag, failover trade‑offs, multi‑data‑center risks, and shows how consensus systems like ZooKeeper and etcd implement true linear consistency.
Replicationdatabasesdistributed systems
0 likes · 13 min read

This article explores a supply‑chain consistency framework that tackles distributed transaction challenges by using eventual consistency, detailing its theoretical models, architecture, core components, async execution, retry mechanisms, and a practical code example for Spring‑Boot applications.
annotationdistributed systemseventual consistency
0 likes · 10 min read

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.
CAP theoremConsistencyeventual consistency
0 likes · 13 min read


JavaEdgeNov 16, 2024 · Backend Development
This article explains Netflix's distributed counter abstraction built on their time‑series service, detailing use cases, API design, counter types, implementation methods, control‑plane configuration, performance results, and future work to achieve near‑real‑time, low‑latency counting at massive scale.
Netflixbackend architecturecounter service
0 likes · 25 min read

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.
BASESoft Stateavailability
0 likes · 15 min read

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.
Cache ConsistencyDatabase Synchronizationeventual consistency
0 likes · 19 min read

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.
Retrybusiness compensationdistributed systems
0 likes · 14 min read

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.
CAP theoremCRDTeventual consistency
0 likes · 27 min read

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.
Anti-entropyXDB Enterprisedata replication
0 likes · 10 min read

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.
Consistencycausal consistencyeventual consistency
0 likes · 13 min read

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.
DevOpsIdempotencycode review
0 likes · 11 min read


ITPUBFeb 13, 2023 · Fundamentals
Using a fictional coronavirus carried by a bat, the article illustrates the Gossip protocol’s mechanisms—direct mail, anti-entropy, and epidemic spread—to explain how distributed systems achieve eventual consistency, highlighting advantages, drawbacks, and practical considerations for storage components like Cassandra.
Anti-entropydata replicationdistributed systems
0 likes · 10 min read

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.
DDDevent-driveneventual consistency
0 likes · 15 min read

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.
DDDarchitectureevent-driven
0 likes · 15 min read

This article examines how the strong‑consistency design of etcd limits Kubernetes scalability and latency in edge environments, presents experimental results on etcd performance, and proposes an eventual‑consistency storage layer to improve performance, availability, and scalability for edge deployments.
Edge ComputingKubernetescontainer orchestration
0 likes · 25 min read

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.
Cache ConsistencyMessage QueueMySQL
0 likes · 8 min read

This article walks through the evolution of software design from a traditional monolithic API server to a CQRS-based architecture, highlighting the drawbacks of the anemic CRUD model, the benefits of read/write separation, domain messaging, eventual consistency, and practical implementation considerations.
DDDRead-Write Separationbackend development
0 likes · 9 min read

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.
SagaTCCdatabase consistency
0 likes · 11 min read


ITPUBDec 24, 2021 · Backend Development
The article explains why the naïve "save‑then‑publish" pattern in message‑driven microservices can cause data inconsistency, analyzes failure scenarios, and presents the local outbox pattern with transactional guarantees and eventual consistency as a robust solution.
Message-DrivenOutbox Patterndistributed transactions
0 likes · 9 min read

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.
Anti-entropyXDB Enterprisedata replication
0 likes · 10 min read

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.
HH queueXDB Enterprisedatabases
0 likes · 8 min read


ITPUBDec 6, 2021 · Backend Development
The article explains why the naïve "insert‑then‑publish" pattern can cause data inconsistency in microservice architectures, analyzes failure scenarios, and presents a local message‑table solution that leverages database transactions to achieve eventual consistency while handling duplicate messages.
distributed transactioneventual consistencylocal message table
0 likes · 9 min read

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.
Consistencycausal consistencydatabases
0 likes · 10 min read


DevOpsNov 17, 2021 · Cloud Native
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.
Transactional Messagingdata isolationeventual consistency
0 likes · 14 min read

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.
Cache AsideCache Consistencyeventual consistency
0 likes · 10 min read

Shopee’s Logistics Channel Service migrated from a shared‑cluster MySQL setup to dedicated clusters, added TiDB for transient tracking data, and ultimately adopted hash‑based sharding with separate order and tracking services plus an asynchronous compensation mechanism, enabling uniform data distribution, cross‑database consistency, six‑month archiving, and scalable growth without rebalancing.
Database ArchitectureHorizontal ScalingMySQL
0 likes · 18 min read

This article explains the fundamentals of distributed transactions, introduces the reliable message eventual consistency approach, analyzes its challenges such as atomicity and message reliability, and presents two practical solutions—local message tables and RocketMQ transactional messages—along with their advantages and drawbacks.
Reliable MessagingRocketMQdistributed transactions
0 likes · 8 min read

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.
2PC3PCBackend
0 likes · 15 min read

The article examines five different retry mechanisms for ensuring reliable message delivery between payment and billing microservices, evaluates their pros and cons, and ultimately recommends the third solution as a cost‑effective, highly reliable approach achieving 99.99% consistency.
Message Queueeventual consistencymicroservices
0 likes · 6 min read

This article explains the importance of asynchronous messaging and event‑driven communication for coordinating changes across multiple microservices and bounded contexts, covering single‑receiver and multi‑receiver patterns, message brokers, eventual consistency, publishing/subscribing mechanisms, and practical implementation considerations.
Asynchronous Messagingevent-driveneventual consistency
0 likes · 11 min read

This article explains the principle of reliable message eventual consistency using Spring Boot 2.3.9 and RocketMQ 4.8.0, detailing the transaction flow, broker handling of commit/rollback, project structure, code implementation for producers and consumers, and testing procedures.
JavaRocketMQSpringBoot
0 likes · 9 min read

The article uses a whimsical story of a coronavirus‑like virus transmitted from a bat to humans to illustrate the Gossip protocol, its three functions—direct mail, anti‑entropy, and epidemic spread—and discusses their advantages, drawbacks, and practical applications in achieving eventual consistency in distributed systems.
Anti-entropydata replicationdistributed systems
0 likes · 10 min read

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.
BASE modelCAP theoremConsistency trade‑offs
0 likes · 11 min read

The article explains why and how to use message queues to achieve low‑coupling, better performance, fault tolerance, and eventual consistency in an e‑commerce order‑processing flow, discusses common pitfalls such as message loss and duplication, and compares popular queue products like RabbitMQ, Kafka, and RocketMQ.
DecouplingKafkaMessage Queue
0 likes · 10 min read

This article introduces the limitations of traditional local and distributed transactions for microservices, explains the BASE theory, and details four major patterns—reliable event notification, max‑effort notification, business compensation, and TCC—to achieve eventual consistency in microservice architectures.
Data Consistencydistributed transactionseventual consistency
0 likes · 16 min read

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.
2PCBackendReliable Messaging
0 likes · 19 min read

This article explains CouchDB’s eventual consistency model, its use of MVCC, CAP theorem trade‑offs, incremental replication, and document validation, illustrating how these mechanisms enable scalable, high‑availability distributed databases without locking, and includes a practical case study of syncing Songbird playlists.
CouchDBMVCCReplication
0 likes · 15 min read

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.
BASE theoryCAP theoremConsistency
0 likes · 12 min read

This article explains how to handle distributed transactions in microservice architectures by using eventual consistency with message middleware, discusses the pitfalls of combining database updates and message sending in a single transaction, and presents a reliable solution involving a message table, background processing, ACK mechanisms, and deduplication.
Idempotencydistributed transactionseventual consistency
0 likes · 5 min read

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.
2PCTCCdistributed transactions
0 likes · 25 min read

This article explains how to design and implement a reliable message service that ensures atomicity between upstream business transactions and downstream message delivery, using status management, callbacks, and scheduled tasks to achieve eventual consistency in distributed systems.
Message QueueReliable Messagingdistributed transactions
0 likes · 9 min read

This article explains the Maximum‑Effort Notification pattern for flexible distributed transactions, detailing its principles, workflow, implementation options, evaluation, and optimization techniques to achieve eventual consistency across services with limited retries and idempotent interfaces.
distributed transactionseventual consistencymaximum effort
0 likes · 11 min read

This article explains the fundamental reasons for building distributed systems, examines the inevitable side‑effects—especially data consistency challenges—analyzes the root causes of inconsistency, and walks through various consistency models from eventual to linearizability with clear examples and illustrations.
Data Consistencyconsistency modelsdistributed systems
0 likes · 10 min read


21CTOOct 17, 2018 · Databases
This article explains how to design a high‑throughput payment system using database sharding, Snowflake‑style globally unique order IDs, eventual consistency via message queues, high‑availability architectures, data tiering, and coarse‑fine traffic control to handle massive request spikes.
Shardingdata tieringdatabase
0 likes · 15 min read

This article examines the core features, performance characteristics, and typical application scenarios of popular message queue middleware such as ZeroMQ, RabbitMQ, ActiveMQ, Redis, Kafka, and others, while also discussing when to adopt a message queue, its benefits like decoupling, eventual consistency, broadcasting, and flow control, and summarizing best‑practice guidelines.
MQ ComparisonMessage Queueasynchronous communication
0 likes · 13 min read


JD TechJun 11, 2018 · Backend Development
Message queues enable asynchronous, decoupled communication between systems, and this article explains core scenarios such as decoupling, peak‑shaving, achieving eventual consistency, broadcast consumption, and retry handling, while highlighting implementation details, pull‑mode code, and important considerations like idempotency and consumption monitoring.
BroadcastDecouplingIdempotency
0 likes · 10 min read

This article explains how message queues enable system decoupling, smooth traffic spikes, achieve eventual consistency, support broadcast consumption, and handle retry pitfalls, providing practical code examples and architectural guidelines for reliable backend design.
BroadcastDecouplingLoad Smoothing
0 likes · 10 min read

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.
2PCBASECAP theorem
0 likes · 11 min read

This article walks through the evolution of distributed transaction architectures—from simple single-database transactions, through post-commit multi-database approaches and two-phase commit, to TCC and eventual-consistency patterns—illustrating each method with game-style purchase examples, diagrams, and practical implementation tips.
TCCTwo-Phase Commiteventual consistency
0 likes · 15 min read


21CTOApr 15, 2017 · Backend Development
This article explains the principles of distributed transaction design, covering ACID fundamentals, typical banking and e‑commerce scenarios, various transaction models such as two‑phase, compensation, asynchronous and best‑effort notifications, and presents a micro‑service architecture with concrete flow diagrams and scaling strategies for a high‑throughput traffic‑recharge platform.
Data Consistencydistributed transactionseventual consistency
0 likes · 12 min read

This article examines the challenges of achieving consistency in large‑scale distributed service systems, outlines common inconsistency scenarios such as split‑brain and lost updates, and presents practical patterns—including ACID/BASE trade‑offs, two‑phase and three‑phase commit, TCC, query, compensation, and reliable messaging—to guide engineers in designing robust, eventually consistent architectures.
ACIDBASEConsistency
0 likes · 35 min read

This article explains the challenges of achieving consistency in distributed systems and presents practical solutions such as two‑phase commit, asynchronous assurance, compensating transactions, message retry mechanisms, idempotent designs, and a custom Redis‑based delayed queue (DelayQ) with a transactional proxy (TMQProxy) to provide reliable transactional messaging.
IdempotencyMessage RetryRedis delay queue
0 likes · 19 min read

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.
CAP theoremMessage QueueTransaction Consistency
0 likes · 15 min read

The article examines the challenges of maintaining data consistency across distributed services in e‑commerce, explains strong, weak and eventual consistency models, and presents six practical solutions—including business integration, the eBay BASE pattern, Qunar, Mogujie, Alipay DTS, and Nongxin—highlighting how local transactions, idempotent messaging, and eventual consistency can replace heavyweight distributed‑transaction frameworks.
BASEData Consistencydistributed transactions
0 likes · 16 min read

This article explains the challenges of maintaining data consistency across multiple services in distributed e‑commerce architectures and presents six practical solutions—including business integration, the eBay BASE pattern, Qunar's approach, Mogujie's design, Alipay's DTS, and Nongxin's scheme—highlighting their advantages, drawbacks, and implementation details.
BASECAP theoremData Consistency
0 likes · 16 min read
