Personal notes on
"10 Rules for Scalable performance in 'Simple Operation' Datastores"
By Michael Stonebraker and Rick Cattell.
From
JUNE 2011 VOL. 54 NO.6 COMMUNICATIONS OF THE ACM 75
The Dominant data storage systems all look about the same today but many new ones are coming.
Systems - Link
New kinds of stores for simple-operation (SO) databases
Key-value Stores - each object has a key and a payload
Dynamo
Voldemort
Document Stores - objects with a variable number of attributes
CouchDB
MongoDB
Extensible Record Stores
- variable width record sets, partitioned vertically and horizontally
BigTable
Cassandra
SQL DBMSs - retain SQL and ACID (Atomicity, Consistency, Isolation, Durability
MySQL Cluster
Ten Rules
Look for shared-nothing scalability
High level languages are good and need not hurt performance
Plan to carefully leverage main memory databases
High availability and automatic recovery are essential
Online everything
Avoid multi-node operations
Don't try to build ACID consistency yourself
Look for administrative simplicity
Pay attention to node performance
Open source gives you more control over your future
Key-value Stores - each object has a key and a payload
Dynamo
Voldemort
Document Stores - objects with a variable number of attributes
CouchDB
MongoDB
Extensible Record Stores
- variable width record sets, partitioned vertically and horizontally
BigTable
Cassandra
SQL DBMSs - retain SQL and ACID (Atomicity, Consistency, Isolation, Durability
MySQL Cluster
Ten Rules
Look for shared-nothing scalability
High level languages are good and need not hurt performance
Plan to carefully leverage main memory databases
High availability and automatic recovery are essential
Online everything
Avoid multi-node operations
Don't try to build ACID consistency yourself
Look for administrative simplicity
Pay attention to node performance
Open source gives you more control over your future
No comments:
Post a Comment