Sign inSign in
ConceptSystems & CS

CAP theorem

A theorem stating that a distributed database can simultaneously provide at most two of three guarantees: Consistency, Availability, and Partition Tolerance.
as Andy Pavlo defines itCarnegie Mellon UniversityThe wording closest to all 5 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Martin Kleppmann

    University of Cambridge · Undergraduate

    The CAP theorem categorizes systems by consistency, availability, and partition tolerance.
    • 35:21Thinking in Events: From Databases to Distributed Collaboration Software
    • 5:00Eventual Consistency
  • David Ostrovsky

    Google Research & TechTalks · Undergraduate

    A conjecture stating that any distributed system can satisfy at most two of three guarantees: consistency, availability, and partition tolerance.
    • 35:55To NoSQL or Not to NoSQL: That Is the Question
  • Sugu Sougoumarane

    Carnegie Mellon University · Research

    A principle stating that a distributed data store can only provide two of three guarantees: consistency, availability, and partition tolerance.
    • 42:53Multigres: Horizontal Scaling and Enterprise Operations for PostgreSQL

Lectures that assume it

1

Connections

16

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.