Cap Theorem easy
Traditional Relational Databases (like MySQL/PostgreSQL) in a cluster are typically configured as:
- A AP (Available and Partition Tolerant), prioritizing the ability to serve stale reads over maintaining perfect data synchronization.
- B They occupy a third category that is not covered by the standard CAP Theorem definitions or architectural constraints.
- C CP (Consistent and Partition Tolerant), as they typically utilize a single primary node for all write operations to ensure data integrity.
- D Dynamically selected at query time based on the specific workload priority and the remaining physical capacity of the cluster nodes.
Answer: C. CP (Consistent and Partition Tolerant), as they typically utilize a single primary node for all write operations to ensure data integrity.
Traditional RDBMS systems were designed for ACID compliance. In a clustered setup with a single Primary for writes, if the Primary or the network fails, the system typically becomes unavailable for writes to prevent data corruption. This prioritizes data 'Correctness' (Consistency) over 'Uptime' (Availability). Modern NoSQL databases often default to the opposite (AP) to ensure global scale and responsiveness.
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?