UNIT-V

Ddabase
Distibulcd AND clent-Sexver
Dasobase Sjsloms, sbudure,|
Need for DistuteI
and Di sadvan ages DDBMSS
of DDBMS
Avontoges
data base Sstem is a Collecbon oP
A D:stibuted
that afPRaars to its users as a
independent dakabases

Single database System daBabase in shich

which
Dalabase is a
Distributed
devices that are not locatd
locald
dda is stored in storage is
S
but the data.ba.se
inthe Same PhySi cal locaboo,
Controlles USing a central dalabase management, stem
D8S) in multiple
A DiStibuted dadabase may be stores
A
locatio) or may be
Compulers lacated in the Same Phys:.cal
network oF nterconnected ComPuters
dispersed over a
Barch dstsbuted datalbases ae
Distr butud Dtabase, Heag
SRE
EBDDDDl sed ba bgon?zakions that
have man Pkces in
dFevent &cogmphcol localims
* eve indivdual brandh 'nte
Tocks Primaril sh the
eata that Pertain to is
Osn locotion and the head

Brandh 2
ofRceoPkce the o ComPon
must hoe access lb al
branch oPkces dals Prom ten
it The
loLatlon.
ma ad vantag of
n t e distbuted datd bose,
sstums is_Bhe
abilitoShare aacl dccCSS dala inl
 a reliable and ePkuent manne

Stnce of DDS Lor) THPCS of DDBH S

ADDBM6 are bas.cally dvided nto hoo major bpes 4

distributed dalabase sstem allouS Ppl:cations to access dálafkom

local and remote dalabasesS

Honogerous distibul ed datobase stem S
2) Aeterogerdous dstibuled dalabo[e
A Honcgenous dstribated
SuslonnS
Communcatan
dalabas e System is a
of nebao Chonne
o or more daabaseS oSamne
JPe that YeSide on oneor
nOre o racle 1g 0racle
machiaes.
*All Stes have idental SoPtwae
Dfacle
Commun: Calt
dhonnel HomogeneouS Distrbuzd Daa base
In
aHeleoganeaus distibuted datsose
racle tu
Sslun, dffecent dolabases rm a
S-Aa dtstibd database. astom.
Disbibated dalakases use clent |Served
DB architechue to Pro cesS inPormato O
Teuests
HetrogentouS Dstihted Detabose Sisltn D:Ffercnt siles ma use. dffcn
The SchemaS ond saPhoare.
Gommuni. Calion ConnecBon s that Provide the
Coab.l bes are called aks. The lok necessary dka trons{er
Stncue Provides the bas,
a Dstrbuted Dslabase
tonagement sastenn (DDEHS), shich is the architechue f
c

Ehat manogs the distrbuld dolsba.ses. stem safioare

asludas
Severa Camecal DDBS ae develope&;
The ConPonenES ofDDBHS are
ComPuliY workstatEions
2) Nehoork
Hordor and Salbo are omPoneatS
3) Comnunicabion tediq Links)-
 TranSochon Honogr (TH)
s) Scheduler
G) Dat tanagor (DH)
7) Data
TranSoci on 6.tel
TronSacbion Dala
TranS ack on n
seheduler THa

Transacen1
TranSachon. Scheduler Dsa
Transaciin Hana Hanages

TranSacbisn .
TranSachon
Hanager Scheduler Dala Sen
TranSachon n
Hoa
fach se in DD6HMS Contins a transachon manager (TH)Seheduler dala
anager (DH) ond the dalo. naintuned at that Site.TranSaction
manager Sends the
cenS ackns to dfert siles shere the necessa data iS available.
schedules d
is bo recive the tansathons from tronSachon
ranager and schedules the tranSackind
Eo daomanoggy .Dloa manager Serds the eZuests ko the diuba5c and
he is resposi
ble to Send batk the responses. The dala is Sent back
ough the Same chanrel.
Advantages of DDBHS
A distbuted datsbase is a neboork of detabases that are
log.call interalad,|
bt Phys catl Spread acro6Sa nebdork DDBHSs have Sgnkan advantagas includina
.

