CAP theorem ya bayyana cewa tsarin rarraba zai iya garantama a mafi yawa biyu daga cikin ukku kadarori — Consistency, Availability, da Partition tolerance — a lokaci gida. Tun da raunin sadarwa ba za su iya guje ba, ainihin zaɓi shine tsakanin consistency da availability lokacin da aka samu raunin sadarwa.
Kadarorin ukku
CONSISTENCY (C) → every read sees the latest write (all nodes agree on the data)
AVAILABILITY (A) → every request gets a response (the system stays responsive)
PARTITION TOLERANCE (P) → the system keeps working despite network partitions
(communication breaks between nodes)
→ CAP: you can only fully guarantee TWO of these three simultaneously.
