UTTARANCHAL SCHOOL OF
COMPUTING SCIENCES
FZ,
UTTARANCHAL
UNIVERSITY
ASSIGNMENT ON :
Advance Database Management System
(MCA-C203-AS01)
Submitted To: Submitted By:
Mr. Kamesh Yadav Name : Sheetal Kumari
Class : MCA-II
Section: ‘A’
Roll No.: 76 =Y A Aatabase adyninistnodor camier out gevehat ociwticn,
and eporotions to erro Jhe inde ity, Aunty and
ovailabitity of the data tered Jn the dotabose-
Roles of the PBA tS
4 Databare Backup: N databare administrator ror the
neap ensibitity fe back up evouy data in the
database p ne currently + Thin is necessary , 6 that
operations ton be restored in Hines of dirasser
Br doumbime.
2 Ratobar availabitity * A database administhosorh har the
responsibility of enduring ddtabase -aceersibili ty
te user pom time Jo time.
3- Datobore nestore + Adatabore -cdministrotoh -hay the
derponaibiity of esteing a + from -o b ockup Made, |
then thou ds a need for it |
4 Ratabase design! A database cdminisinater has the
esponsibility ot designing « dotabere thot vruete
jhe demand of wor. Hence, showin brow ded ge
Adabare derigm b cecal proea pX on -odminithador
5- Rada moves A dotabase -odmininaor -hos the Nesponsibility.
of moving a dadabose set, ray from -a physical
bare to a cloud bare, ot from on edging application
3s 2 new applications 6 Dotobore ab grade + B dotobore sdmidsthator hos the
resp ommibility of wp groding dotobase softwohe flr
Whtn dhUu do a nto updote or then, 04 Jhid
protects roft wore hom Accubity breaches
+ Databore ppatoh + dn fimer of nee apgnode 40% dodabose
hott ware , the -dotabore dministhoter hor the
Dedp orsibil ty of ersuniny thot the doatabose Ayern
fondions poyectly ond works Jo lor ap org
gohs in the nes updote-
& Database seanity + Dotorela oe vomets , ond one major
rp onsieili ty of databose cotministthater wv te protect |
the data ond ensure -edequole se cumty an sn
gon gah on? s database
a. Lopadty splonming 4 B dotabose odministhater hoa the
dopomibility &y plonning 40> dnowaseh
)
+ Double Retonge ¢ Ot representa a weak Entity TE] |
E xc Omple
Shin dn on ER model of o Horpital - The enfiiea ane represented
In rectongular bereed ond are Padient , Terta ond Decker -
Bodh of these entities howe thein nespectuve oltribubea which ane -|
Padienta - Td { primaruy
hey), Nome, oge , wiat date
Teda- None Chrimaruy key), dade, result
Deder- TOU primauy key), nome, rpeciali gation
= —}—
The ndohorship bus diffrent Onbitin are neprotdted by o
Lomond Ahaped bne-
Aibibate Lombontrt nos U type of abtnibube 7
AY Rey Adtmibute > 9% is used $e nebnerent the main chahactenist
Of om tnbity. Se nebrentrda o primary key: The Rey aldai
de nepneerded by on dhipre with the tect yndelined |
2Y Lomperte Asribwte + An obibute that Composed of mony \
other abriude ja Prowm or 0 composite aliribute 94 is
represented by on Lip , ond these Uibre conmeded with
2n alibde- |
37 Muttivalued attribute: Bn altnibuite con howe more thon me vane |
These ottibubta are Frou sh a multivalued pitibate- The }
double Wibsre in ured to nupresent mittivaluedl attribute - |
4y Doiived Aiibate : An ottribite that con be derived from ster
obrlute ja brown ad o dunived piribute ot conbe neprecnted
bby a dosed ellipse -
Relationbih Combined hor “types of _nelation 7
(2) One~s0-One Relotionship + ore Instonce Of entity & har »Ptate,,
with enkly one Amatonce ob entity:
® One~$e-momy Reoombip: Be Snstonce of ahity hod
Audigy with me thon ene snptorce of entity
Ce) Momg - te- one Rdahiorrhip : more thon ene Lastonce of erdh
ror Delabioy with nly ene lnstonce of entity. ss
@) Mony- to-M Relationship: Mou thon ene istence of
enbity son the Aor nedohombb with me then
tme Jvatonce of entity on She Dight- : +-
. Ques Drow on ER di oghorm of on amivouity » |
| inate —
Aus 4: Explain the fonds merdol operationk of relotioral algebra. |
<7 Relational Agebna iv a wa delay wared procedurol qponiy
Ammguoge » St collects inskonce of rélationa or dn put
rd giver scwmrtncer of relations os output St user
Vorisurs operations Je porfermn Jhis acon. Sal nelational
ab gebra gery opsradions ort perfeved recursively
on ca elation » The putput of there opsrotions ib o
neo Artlation , ahich maight be qoumed from one an
mone Jnpuk ndotons »
Relational Rugebha Operations ade os pollouss
oO inary Relation ot Operations -
(a) SELECT (symbol: a) + Filter rows bored en a Ap ecifieck
Condition «dr aclicts tuples thot rcksfy she given
predicate -
(&) PRoSECT Cogmbel : 10) « Prajedion deeds rbedfic colemms
from table , nemoving duplicotta 4 neducing the
Foble 30 only include dhe Apedfied ratbibuber -
(c) RENAME C Symbol : p): hinges jhe mome of 0 table or dba
Lolunrns Thi, iA jportiuulorty veefal for quedes
Snvelving smutiple eperstions that might sthowise hewe
Srnbdh qu bus. nYypence »
® Rdotionat Algebra epsrotiens From Set Thesry —
Ga) UNION (U)= Merges dhe rows from due tables re prem
a new table 1 hemoving duplicates - Tne OU ginal tables
mush hove dhe ome A.chema+ o) INTERSECTION ee ON): oF defines a nelation Consisting. of
ao bet of all tuple thot orm Jn beth Sable A ond
yable @-
@) DIFP ERENCE C-): Subnada rows Jn one table fram onsthen,
rebutting Jn anes table shot Containd ows in the.
fimak dolole not present jn the decom . The tables
involved must howe dhe Some schema -
@) CARTESIAN PRodUETCX) > Combines eusry row of one table
Uaith Cathy 2 009 of smothen nedulting ina table shat
hoa the Combed rows of the two sriginak Fables
@D Binady Retest onal Shenations —
@ Ton (0A): Toining vodi ously noloted super from alifrent
nus on
Types of doin — ,
-Innw Join . Thue ore thre Fuyper of inner Jon-
+ Thdo join C8)
2 Equ jon
* Nakuhat join
~ Outen join’ Thee au. thre hyper of oder jen:
+ heft euber fot ( 24)
* Right ute join ( re)
© Fal Ode Yein (PL)
These op erat orn Prom dhe core of nelotional lg ebra
And wnderpin ewey mony of the operations in Sac
Lond other datobose yada don ogea , ollswing 4h
the Cuobon,monipulahon , ond nebrievel of data in
relational databose - ——__
QS: Exon the dotohore Libraries.
FP Datobose Ubnanier are roftvoare components or
omewerks that provide doela ond functiona Jo Jntenoct
auth Bbrwes—sim database from within a propiemming
Aenguoge “These Lbnrarien simplify dhe procas of connecting
Jo, querying , nd monipulating data stored in
databases. Some popular -databose libraries include :
> Sar Achemy A python Sal toolkit ond dhjek-Relabionah
Mobbing (oe) Ubnary that provider a high - evel
indrrpace for Inheradiong auth relational dateborea
waing Sa.
> Hibomate 2 A jova ORM tibnowy that Almpbipes databose
drbnadioms by mobbing jova chjeda to database
table. ond vite versa -
7? Monger® Driven: Db provides official drivers for variour
proqhomming J omaquoger Like python, jova, ond Node. Js,
allewing developers Jo Interad ud th Mongo dB datsbese
wring native Aomguoge Aonstrchs +
> Brblty Frome work + A.NET ORM bre that enables
developer to work auith dota in nelatenal databosea
Pring demon —Apedific objects , eliminating jhe need for
much .of She dotn- aces code -
> Finebore Reotimae Datobose SDK + Fincbore YEE SDK 4or
Vari ud Spletfern Like Andneih, TOS, ond wel tlewing
dtutleporr 4e Inktgnote neal-Jtime dotobose fondion olity
into hein opplicadi on «
|
|
