Cap Theorem hard
Which system provides 'Strict Serializability'?
- A A system that guarantees transactions are executed in a serial order while ensuring that this order respects wall-clock recency.
- B A specialized consistency model that allows for Stale Reads but strictly enforces the order of all incoming Monotonic Writes.
- C The default consistency level provided by Cassandra when performing Quorum-based Read and Write operations across multiple regions.
- D Any database that utilizes Snapshot Isolation to prevent dirty reads while allowing for concurrent transaction execution.
Answer: A. A system that guarantees transactions are executed in a serial order while ensuring that this order respects wall-clock recency.
Strict Serializability is the 'Gold Standard' of distributed consistency. It combines Serializability (transactions appear to have run in some sequential order) with Linearizability (that order must match the actual real-time order of events). Achieving this requires heavy coordination (like locking or consensus) and significantly increases latency, making it the ultimate CP-choice for mission-critical data integrity.
One system design question a day, with spaced repetition so the ones you miss come back.
Get the appRelated questions
- What is a 'Split Brain' scenario?
- The PACELC theorem extends CAP by stating: Even when there is NO partition (E), the system must choose between:
- Why is a CA (Consistent + Available) system generally considered impossible for distributed web applications?
- In CAP, 'Consistency' is equivalent to:
- In the CAP Theorem, what does the 'P' stand for?
- What causes a Network Partition?