<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Cap-Theorem on Jesus Oseguera</title><link>https://r0tbyt3.dev/tags/cap-theorem/</link><description>Recent content in Cap-Theorem on Jesus Oseguera</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://r0tbyt3.dev/tags/cap-theorem/index.xml" rel="self" type="application/rss+xml"/><item><title>CAP theorem</title><link>https://r0tbyt3.dev/wiki/content/backend-engineering/databases/database-fundamentals/cap-theorem/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://r0tbyt3.dev/wiki/content/backend-engineering/databases/database-fundamentals/cap-theorem/</guid><description>CAP theorem CAP Theorem - principle stating distributed systems can guarantee only two of: Consistency, Availability, Partition tolerance.
Consistency - all nodes see the same data at the same time. Availability - every request receives a response, without guarantee that it contains the most recent data. Partition tolerance - the system continues to operate despite arbitrary partitioning due to network failures.
CAP Theorem Trade-offs Consistency and Partition tolerance (CP) - The system sacrifices availability to ensure data consistency during a network partition, often returning an error or time-out if data cannot be synced.</description></item></channel></rss>