![]() Atomicity - all operations succeed or fail together, i.e.This is formalized in the "ACID" properties: In this way, the notion of a transaction supports data integrity when part of a system fails. The operations in a transaction either all succeed, or they all fail. Now that we’ve talked about the theoretical constraints of the CAP Theorem, let’s look at the fundamental unit of database operations: the transaction.Ī transaction is a series of database operations that are considered to be a "single unit of work". Or it can satisfy Availability, continue responding but risk inconsistencies.Ī system is called a CP database if it provides Consistency and Partition Tolerance, and an AP database if it provides Availability and Partition Tolerance. In other words if part of the cluster goes down, the system can either satisfy Consistency, roll back any unfinished operations and wait to respond until all nodes are stable again. This implies a tradeoff between Consistency and Availability. ![]() We live in a physical world and can't guarantee the stability of a network, so distributed databases must choose Partition Tolerance. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |