Quick Read

Database Management Systems (SPPU_IT) 51

Unit VI

Chapter 15: Database Architecture

elements of Parallel DB huge amount of data is handled,

Q.1 What are the key In organizations
transfer
processing? Explain. such huge amount of data needs high data
SPPU- May 18, Dec.19,4Marks rate.
Ans.: Parallel Databases System system is not much
Centralized and client server

Introduction powerful for managing such applications.

of
. A parallel database improves data processing speed Parallel databases try to improve performance
Disk) in such
by using multiple resources (CPU and database through parallelization of operations
parallel. Data loading Query evaluation etc.
.Parallel operations are becoming increasingly of small processors for
We can use thousands
of operation and
common to improve speed
therefore study of Parallel databases is becoming making a parallel machine.
more important.
User 2

User 3
User 1

Processor
Uscd for pertorming
various operations

Memory Disk
Temporary
storage wnile
Data
Storage
operations
aregoiig
on data

inter communication nelwork

User 4
User5
Fig. 15.1:Parallel database system

Goals of Parallel Databases

(a) Improved performance

in parallel we can signihcantly improve performance of system.
CPUs and disks)
Using multiple resources (e.g,
(b) Increased availability
available, then the relation continues to be available from
in database) is not
If a site containing a relation (table

another site which has a copy of that data.

Ces0asy-s0tutions
 Database Management Systems (SPPU) 52
Quick Read
(c) Increased reliablty
(b) Advantages
Ifa site containing a
relation (table in database) fails between processors.
Efficient communication
to work, the relation
continues to be available from be accessed by any processor without
another site which has a Data can
of that
copy data. Hence from one place to other.
this leads to more reliable system. being moved
A processor can send messages to other processors
(d) Distributed data access
much faster using memory writes.
An organization may need to access data which
Disadvantages
belongs to different sites, as it may be possible to
have multiple branches of a Bandwidth problem
company.
32 or 64 processors, since the
Q.2 Explain Architecture of Not scalable beyond
Parallel Databases.
bus or interconnection network will get into a

SPPU- Dec. 17,May 18,6Marks bottleneck.

Ans.: Architecture of Parallel Databases
More number of processors can increase waiting
Parallelism in databases represents one of the most
time of processors.
successful instances of parallel computing system.
(B) Shared Disk System
Types of Parallel Databases
(a) Architecture details
1. Shared Memory System access all disk directly via
Multiple processors can
2. Shared Disk System But, every processor
inter communication network.
3. Shared Nothing System has local memory.
Shared disk has two advantages over shared
(A) Shared Memory System memory.
Each processor has its own memory; the memory
(a) Architecture details
bus is not a bottleneck.
. Multiple CPUs are attached to a common global of
System offers a simple way to provide a
degree
shared memory via interconnection network or
fault tolerance
communication bus. The systems built around this architecture are
Shared memory architectures usually have large called clusters.
caches at each processor, so that
memory
is avoided M-Local Memory
referencing
whenever possible.
of the shared memory
M

Interconnection network Interconnection network P Processor

D Disk
M=Memony
P Processor
memory(M) D=lDisk
Common global shared D D
M= Memory

Shared memory disk

D D
Fig. 15.2: Shared memory disk architecture
Fig. 15.1: Shared memory system architecture
Moreover, caches need to be coherent. That means if (b) Advantages
write to location, Each CPU or processor has its own local memory, so
processor performs memory
a a
a
be either
the data in that memory location should the memory bus will not face bottleneck.
updated at or removed cached data.
High degree of fault tolerance is achieved.

e sCasy-s0lutions
Database Management Systems
(SPPU_IT) 53 Quick Read
Ifa processor (or its memory) falls, Any terminal can Node which functions
act as a
as

Fault tolerance: Server for data that is stored on local disk.

can take over its tasks, since the
the other processor
database is present on disks and are accessible
to all Moreover, the interconnection networks for shared
processors.
nothing systems are usually designed to be scalable,
increase transmission capacity as
so that we can
fails, other processors can take
If one processor more nodes are added to the network.
over its tasks,
since database is on shared disk that

can be accessible from all processors. (b) Advantages

I n this type of architecture no need to go through all
) Disadvantages
/0, Only a single interconnection network queries
added to each processor.
Some memory load is which access non local disk can pass through the
scalable beyond certain
Limited scalability: Not network.
shared-disk architecture faces this ie.
point The We can achieve High degree of parallelism.
because large amounts of data are shipped Number of CPU and disk can be connected as
problem
interconnection network. So now the
through the desired.
to the disk subsystem is architecture systems are more
interconnection Shared nothing
a large number of
bottleneck. scalable and can easily support

The basic problem with the shared-memory and processors.

interference. As more
shared-disk architecture is () Disadvantages
slowed down disk access
CPUs are added, existing CPUs are
.Cost of communication and of non local
increased contention for memory than other two architectures
since sending
because of the is higher
interaction at both ends.
accesses and network bandwidth. data involves software

(d) Applications Requires rigid data partitioning

Digital equipment corporation

DEC
Custe(d) Applications:
running Relational Databases were one
of the early The teradata
database machine uses shared nothing
disk database
of shared
commercial user database architecture.
is owned by Oracle.
architecture. Now this research prototypes.
Grace and the Gamma

() Shared Nothing
Disk System
(D) Hierarchical System
(a) Architecture details Architecture details

Each processor has its

own local memory and local hierarchical
architecture comes with
The
shared memory, shared
disk. combined characteristics of
communicate with architectures.
node may disk and shred nothing
A processor at one
nodes
the system consists of
communication

another processor using high speed At the top level,

interconnection network and they
network
connected by an
with one another.
do not share disks or memory

to reduce the
Interoonnection Network P Processor architecture is attempts
This
D- DiSK such systems yields to
M= Memory complexity of programming where
architectures,
distrlbuted virtual-memory

OO C Local Memory
logically
memory
there is

mapping
a

hardware
single shared memory,

coupled with system

the

M software, allows each processor

to view the disjoint
Local Memory Disc memories as a single vitual memory.
LD D D architecture is also referred to as
The hierarchical
Shared memory architecture.
non uniform memory
Fig. 15.3: Shared nothing architecture
escasy-soiutions
 Database Management Systems (SPPU_IT) 54 Quick Read
Q3 Explain Data Replication and Data
Fragmentation in Distributed Data Slorag@
SPPU-May 18, Dec.18. May 19, Dec. 19, 6Marks
Ans.: Data
Fragmentation / Distributed Database Design
Introduction
ne process of decomposing the database into smaller
multiple units called as fragments.
These fragments may be stored at
various sites, is called data fragmentation.
Completeness constraint:
once a database
The most important condition of data fragmentation process is that it must be complete ie. is
ragmented, it must be always possible to reconstruct the original database from the fragments.

Employee idEmpkoyee salary Department idDepartment_narne

Department 10 Salary
Horizontal A001 10
fragmentaton A002 10

Department 158 150

A121
Horizontal
fragmentation AB321 150

Employee details vertical Department details

Tragment vertical fragmentation

Fig.15.4: Horizontal and verticalfragmentation

Fragmentation Schema (2) Overview
It is a set of fragments that includes all attributes Horizontal fragmentation is group of rows in
and tuples in the database and satisfies the condition relation.
that the whole database can be reconstructed from the
Horizontal fragments are specified by the 'SELECT
fragments by applying some sequence of database
operation of the relational algebra on single or
operations.
multiple attributes.
Types of Data Fragmentation
Example:
(a) Horizontal data fragmentation Select all students of computer
(b) Vertical data fragmentation
branch.
O8ranch "COMP (students)
(c) Mixed data fragmentation
(3) Types
(a) Primary horizontal fragmentation
(A) Horizontal Fragmentation
(b) Derived horizontal fragmentation
(1) Introduction
(c)Complete horizontal fragmentation
Horizontal fragmentation divides a relation

horizontally into group of rows (tuple) to create

subsets of tuples specified by a condition on one o r a ) rimary horizontal fragmentation

more attributes of relation. Primary horizontal fragmentation is the

fragmentation of primary relation.
tuples that belong to the horizontal fragment
is
The
Relation which other relations
specified by some condition
on one o r more on
are
dependent
attributes of the relation. using foreign key is called as primary relation.

esCasy-solutions
Database ManagementSystems(SPPUIT) Quick Read
Example: For reconstructlon of relatlon completeness is
Partitlon 1: All employees belong to department required. As every tuple must belongs to at least onme
number 10. of the partitlon.
Ri-ODept 10 (EMP) Conslder relation below as R now subdivided in Pi
Partition 2: All employees belong to department Pa, Ps and P In case of complete horizontal fragment
number 20. if relation R contains 50 tuples than total number of
R-ODept 20 (EMP) tuples in below 4 partitions should be 50 or more

(b) Derived horizontal fragmentation than 50.

Horizontal fragmentation of a primary relation Example:

introduces Derived horizontal fragmentation of Partition 1: All employees belong to department
other secondary relations that are dependent on number less than 20.
primary relations.
Ri-ODeptNo e= 20 (EMP)
The fragmentation on some other fragmentation is
Partition 2: All employees belong to department
called as Derived horizontal fragmentation.
humber less than 30.
Example:
Rz-OpeptNio =3aLEMPJ
Partition 1: All employees belong to department
number 10 and having age above 25. Partition 3: All employees belong to department
number less than 40.
OAge25(R)
Partition 2: All employees belong to department Rs-ODeptNo= 40 (EMP)
number 20 and having age above 35.
Partition 4: All employees belong to department
Me 35) (R) number above 40.
() Complete horizontal fragmentation
R4-ODepts 40(EMP)
I t generates a set of horizontal fragments that
include each and every tuple of original relation.

Fragment 1
Employee
with Dept. No. < 20

Fragment2
Original relation Original relation
(Employee table)
EmployeeAge
with Dept. No. = 30 (Employee table)

Fragment 3
Employeee
wih Dept. No. = 40
ala Reconstruction
Fragmentation process

Fragment 4
Employees
with dept. no.> 40

Fig. 15.5: Complete horizontal fragmentation

(a) Disjoint horizontal fragmentation

lt generates a set of horizontal fragments where no two fragments have common tuples.
That means every tuple of relation belongs to one and only one fragment.

Ces easy-solutions
Database Management Systems Qulck Read
(SPPU_IT)
Example: Vertical fragmentation can be specified bu
PROJECT' operation of the relational algebra.
Partition 1:All employees
having Age 18 or less. Example:
Ri-OEmpAgece 1e(EMP) Select Name and address of all students of computer
Partition 2: All employees
below 65. having Age above 18 and branch.
TName,Address (students)
Rz-OEmpAge» 18 AND EmpAge (EMP) (3) Types of vertical fragmentation
« 65

Partition 3: All
employees having Age above 65. o Complete vertical fragmentation
R3-EmpAge >» 65 (EMP) It generates a set of vertical fragments that
include all the attributes of original relation
Fragment 1 and share only primary key of original relation.
EmpAge= 18
o Consider relation with following schema

Fragment 2
o Student (sid, Name, Age, Address, Phone, class,
Employee Emp Age> 18 fees)
table
AND EmpAge < 65 1 Tsid, Name, Address (Students)
Pa Tsid, Age, Phoae (students)
Fragment P3Tsid,dlass, Fees (students)
EmpAge >= 65
(4) Reconstruction
Fig. 15.6: Disjoint horizontal partitioning To reconstruct the original relation weneed to
(4) Reconstruction process for horizontal fragments perform FULL OUTER JOIN ( ) operation on
To reconstruct the fragments.
original
relation we need to
The
perform set UNION (U) operation on fragments. original
relation can be reconstructed if and
only if completeness constraint is satisfied that
The original relation can be reconstructed if and means there should be either one column which is
only if completeness constraint is satisfied. common between two partitions.
Example: Consider relation shown in complete Example:
horizontal partitioning we can reconstruct relation Consider above relation we can reconstruct relation
as it is satisfying completeness constraints as it is
satisfying completeness constraints
R-RURUR,UR, R-PP2Pa
(B) Vertical Fragmentation (C) Mixed (Hybrid) Fragmentation
(1) Introduction
(1) Introduction
We can mix two
Vertical fragmentation divides a relation vertically
horizontal and vertical
types of fragmentation ie.
into group of columns,.
mixed fragmentation. fragmentations yielding a
When each site does need all the attributes
not
of a This
fragmentation is generally used in man
relation, vertical fragmentation is used to fragment applications.
the relation vertically by columns, (2) Overview
It is necessary to include primary key or some Mixed
common candidate key in every vertical fragment to in relation.
fragmentation is group
of columns and row

reconstruct the original relation from the fragments, Mixed fragmentation can be
(2) Overvlew
and 'SELECT operation of the specified by 'PROJEC
relational algebra.
Vertical fragmentation is group of columns in
(3) Example
relation. Mixed fragmentation can be applied to student tabie
for
following student schema;

es0asy-solutions
 Quick Read
