MDB1

1. Slide 1 of 20© People Strategists www.peoplestrategists.com
MongoDB (Session-1)

2. Slide 2 of 20© People Strategists www.peoplestrategists.com
Introduction to NoSQL
Session 01

3. Slide 3 of 20© People Strategists www.peoplestrategists.com
Big data
An Introduction

4. Slide 4 of 20© People Strategists www.peoplestrategists.com

5. Slide 5 of 20© People Strategists www.peoplestrategists.com
Unit Equals
1 Bit Binary digit
8 Bits 1 Byte
1024 Bytes 1 Kilobyte
1024 Kilobytes 1 Megabyte
1024 Megabytes 1 Gigabyte
1024 Gigabytes 1 Terabyte
1024 Terabytes 1 Petabyte
1024 Petabytes 1 Exabyte`
1024 Exabytes 1 Zetabytes
1024 Zetabytes 1 Yottabyte
1024 Yottabytes 1 Brontobyte
What Next??

6. Slide 6 of 20© People Strategists www.peoplestrategists.com

7. Slide 7 of 20© People Strategists www.peoplestrategists.com
RDBMS
problems

8. Slide 8 of 20© People Strategists www.peoplestrategists.com

9. Slide 9 of 20© People Strategists www.peoplestrategists.com

10. Slide 10 of 20© People Strategists www.peoplestrategists.com
Design the
Models
Define Objects
and their
relations
Design the
schema
Design
Database
Create or
Modify
Application
Application
Development

11. Slide 11 of 20© People Strategists www.peoplestrategists.com

12. Slide 12 of 20© People Strategists www.peoplestrategists.com

13. Slide 13 of 20© People Strategists www.peoplestrategists.com
Problems with rdbms
• Rigid Schema
• Not Application specific
• Problems with Scaling
Complex Joins
Scaling
Vertical
Scaling
Upper limit
Involves
downtime
Horizontal
Scaling
Easy to scale
dynamically
Limitless
Expansion
No
downtime
issues

14. Slide 14 of 20© People Strategists www.peoplestrategists.com
NoSQL
Introduction

15. Slide 15 of 20© People Strategists www.peoplestrategists.com
Curtains off NoSQL
NOSQL is a broad term used to group databases that
store and retrieve data without using the traditional
tabular relations of and/or most properties of and/or
rules, followed by RDBMS.
Not Only SQL.
Distributed Database Services.
Scalability and Availability.

16. Slide 16 of 20© People Strategists www.peoplestrategists.com
CAP’s Theorem
• The CAP theorem states that there are 3 basic
requirements which exist in a special relation when
designing applications for a distributed architecture.
• Consistency
• This means that the data in the database remains consistent
after the execution of an operation.
• Availability
• This means that the system is always on (Service guarantee
availability), no downtime.
• Partition Tolerance
• This means that the system continues to function even if the
communication among the servers is unreliable, i.e. the servers
may be partitioned into multiple groups that cannot
communicate with one another.

17. Slide 17 of 20© People Strategists www.peoplestrategists.com

18. Slide 18 of 20© People Strategists www.peoplestrategists.com
ACID
• Atomicity
• you can guarantee that all of a transaction happens, or none of
it does.
• Consistency
• you can guarantee that your data will be consistent.
• Isolation
• One transaction cannot read data from another transaction
that is not yet completed.
• Durability
• Once a transaction is complete, it is guaranteed that all of the
changes have been recorded to a durable medium (such as a
hard disk).

19. Slide 19 of 20© People Strategists www.peoplestrategists.com
BASE
• Basically Available
• The database system always seems to work!
• Soft State
• It does not have to be consistent all the time
• Eventually Consistent
• The system will eventually become consistent when the updates
propagate, in particular, when there are not too many updates.

20. Slide 20 of 20© People Strategists www.peoplestrategists.com

21. Slide 21 of 20© People Strategists www.peoplestrategists.com