Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Improvement of no sql technology for relational databases v2

1,535 views

Published on

Published in: Education, Technology
  • Be the first to comment

Improvement of no sql technology for relational databases v2

  1. 1. Improvement of NoSQL Technology for Relational Databases<br />TsendsurenMunkhdalai<br />twitter: @tsendeemts<br />
  2. 2. Contents<br />Limitation of relational database<br />NoSQL technology<br />Types of NoSQL database<br />Conclusion<br />
  3. 3. Nowadays, statement of data<br />Large data<br />Some data generators<br />Facebook photos +25TB/week<br />Twitter +7TB/day<br />Flickr +21GB/hour<br />Data size is repeatedly increased every year<br />Not structured data<br />New kinds of applications are growing up<br />Such as Web 2.0, Enterprise applications and Cloud computing<br />They needed not structured data<br />There are many no structured data generators<br />
  4. 4. Limitation of relational database<br />Static, normalized data schema<br />Have to store structured data<br />There is complex join operation<br />Not flexible datastore<br /> Data is centralized in one place<br />Not distributed<br />Data overflowing<br />Nothing<br />
  5. 5. NoSQL technology<br />NoSQL: Not Only SQL<br />Handle huge amount of data at full speed<br />Distributed<br />Natively support clustering<br />Have Map/Reduce mechanism<br />Support replication and sharding<br />Schema free<br />More flexible<br />Have hashing and B-tree indexing<br />There are four types of NoSQL databases<br />
  6. 6. Distributed: NoSQL database<br />Support replication and sharding<br />Map/Reduce mechanism<br />Similarity, parallel processing<br />Sharding/Partitioned<br />res<br />res<br />Big Result<br />res<br />job<br />Big Job<br />Data<br />1<br />2<br />3<br />4<br />5<br />6<br />job<br />job<br />replication<br />3<br />4<br />5<br />6<br />1<br />2<br />
  7. 7. Types of NoSQL database 1/4<br /> Key-Value database<br />Stores value based on its key<br />Designed to handle massive load<br />Data model: Collection of Key-Value pairs<br />Given key, get value<br />Data hashing indexed<br />Some systems do that automatically<br />Good for <br />Cashe aside<br />Simple, id based interactions <br />
  8. 8. Types of NoSQL database 2/4<br />Column oriented database<br />Column oriented Relational database<br />Tables similarly to RDBMS, but handles semi-structured<br />Each row can have a different number of columns<br />Table is sparse <br />Columns are dynamic<br />
  9. 9. Types of NoSQL database 3/4 <br />Graph database<br />These store data structure as graph<br />Focus on modeling the structure of data <br />Represent complex relation between objects as graph<br />Data model:<br />Nodes, relationships between theirs<br />Each node can have key/value properties<br />C<br />P<br />A<br />
  10. 10. Types of NoSQL database 4/4<br />Document database<br />Stores data as document<br />More complex Key-Value database<br />Data model: Collection of Key-Value, collections as JSON or XML types document<br />{<br /> “name” : “Lady Gaga”,<br /> “ssn” : “213445”,<br /> “hobbies” : [“Dressing up”, “Singing”],<br /> “albums” : <br />[{“name” : “The fame”<br /> “release_year” : “2008”}, <br /> {“name” : “Born this away”<br /> “release_year” : “2011”}]<br />}<br />{<br /> {….}<br />}<br />{<br /> {….}<br />}<br />
  11. 11. Some statistic<br />Facebook search<br />MySQL > 50 GB Data<br />Writes Average : ~300 ms<br />Reads Average : ~350 ms<br />Rewritten with Cassandra (NoSQL) > 50 GB Data<br />Writes Average : 0.12 ms<br />Reads Average : 15 ms<br />
  12. 12. Who uses NoSQL ?<br />Big Data Big data Analysis<br />
  13. 13. Conclusion<br />NoSQL databases<br />Data process quite faster than relational database<br />Distributed<br />Dynamically determine new attributes<br />Cheap<br />Mostly, open source<br />Have natively clustering, don’t need supercomputer (Expensive)<br />Map/Reduce mechanism is provided<br />Have B-tree and hashing indexing<br />
  14. 14. Thank You<br />

×