Management Systems (SPPU_IT) 57
Database
all student's branch details of IT
Student table (d) Fragment 4: Find
Branch.
Sid SName age Branch id Bname
F4Tsid, Branchid, BName
(OBnamee "1T{student))
Student table contains information about student Sid Branchid Branch
and branches associated with particular student. 4 20 T
Branches can be Computer Science (CS) or IT IT
5 20
branch.
20
Table: Student database 6
(4) Reconstruction

SName Age|Sid|Branchid Bname To reconstruct the original relation by performing

OUTER JOIN (Pa) operation in
Union and FULL
F Smriti |20 1 10 CS-F on fragments.
appropriate order
reconstructed if and
10 CS relation can be
Jay 242 The original that
constraint is satisfied
only if completeness column which is
Asbok. 223.10 Cs means there should be either
common between two partitions.
one

Neha 21 4 20 IT Example
fragmentation we will first
To reconstruct above
20 5 20 ITF details of
RaRaj Fiand F2 which will give
find union of
me

all students.
Faarshad23620IT
F1UF2
Student details of all
students in 'CS
(a) Fragment 1: Sid SName Age
Branch. 1 Smriti 20
(OBname= cs(Student)) 24
FiTsid,SName,age 2 Jay
Sid SName Age 3 22
Ashok

1Smriti 20 4 Neha 21
2 Jay 24 5 Raj 20
3 Ashok 22 6 Harshad 23
in 1T of or department in which
2: Student details of all students Now, we will find details
(6) Fragment taking Union of Fs and F+.
Branch. student study by
(OBname= r(student))
F2 TSid, SName, age FaUF
Sid Branchid Bname
Sid SName Age
CS
4 Neha 21 10

20 CS
Raj 10
Harshad 23 10 CS

all student's
branch details ofCS 20 T
(C) Fragment 3: Find
Branch 20
"CS{Stuaent))
BName (OBname =

20 IT
3 S i d , Branchld,
Sid Branchid Branch two tables
main table we Join above
Now to reconstruct
CS common
column.
using Join ( ) with help of'Sid'as
10

10 CS R (FUFa) « (Fs UFA)

2 CS the original relation
as in
Above query will
returns
10
table: student
database.

Ces easy-S0lutions
Database Management Systems (SPPU TU s8
Quick Read

Chapter 16:NoSQL Database

a.1 Write a short note on Intemet
database. In internet databases data management is separated
SPPU-May 18, May 19, 4 Marks from presentation.
Ans.: Internet Database
This Improves the efficiency of the application.
1. Introduction
Updating data, finding information becomes very
Large amount of data can be easily managed by easy.
database technology. Example : Employee database, airline railway
The
internet web is a good way to present
booking, e-commerce etc.

information to the user. Web-To-Database Middleware (ColdFusion)

Web server determines the

Server computer
page contains script language
and passes the script page to
t h e Web-to-database
Script middleware
page
Web-to
database
middiewaro
Web serve Web-to-database
middieware
HTTP receives Web server connects to the
page request
database
Web browser request TCPIP web server sends HTML
the HTML-formatted pag
do passes
tre query
HTML
network
page to the client
page

Web-to-database middleware
passes the query results in HTML
format back to the Web server
The result of the(4)
database query is RDBMS
Database server
displayed in HTML computer passes the query RDBMS
formal results back to
the server
Web-lo-database
middleware

Database)
Fig. 16.1
Cold fusion application middleware helps us in following ways
o Through web pages we can connect to a database easily.

o Data can be represented on the web page in any format.

Dynamic web pages creation, updation becomes very easy.

o Relationships, referential integrity etc. can be easily defined.

o Database fields can be easily created or deleted.

o Following Fig 16.2 shows thathow cold fusion works in internet

databases.

es asysaIouos
 59 Quick Read
Database Management Systems (SPPU_IT)
ColdFusion
processes the
Script page and ther
connectS to n e e
sorvices
equesled service
Server Database
computer Script
Client page server
Computer Web serer
-mail
receives
request
systems
HTTP NETWORK Directory
page
Web server
ColdFusion
applicatiopn
systerns
quesy
TCPIP server File
Web browser network systems
HTML
page
COM
Web server HIMC
DCOM
sends the ColdFusion send page
HTML HTML formatted
Web
formatted document to the
Services can serversS
page to the Web server
reside in the
The result of the
Client Computer or in
same
database query is
displayed in HIM other computers
on a network (LAN
format
or TCP/IP)
6
Fig. 16.2: How cold fusion works ?

2. Web Server Interfaces

Common Gateway Interface (CG)

Scripts are nothing but small programs written in programming languages link C, VB, C++. Script files are used by
function. Client passes parameters to the webservers.
CGI to perform a specific
Application Programming Interfaces (APIs)

efficient and faster than CGl scripts. APls are implemented as shared
APls Web server interfaces are much more
APl and cGl web Server Interfaces.
code or as dynamic-link libraries (DLLs). Thw following Fig. 16.2.3 shows
The API And CGI Web Server Interfaces.

Web
Client server
computer computer

HTTP
API Web-to-
page
Web server database
Web browser
Teques
TCP/IP cGI midtleware
network

HTML Web server

page interface

RDBMS RDBMS
computer server

Database

Flg. 16.3

Ces CaSy-solutions3
 61 Quick Read
Database Management Systems (SPPU_IT)

Mobile Environments
Characteristics of
special characteristics that must be taken into account when designing applications
Mobile devices have
some

for such environments.

Shared data

MU Mobile Unit
Wireless network
Wireless range
-data packets
Range of
radio signal

uOloeu o
MU

Fig. 16.2 : Mobile environment

be intentional or
Intermittent connectivity can
1. Battery
unintentional.
Applications must be designed to be as energy
in areas
the limited battery Unintentional disconnections happen
efficient as possible due to
cannot reach i.e. no coverage
devices.
where wireless signals
power of mobile
area.
should therefore be
The mobile applications .Intentional disconnections occur by user intent e.g.
idle and save CPU
designed to stop processes when when the mobile
during an airplane takeoff, or
usage when possible.
device is powered off.
to battery size, and
Battery life is directly related 4. Server connectivity
to the mobile device's capabilities:
indirectly related
keep track of client locations in order
also reduce power consumption by Servers must
Caching data can
to efficiently send messages to them.
eliminating the need to make energy consuming
location
wireless data transmissions for each data access Client data should be stored in the network
that minimizes the traffic.
2. Data rate
which mobile units and 5. Memory
The wireless mediums on
environments
stations communicate have bandwidths
Applications nmust be designed for
bse that have less storage space and dynamic memory
of a wired network.
significantly lower than those
environments; this can be done using
of mobile systems is generally than desktop
Hence the data rate
and reuse of code.
memory-efficient data structures
low.
must also be robust, since users
Applications
3. Client connectivity
maximum generally find applications that crash easily, very
must be designed to provide
tedious to use, especially so because devices
Applications are

to mobile device or
user
mobility usually always on.
environment,
Applications are designed in wireless
and limited connectivity.
have lower data rate

Ces easy solutions

 Database Management Systems Quick Read
6. User interface
(SPPU_IT) 62

services at lower cost without investing lot

of
Applications must be
designed for environments upfront setup cost.
that have small User will pay only for computing resources which fs
screens and input methods that
differ from those
of the desktop environment, for actually in use. So, Organisation requires paying as
example the 12-key numeric keypad, they use computing resources.
keys. stylus,
and soft
3. Qualityof Servlces (Qos)
In addition, there are different kinds of Cloud computing will provide best possible services
devices,
which means that attention must be
various display sizes, different
paid to the to users. Cloud computing service guarantees 24x7
keyboards, and the availability, provision of extra computing resources,
different look and feel of devices.
Good performance.
7. Execution of applications Customer can change cloud computing platform at
Applications can be interrupted by, for example, an any point of time based on the quality of services
SMS or a phone call. provided by vendor.

These events cause the application to be moved to 4. Elasticity

the background. For situations such as these, care Cloud computing offers elasticity in adopting
must be taken to ensure that the application can changes in computing resources as workload
recover from the situation smoothly. changes by acquiring new resources and releasing
Q.3 Write a short note on Cloud database. extra resources in an autonomic manner.

SPPU-May 18, May 19, Dec.19, 6 Marks In general for cloud computing or for cloud
Ans.: Cloud Database application Cost, Quality, and Resources are basic
parameters which require elasticity.
What is Cloud?
5. Customization
Cloud refers to a network, internet or
There are thousands of users are using cloud at Sam
communication medium through which we can
point of time. This environment requires lot of
access computing resource located at remote
customization for every user for giving data
location. security
and simplicity for accessing data.
Cloud can contain services like email, storage and
a.4 Write a short note on SQLite database.
web conferencing etc.

Cloud Features
SPPU-Dec.17 May 18, Dec: 19,4 Marks
Ans. sQLite Database
1. On demand services/self service
SQLite is a free open souce RDBMS
engine.
On-demand service refers to the service provided by
SQLite is a
self-contained, serverless, zero
cloud computing vendor enables user use cloud
configuration and transactional
SQL embedded
resources on demand whenever they actually need
RDBMS engine.
it
sQLite implements most of the
In on-demand self-service, the user makes use of sQL-92 standard tor

online control panel to accesses cloud services

SQL
The SQLite library is small. It takes less
It is possible to upgrade o r downgrade
the cloud than 500 K5
space. Moreover SQLite database is a single ne
services as organisation needs it without investing
which we can
lot of extra cost.
easily store anywhere in the system.
sQLite file is platform
Pay per u s e pricing model independent and can be easily
2.
portable. It supports many
Cloud Computing is affordable
for start-up or small operating systeems
irrespective of their architectures
to use infrastructure and bit. i.e. 32 bit or 64
scale organisations

Ces0asy sofutionS
 (SPPU_IT) 63
Database Management Systems QuickRead
Education and Training
C programming language
is used to develop SQLite.|
for many different and popular Simple and easy to install and use. Open source,
It has support
like Java, C++, C#, Python, VB, TCI etc. Very small in size. Hence very useful for education
languages
source technology the source code and training
. A s it is an open
available for public. Prototyping and extensions
of SQLite is easily
. I t is very useful
in memory constrained gadgets As it is lightweight, platform independent it is good
as cell phones, PDAs,
and MP3 players.
such for experimenting
Transactions are AClD even ir nterruptea y G o o d file archives

system crashes or power failures. substitute for ZIP archives

SQL lite can be used as a

Features of SQLite or Tarballs.

after system crashes
Ensures ACID properties even
in brief the advantage of Mongo DB over
Q.5 Explain
and power failures.
RDBMS, SPPU-Dec. 17, May 18, Dec.18, 6Marks
No setup or administration needed.
Ans.: MongoDB
Small size.
MongoDB is an open-source document type

.Portable and platform independent database

C++.
Open source. MongoDB is implemented in
and automatic
.FullSQL implementation
with advanced features. High performance, high availability
features. MongoDB has its
Support for terabyte-sized databases and gigabyte scaling are the important
sized data. own ad-hoc query language with rich features set.
Large numbers of use cases can be easily handled.
Easy and simple to use API.
No external dependencies hence
self contained. Mobile applications, CMS (Content Management
E-commerce, Gaming applications,
Readable code and available in public domain. System), the
Logging are
Analytics, Archiving, and
Applications of SQLite applications areas of MongoDB.
of things
Embedded devices and the internet transactions are not possible in
Multi-document
can be easily used
With no administration, SQLite MongoDB.
televisions, set top
with cell phones, game consoles, MongoDB does provide
atomic operations on a

boxes, watches, remote sensors, robots,

single document.
automobiles, home appliancesetc.
is that, as a
The biggest advantage of MongoDB
Application file format uses all free memory
cache memory it automatically
be used on varlous
It is a cross platform file. It can available on the machine.
bit architectures.
operating systems, both 32, and 64 Collection and Document

Websites equivalent to a table in RDBMS. A

Collection is
websites having low to collection is a group of documents which exists
SQLite works great with
schemaless.
medium traffic. within a single database. Collection is
Data analysis Different fields can be created with different
it can be used to in collection. But ypically, all the
With full sQL implementation documents a
can be used for of similar or
analyze large datasets. Tcl or python documents in a single collection are

more complex analysis. related purpose.

Ceseasy-solutions
 falalna Manumant bynluia (6P T) Qulek Rend
A d Nent la nu of kuy valuw palra, Domunts doruments and J50N olbfecta are slmillar to each other
hava olynam auliwm Oher docsumants, arruys etc, can be Ineluded In the fleld
HDBMS mnolouy
with MongoDA wminolouy Valuus,
MDM Documents have followlng advuntagest"
MawgoDn
Due to embedded documents and arrays, Jolns are
Databasn Dalabasa AVoldad, Jence less oxpenslve,
Table Collur ton Document usts dynamle schoma,
Tupla/ow Dorumen n popular programmlng languages documents are
native data types,
Piuld
A MongoDB document Is as follows,
TaleJoin Pmbedded Documents
movle : "Hanuman",
PMmary Key Primary Key (Default key jd Ticket: 100,
provided by mongodb itself) Sereen 02,
Database Server and Cllent

Mysqld/0racde Mangd MongoDB Schema

MongoDB uses dynamlc schemas. Documents in a
mysl/sq1plus Mongo collection may have dífferent set of fields. Due to this
Doument Database polymorphism can be easly used. Without defining the
structure, 1.e, the fields or the data types of the
In MongoDdocument is used to store data, Each
documents we can create a structure. Adding field
document consists of fields and values, new
MongoD and deleting existing fileds can be
easily done.

Ces0asy-solutionsS