Dincreosed ova lobt y Dolo repl.cation is naintanivg Sevesal idenbcal copes of dala
:

ith each Cop btng stored ot a dfkrent site. "3Pcallj , replcation is

otoduced
o incease te ovailakili «f the $gstem hen a CoP is unaa:lable dut to
ste falurts, it should be Posse o octess acother
ors
mPoved relhabiltA5 data may e repl:coled so that t exists at more

han one Sile, the fa:lure of a node or a ComnuniCatio) lLink dees not necess-

-orild make the data nacces.ble.

3scalabil:b: deo s:tes can be added to the nebsork oithout apfectina the
Peraionsof oher s.tes Hence, he expansion aP he shale Syskeniscasier
 Remova af Site also doesno Cause much Problems
|4)Tmproved Commun Cations Local sites Promote betler omnuniCat: o) ar

depart menls and beboeen tustomers and emplajees as th e Smaler and

Smaller and

|located closer to ustomerS

s) Local Control A user does not know twhere the
dala S located Physic
the data to Uhe user as if it is located local.
-Call-Daa base Pesert s
stored s the oP
The site in which the Portion of data is
owner

the dda
C)Reduced operating Costs It is more Cost-effective to add
ork StationS to a nehork than o updali a mainlarne Sgstem
Developwment sork is done more cheaply and moce uickly on
ld)-ast
PCs than on
mainframes
Doala ogmentabo: Data kagmentation refess lo
relationss Can be Subdvided ond distibuted
relations oayin which
among neboork Sites
8) Secured manggement of distrbulad dola
Various ransparencies
Cika nebu0rk trons
ronSP& renA
Porenfroqmantation and
and tronsparen repkcation
repkcation
EranSPoren are
implemented to hide tha achal
detals oP the ahole
stbutad
implementation
dalabase Provdes Seu System n Sudh way distrbuted
of dala .

Compled ith ACID Properties

:Distbuted tronsactions demands|
Atom. c, Gonsisten Solalion and Relabli oP transacions.
Dsadvantgges of
DOBMS ldraudback, lin.tabions)
ople XA distbled DBHS that hides the d:stibuled nalure
rorn the user and Provides an acceptable level of Per Pormance
relabl and avalab.l nherently more mplex than a céntralized
D8MS
2) Dala
2) Data integ Too much nebwork resources may be used to Complet
a ransaction in dstributed SystemS The need or updat q data în multple
5ites increase the Problems of dla integity.
3overhead CostS Even Simple oPeratons may reguie a larqe number of

Communicotions ond add:tional Calulations to Provide uni For miy n

dato across the differeat Stes. nCreásed Complexi means tat we Can
pect the Prourenent and mantenance Cost s for a DDBHs to be
hgher han thoSC Par a Centralized DBHS
Handing faluCS: Handling Pailues is a diPkult taSk. In Some
Case s, e may not distinquish Ste falue, nehaork Partibion and liok
Paulure
Seur:H The dada shave behween Sites ovey nebsorks are Vulhera
-ble to attack Hence, nehaork-ofniented Seuriky Protocels are o be
used based on the Sens;tiv of data shared.

Advantnges of Dala Disbribuion)

The Concept of Data D.str.butio) shouss the Prom nent Solution to

thiS Problem.The sllooing ase Some of the advantages oP dala

dstributi on.
Dlower Cost: Larqer organi zabons invest în expens,ve mainframe
and SuperCompulers bo anction as Centalized Servers.

2 Reliable; Harcsare Problems and Safbsare errors Can causee

Single Server Pro cesSing to mal Rnctio and Hail, resulina in a
Complete Sastem breakdon. Dstibutivg data is mare reliable,
Since muliple control en ters are spread acrosS e:fferent machines

ImProved Performan ce and reducad Processg

