NoSQL - NoDeath by PowerPoint
•Download as PPT, PDF•
0 likes•774 views
An introduction to NoSQL in images.
Recommended
More Related Content
Viewers also liked
Recently uploaded
Recently uploaded (20)
NoSQL - NoDeath by PowerPoint
- 1. NoSQL NoDeath by PowerPoint Daniël W. Crompton
- 4. VoltDB Hypertable Berkeley DB Citrusleaf Versant Object Database Keyspace Oracle Coherence Apache Hbase MongoDB Freebase InterSystems Caché IBM Informix C-ISAM memcached Apache Hadoop TreapDB GT.M JADE db4o CDB Apache River NDBM Riak ObjectDB Rocket U2 Amazon SimpleDB BigTable Memcachedb Voldemort Objectivity DB OpenInsight Velocity ZODB membase Hibari ObjectStore OpenQM Tuple space GemStone/S LevelDB Dynamo Mnesia ESE/NT Redis D3 Pick database Tokyo Cabinet Apache Cassandra
Editor's Notes
- CERN – Large Hadron Collider – CouchDB NASA – Jet Propulsion Labs - ??? Google – BigTable, LevelDB NetFlix – SimpleDB, HBase, Cassandra FaceBook - Cassandra Twitter – Hadoop EDSA – MongoDB Last.FM – HBase Digg – Cassandra Oracle – Berkley DB, Coherence Amazon – SimpleDB, Dynamo,
- NoSQL is an umbrella term for lots of different storage systems
- Lots of different systems with different implementations depending on requirements
- Consistency (all nodes see the same data at the same time) Availability (a guarantee that every request receives a response about whether it was successful or failed) Partition tolerance (the system continues to operate despite arbitrary message loss)
- CAP Theory Consistency - all nodes see the same data at the same time Availability - a guarantee that every request receives a response about whether it was successful or failed) Partition Tolerance - the system continues to operate despite arbitrary message loss
- Many of the databases can’t pass the ACID test ACID ( atomicity, consistency, isolation, durability ) Atomicity requires that database modifications must follow an "all or nothing" rule. One part of the transaction fails, the entire transaction fails C onsistency ensures that any transaction the database performs will take it from one consistent state to another Isolation is the requirement that no transaction should be able to interfere with another transaction at all Durability means that once a transaction has been committed, it will remain
- We can and don’t need to store everything in nicely ordered tables, with types attached
- Document Graph Object Key-Value
- Multi-Master Peer 2 Peer Master-Slave
- Like SQL all about Caching and Indexing
- CERN – Large Hadron Collider – CouchDB NASA – Jet Propulsion Labs - ??? Google – BigTable, LevelDB NetFlix – SimpleDB, HBase, Cassandra FaceBook - Cassandra Twitter – Hadoop EDSA – MongoDB Last.FM – HBase Digg – Cassandra Oracle – Berkley DB, Coherence Amazon – SimpleDB, Dynamo,