consistency
The guarantee about whether what you read reflects what was most recently written.
In more detail
Consistency is a contract per operation: strong reads see the latest acknowledged write, eventual reads converge later, causal reads keep an order the client has seen. Every replica, cache and search index can quietly weaken it. In database ACID terms the same word means something else: transactions keep the data valid against its rules.
Related terms
- strongly consistent read — A database read guaranteed to return the result of every write that finished before it, never an older copy.
- eventual consistency — A guarantee that copies of data will match once writes stop, even though a read straight after a write may briefly see an older value.
- causal consistency — A guarantee that if one write caused another, everyone sees them in that order.
- staleness — How out of date a copy of data is compared with the latest write.
- CAP theorem — The result that during a network partition a replicated system must choose between consistent answers and answering every request.
Taught in
- Requirements: The Constraints That Shape The System — Scalable System Design & Distributed Architecture
- Latency Numbers Every Engineer Should Know — Scalable System Design & Distributed Architecture
- The Storage Decision: Relational Versus Document — Scalable System Design & Distributed Architecture
- Consistency, And The Truth About CAP — Scalable System Design & Distributed Architecture
- Eventual Consistency And What It Costs A Product — Scalable System Design & Distributed Architecture
- Cache Invalidation And The Three Hard Cases — Scalable System Design & Distributed Architecture
- Load Balancing And The Failure Modes It Introduces — Scalable System Design & Distributed Architecture
- Worked Design One: Scaling The Ticket Booking System — Scalable System Design & Distributed Architecture
- Worked Design Two: Scaling Chat Fan Out — Scalable System Design & Distributed Architecture