Computers are mited in their Performance and ePkcicn4
timeSigle
An casy
ay toincrease PesPswance is byaddrg arother CompdeY to a
nehoork
4) Mexible Individual ComP.ls that Com Prise a distibled nekoe
are Pre sent at dFfecent Jeqgraph:cal locations. For ex, an organ zatio
distributed nehaork CompriSing of three compus Can have each
machn i
wmachoC a dfferent branch. 7he Three machines are interconnected via
a r eableo
tdheBe af
procOES dala in_Parallel ereA
Toteret and
d:Pferent locations
The follouoing are th SOme oore odvant oges of Doda Ostribubant

Dafa Shosing and D:stibuted Control

Reflect S oganTzational stnucbure
*improved availabilty
SPeed up auen Pro ceSS.q
*E ConomiCS
Hodular arouath
Drs advantoges of Doa Disbibution
here is no wor about
Dwhen Services run on a Single Server
the data is Stmply Pre sent on hat mochine
data Sxnchron 2abion all
2)DPPerent data Pormats are used in different SstemS
emS

Since he dala is accessed

Fron a remote stem, Per formance is
reduced.
envionnent
4) Nehoor k trapfrc is increased in a dsbibuted
distr:bated dalabase-
s) Daabase optinization is diPhuult n a
Dems Poducts ore used
in diPferent Sstems ohich
D.Pferen
increa Se s the Cornplexiby f the sstem

T) Mangging stem Catalag S a d:Phuult task

8)Lohilere Covering a failed Sstem, te DeMS has to make
d
Sure hat the reCovered sstem is Consistent ith other Syston
9 Managg dstribated deadlock is a difkult task

XDistibuled Daabase Sstem Desgn Desan the

Data Replcabion; To make the data available for all the users,
Some dala is sto red i n m o x e than one place in d.stibuta dalabas
data replication chonges aPpl:ed a one Site
61stems. ThiS s Called
are Cophured and Storas locall betore beng forwarded and opPlked at
each of the raote locations
wth PasE, local acess shased data,
Replicaka) Provides user
Protects availab:li_of applicabions because allenate daka
and
aCCSS oplions exisl
Silc CommunCation Site 2
LinkS
S.te 3

Jww ww.
R2 R3 RI
Das Replication
PeS of Dala Reptcabien
The Terminolog sed n a Replicabion are Publ: sher
Di Str. boutor

Pabl.sher is
Sbscriber
a Server
which hosts the database shich acts as
a Source of data to distribute
among other dalabases
Dstibubor is Server hi ch hosts the databose hich acts
OS mediator behueen Publ:sher
dala from Publ:sher database and and subscaber I t receives the
Sends it to SubsC.ber
SubSciber is the Server wh.ch hosts the databases daabase.
Pub:sher |dist,.buter Sends the data to . wher
Data baSe replicahion can be
pesforwed in three deferent
Aas
)Snap snot repl:cakion
2) Mege repl.cabo)
3TranSac bional repl.calion
advantage S Rehabiliy
Fast resPon Se
*less daa moverrent oves nehok
lode decoupl.ng
xPeduced nchaork braffkc at Prme ti
Simpley EsanSacbons.
DiSodvantoges
Daka ConSisten
Dountinme dainq new replca Cieata)
ore Storage ne eded
*Lowe witE Puosnance
*ExperSive
 Client Server Hodel
Cient Server is a term used o describe
the
a
ComPuting model for
development of Cornputertzed stems
This model is
based on the dstribution of Runc ionS behacen tuoo
Pe s o independent and autonomous ProcesSors Servers ond clhents
4 Clent is an Process that reuests speGfic Services From
Sever Proce SseS
A Servers a Process that Prov.des reguested Services Por
ckents
cient and Server Processes
Can resde in the Same
or in di ComAt
Pferent comPuters Connected b a nehsork
Stnichre of client
Serverstems
A client-Server Sstem has basically three
Component s. The are
Dclent
2) Server
3) Communi cabon iddle
ware
c:entThe client is any Compater Process
that refuests Services
Fom the Server The client is
also knouon aS the
oppl.cakion, reflecboa the Pact that the end-usey Front -end
aith the client
pro cesS
uSually nteracts
nttracts

