What is replication lag and why does it matter?
Replication lag is the delay between a write landing on the leader and that same write becoming visible on a replica. It matters because a client reading from a lagging replica can see stale data — placing an order and then not seeing it on a follow-up read, because that read hit a replica that hasn't caught up yet. This is the direct, user-visible cost of asynchronous replication.
Answered in
Database Replication Explained: Single-Leader, Multi-Leader, and LeaderlessWhat replication lag actually breaks, and how single-leader, multi-leader, and leaderless models trade off consistency for availability.
Read the full analysisOther questions this article answers
More system design questions
- Why does a database need an index at all — why can't it just scan the table?
- When is a hash index better than a B-tree index?
- What is a composite index and why does column order matter?
- What's a covering index and why is it faster than a normal index?
- What's the real cost of adding an index, beyond disk space?
- What does ACID actually stand for, and why do all four properties matter together?
- What's the practical difference between pessimistic and optimistic concurrency control?
- What is a race condition in a database transaction, and how does isolation prevent it?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.