Successfully reported this slideshow.
Activate your 30 day free trial to unlock unlimited reading.
All operations will occur, or none
INSERT INTO Names
(firstname,lastname) VALUES (Sean,
All operations will leave the
database in a known good state
Keys, Constraints, triggers, etc..
Cannot have operations that violate
the rules for your data
Customer doesn’t exist
Primary key that already exists
Operations cannot interfere with one-
Handle multiple, concurrent
operations (One write, many reads) in
a defined manner.
Completed operations are bullet-proof
Yank out the power cable
Crash the database server process
When the database server comes back
up - database is in a consistent
state - with your data intact.
CAP Theorem - Eric Brewer
Seth Gilbert and Nancy Lynch
All nodes in a distributed system see
the same data - at that exact moment
Simple example: Update item B on
node #1, query node #2 about B -
get back the updated data
System will process requests, despite
failures in individual nodes
Not a guarantee that the operation
Just a guarantee that you will get a
No guarantee is made for WHEN you
will get a response back
System will continue to operate, even
when arbitrarily many messages
between nodes are lost
CAP Theorem asserts that of the three
properties, a system can only have
ACID vs. BASE
Someone clever... har har
Much prefer CAP theorem - exposes the
tradeoffs that you have to choose
Be the first to like this
Number of Embeds
You have now unlocked unlimited access to 20M+ documents!
Learn faster and smarter from top experts
Download to take your learnings offline and on the go
You also get free access to Scribd!
Instant access to millions of ebooks, audiobooks, magazines, podcasts and more.
Read and listen offline with any device.
Free access to premium services like Tuneln, Mubi and more.