client Reuest
ResponSe
Hiddle wore Respan Retuest serves
Respon Se
cl.ent Sewer todel
Sevver
Seve: The
bo the clientsServers an Compulor ProceSS
The Server
applicakion, reflecig theis Provdinaservices
also knouon as thePrOviding Services
the background Services
fatt that the
Server back-end
Process
Process Provides
or the
ckent Process Prov.d es
Comm unCation middlew Tt is any Com Piler Process through
wkid
clients and Servers Commucal The Comuntaln middle sae,also kmun
 or the Communications laxers is made up of
as Mddle ware
dala
Severa tauers of Sofhwae that aid the tvansmiss.on o
inßation beboeen clieots ond Servers.
nd Control
the relation
s defred as
model
A
A client- Server
Compuler roq1ams that
Communical wit
-Ship behocen tuwo
each other ServiCe
service
clhents in: Eial the Communication by Send'na
The
euests to Hhe Servers
Hob.le device Cah also be Rinction as a client
dasaloaes Shored
Scrvers are usually devces sth fles and
OSde, includerg Cownplex applicatians ke webSbes
They have higher-Poueed cental Pro cessors larger disk
drives and more memonM Co MPared to the cleny
clien.
over a netwok
ThiS Client Server model oflen happenad
o ConPulorsS
The
The cient Server model Can be found in Runctions
Such
Such aS Cma: ekchange web acesS and datalbase access.

Nead
eed or dient Comgutig ond client- Serves Arcktedure
server
client-S erver ComPubivg oas Just us ainfranes and
Connec dumb terminals
The Term cltent - Server refers to a Salhoae arcditec

uCwodel. Consisiq of boo Part s, cl:ent Sstems and

oand
Sarver Sstems. These oo Coponents Con be nteacig n d

orm
for m aneboock
Oa that Connect mulbple usas.usi th*s
techno log, PCs ae able to Communtcal oith eoch other on a
nehoa K
 There are Sevecal e s of client- Server architechure.
Tisg-ter Arch:techue
2 Three-tier Architec hure
3 N - tier Architechure
arch:teckare
S
S

of the
OTwo-tier Architechure one

client is diectla Connected

the Tso-tier Archtechue, whee a Serve

clientl oDO
to a Server NehoorK
a Jood . LAN Datle
Ths architechure has WAN

APPlcabion develo pment Speeo 6ul+log

a.eSyl+Ls3
and worK wClin homo qanLous

environments tohen the uSer

client2
elentn
|PoPalaton LOoCk 1S Small. TLoo-her Archtethue
mulG i e r
Two-tier ckent Server is a yre of
-A ente aPPlication
architethure in which an
Compubin8
ComPabina tiers.
iS disbuted as hoo distinct lagers or

L t di vides he applicabon logic data and Proce ssig

oehocan ckent and Server device S
IP Hhe applcabion log:c is d:str;buted to many of
Clientstens the aPplcatia) maintenance be
ves
ver

HIn TuO-her Architechre clhent is called thCk client

Three-tier Architeckure To over Come the mitations
OF the ho0- bier.Architeche, a Thre-Lercakon server Oatabese
Oatbase
Architeckre is chet Nekoork
intnduced LAslAN
By ntre du g th clint Datbse
middle Ber clerts ons L cliet
Three- Ber AcckEeckre
 Connect only to the oPPl:cabion server instcad of Conneckng direcHy
the dala. Server
onnechon is remved.
His the load of maiotouning the
Bx 0ay, retrieve He
Server is able
to
manage the Storage and
The. daa.base harde
i0
dala well. ThuS, the aPpl:cahon log;c and PrOCeSSina Can be hald

Sstematically In three-tier Architeckae, client is

