PACELC Theorem

PACELC Theorem

graph TD
    subgraph CAP Theorem
        direction TB
        A{"Partition?

Partition Tolerance:
The system continues to operate
despite network failures."}
        A -- Yes --> B(( ))
        B --> B1["Availability
Every request receives a response,
though it may not be the latest data."]
        B --> B2["Consistency
Every read receives the most
recent write or an error."]
    end

    subgraph PACELC Extension
        direction TB
        C(( ))
        C --> C1["Latency
The time delay to get a response
after sending a request."]
        C --> C2["Consistency
Every read receives the most
recent write or an error."]
    end

    A -- No --> C

    %% Style the fork points to be invisible
    style B fill:none,stroke:none
    style C fill:none,stroke:none