In this livestream your host, Jim Walker, will define what CAP Theorem actually is, how CAP Theorem manifests in distributed systems, and then get into the details of database consistency and how it impacts your application. The CAP Theorem states that it is impossible for a distributed database to simultaneously guarantee more than two of the following: Consistency, Availability, or Partition Tolerance. The widely accepted theorem is often used to analyze and position new databases. In this series, we will explore the three guarantees, delivering a definition for each, and outlining how each might affect your database implementation. This is a rather academic series of talks and hopefully, we will help you understand the tradeoff for each. In this session, we will explore Consistency, which states that ”every read receives the most recent write or an error”. We will cover: What are the challenges to delivering consistent transactions in a distributed database. Why is consistency important and what workloads is it important for. We talk through CP and CA databases and how they are used. How CockroachDB delivers on this guarantee.