any aPplcabion
Called tn dient
enchance te Three-tier Architechre,
3)N-Tier Architeckr TO
Can be extended to
-tiers h e the
mi ddle ber Provides Conechars
bvoous ypes of services otegabna and Gouplthen to the ca
and o each other
Fof Cxample, oeb Server is added to
Three-tier Architechare o become Four tier
twcbsever
Archtechure here t e seb Server handles
the Connech on behsean appl:cabion Server
and the client
APP:Cahin
Server
users can be hondled at the
more
Some be Oabase
Server

AdvantogesS N-Eier Arch.teckure

The ddvantoges of clent
Server
Compat. a
i roproved datasharirg
2)int4arabon of Sevces
the locabion
doda Process. capabiliy despte
u) Seurd
S) Easy mainterane
G) Backup and reCovery Poss; ble.
Disadvantoges
Congesbon in nehwork
2) unstae
3 VeN expenSve bo install ond moR t s yfe of
 Cornp.g ntiost
Advanced Top.cS
t ulbdimenS.onal DalaboseS
mulbdrmensiona datgbase is a Speciol Pe of relational
database monagement tstem (RDBHS) shich Suppats dala to be
slored and retrieved as
mulbple dimensonS.
The The Simple relakoral
damodel SuPPorts only boo dimens.
nS oG and GolwnnS.
The dala oth n mulidmenSional daalbase S are stored as
a Cube
Mulbi dimenSonal datokbase is aPeof dabase that has
the dalaware house and oLAP.
is builtE daround C few Stmple
*mulGdimcnstonal analysis
dola andzabon Concepts sPeuhcal
Facts
DimenSion S
FaCES
FactS: AA Fact is an instance of Same Partiular occurrence
OF event and the Properbes of tha stored in a database.

Dimension S; A dimension s a k descrnptor an index, by twhich you

Can access fachg oacCordi«q to he Vaue, Jou oant
Dakuoae House :A datzuware house i s a relational daabase
Ehat is desaud b ue and anals:s rather tha r tran Sacbion
Processia Contans hisbr.cal data derved from transa
It usually
|-chon dat, bat tindude dat. Pom other Source6
dala warehouse retateeal environment indudes
an extraction, transPartaton, tanskrmation and lo ading an onljne analtid
and-ollérapPplicat ans a
Peo.cesSivg_ LOLAP)engiaLelent-analysis bools
 manage the Process of aalhering data ond delivenng it to business
Sers
Dala SouceS
users

oPeraiora
areouSe
Reporti

Flat Ales
Swma Dasa Hining
Heta
oPeakona

Oata usarehouse Archilecbure Ardlyss

GPes of Dala. uare house

EnterPr:Se Daa taarehouSe

) operabona Dala sore
3) Dasa Hart
OLTP VS oLAP
oLTP OLAP
xOnre Transachion
Processgonne Analabcal Processing
stem and manggus dalabase and
madifcoho 0)line dala rekrievng stem
*TS uS s o
inSertupdale, *Tt is useå to Entract daaa kor onaly2
Deleke inkimaion From the dalsbase that helps in decston
mak.
oLTP has short tranSacbionS*oLAP has long ranSactions.
*The Tobl ts in oLTP dakabase + The Toble s o 0LAP daaa.base mog t
must be normaltzed be nor wal2ed
I t shres He dala in bao&It slores the dolstn kulbdiménSoral
T
dnenSiauval a y 20.Eables 3 D ER: ube
 UNT V
imPortant Quesbons

Explan DO3 and Need er DDB ond its strcture

Od Arckhtechure
Advontases ond D Sadvont»ges ot DDBrts

(3) client -server model Stmchwe, Nead ond its advanto

4 Doso. r: cot on

AdronCed ToPiCS
HulhdimenSanal Database

2Ddoac house and ts THPes aud ComPare oLTP

Gd oLAP.
X

ALL THE BEST

Ind BcoHT Sen

RDBHS Falunal
OMEGA DEGREF ColLkE
For woHENS