1. Group 11 Sameera Shah & Fatemah Husain [10/31/13]

2. 1) Relational Databases 2) Transaction Processing 2 Why SQL? 1) Scale to a large number of users 2) Accommodate large data 3) Allows addition/removal resources quickly

3. 1) Use of function+ data partitioning 2) Each partition will use relational DB a) Provides local consistency b) Query processing 3) Mirroring of nodes a) Guarantee node availability 4) Eventual consistency as acceptable global consistency Advantages: a) Provides availability during node failures b) Ability to work on older data Disadvantage: a) Trade-off with consistency 3

4. Function + Data partitioning 4

5. 5 CAP Theorem: You can have at most two of these properties for any shared-data system.

6. 1) Basically Available 2) Soft state 3) Eventual Consistency 6 1) Atomicity 2) Consistency 3) Isolation 4) Durability

7. 7 SQLNoSQL DefinitionA database structured to recognize relations among stored items of information “Not Only SQL”, is an approach to data management and database design that's useful for very large sets of distributed data. CharacteristicsPre-defined SchemaSchema-less ACID propertiesBASE Properties Structured DataUnstructured and Semi Structured data Database Examples Commercial: Oracle, MS SQL Open Source: MySQL, Ingres Column: HBase Document: MongoDB Key-value: Dynamo Graph: Virtuoso

8. 1) Scalable SQL: How do large-scale sites and applications remain SQL-based? Michael Rys, Communications of the ACM Vol. 54 No. 6, Pages 48-53 10.1145/1953122.1953141 2) Relational DB: http://en.wikipedia.org/wiki/Relational_database http://en.wikipedia.org/wiki/Relational_database Text Book: Elmasri, Navathe, Fundamentals of Database Systems, 6th, Addison Wesley, ISBN-10: 0-13-608620-9. 3) CAP: http://en.wikipedia.org/wiki/CAP_theoremhttp://en.wikipedia.org/wiki/CAP_theorem 4) NoSQL: http://en.wikipedia.org/wiki/NoSQLhttp://en.wikipedia.org/wiki/NoSQL 8