(LY rorage > Data ‘filed => The pars Stoves data in Fes on secondary ctorage. eviGentike hord chives These Giles are Longanizeds foto data blocks for efficient vebrival . 1 @) Butter Manager => The NN: ee. — + handles the santé € en is Land imemery Managing the butter nen +o i eee Operabons , > | Burry peiehict oe eS optimizer = + ze, rhe ermine mo. nt ex an. onder Y, uch. a atic cost estimates. — The:enstiring that tromiecHen each othe and ma 0 j Manager encure the Qurability of date buy _tmpie me jque jke Mloi te - a ingsand __|| transaction roll pac! aecoyer from fo #) pata Dichonary = edata Gictiond 1 etadato Repesijtor ov metadata cre positore Stores “Qnout the database's Structure pntor ma HO tndudind ad 5| cchemas papleS indexes constraints and provid abase access ao hips. | jbo the Dems Compenenht . 4 Seeurihy :MAccets contro) = The DBMS enfo access cantrel| mechanic’ fo entore Quthorjsed Laecess 40 the database / including uses Authorizabion and privilt Inept Fica io OD=r Se Es acess OF fal perina Application Dr09ram | Autnorisation | | Contro) |. | watabare manager |—SJemmand |, sfrniegng | _| Gea LETT creme | |Gi DAMc Sucterm archite fur dependence , Allocoing user to interack ough_high- level langua9, Q about the underlying Storage The architecture fnctudes forcing data _jntearity rough (od integri oupes ~ GB) Efficient | Data Accets ! The architecture {n Corp LU i e iques ,querd imizatid e data accct f Hand actrival. 1G) Concurren b Access and Recovery — Tne hitecture includes concurrency contro! and eceey mechaniim¢ to handle ‘concumen la | | tronsachions ond “bniuie data Consistency, and Gitab te .2: || Datohore Tnstallapron and Configuration, DBA are réetponcble fox installing data ———_| management syuctems CDeMs) and Conk n ring them Qerording to the orgar 2atfg needs. This involve s setting up the eg Nardeoare and tofttware ‘omponen!S 5 Optimizing custem = paiametersiOnd ensuri pow pes connet vi td 3. | Security Management - D&A ore respo for Securing’ die databates daains bitin all i ged a cess data beaches ond othes seep _Hhveats They define and implement acce f Control ipolicres, ucer es permis— —eare-“eitidgn dala tehisval gg ae II They analyze query e) S540, parame fers nhaoce +o MOSAL, Queries. to ¢ 1S uster—pettirmance ond vesponces Himes, ap) > Hf Otenance and Miaratron - pot tranciHon. n -Uparadina ox tran. envindment: Troubleshooting : DBAs mk +o ide ort or ace Files ose. and resolyares based ovusage par 1 Od businese needs. “They plan an scalability Colubions Such @ | Partitioning, Cluilering o7 sharding emeodate Inccasing “data Yolumes = om Cemands. | Come liance and Requlahions - OBA ensure) | aya tne databases Adhere +n % Lesequlahions such acdata privacy lacos GpPRr) oF industry ~cpecific Compliance- a S . S a < ; ” (a) Gene a ze | Pxample Of Generalizabon iz eralnenity footie’ and per Clast ofExaticl e of Specialization Account > a > | Se a € |, Bronaction (Geo-ne) Lv Gee-no) Balane D Cpeacializalfon ita process of defining a. McG clotses of entity tape, thiy ehuty typ led super class of speacidti2zaton. LC ples as SUbdlawses that forms O ee D¢ a ined of acts INquishi yatterisHes oO jn the err Class. ipahion cooxks 7 -down ey ‘ ies. aé] need of Nowra!) Mol }ration~ ao _| Nowmalizatenic ocructod Concept 30: database _| managemenk ems ). Dares | orqooizin Betclent im inh and en © i! _perfoxmance. Tie. ae be weatons cohy= NoATMalisdhon 1G MeEcesary jn pBMS: 7 ta ret sto ot) tiple placet epithin ba inco Ns igten aind ‘po tenhal q_data arge table | Wea Wala bo te.4 dekining aclationshi ps betw yd enforcing data inteqrity . con - vimary ret and foreign eeu __@_8y eiminating ciedudant dato and ott ___Tegeiationchips normalization prevents deta 4 | anomalies and encure that data -semai | Concistent and eliable - @ | Eohnancing Datahare performance ~ 1® Normalized database are stuchned inae ___ that allows for etticient data tetrival and al) related tab)es. a upp) ie Oe Buy avolding reduda or conflict data fon promoles data accura and he -poseibtlity 0 ontradicto ommand!. mands are ai.belows weyTo create Database ___|/+ CREATE statement is used to create Meta ___| @atobase objects tite tanles, index and o this ttotements® used to create database Obj. eet yi) >t pi i te bee CREATE TABLE é “Table Name be + Ccolumn 4 datatype » Column 2 dale, i Columo ~ ndatotype) 5 if ¥ * Example : CREATE TABLE Employee f CEid INT, Name VARCHAR (20), | Age INT, y SS. CHAR a8). Sdlany DECIMAL (18,2 Ds 266—_ [+ Syntax» s = ALTER TABLE < Table Name Add column 4 datatype . ‘ ALTER Tadle 2 Table Nome> es i mf 1 New = data ALTER TABLE 2 Table Names DROP Column 45 * Example | AUTER Table Brae oe ADD Addvess VARCHAR, (loo) a i “Deep Bcd upset oh seater. onjects. Dann Commands Mn befxample ! pas) | Te wan to permanenHy remove +he_Ern, lowle that coe Cieabed, We'd use the fo: command DROP TABLE Employees b. RENAME Statement: To Rem Rename databa Objeck - Oa is porcible to Change the name of a ta olth or colthout data in it using a simpler RENAME Command, i @_Con rename any table object akany pr js “of Hime. t 10s —___@ syntax! a —______ RENAME TABLE < Table Name > To 4 New Ta Example : fa yi RENAME TABLE Employee To EPA gis 5| WENCATE Statement » To empty the davon tab Othe Toencate TaBLe command. Lstited to — delete all data ‘from. On exitingstable () Tt is pouible an do Some Octton roth ORo! TABLE command lout tt tosuld cemove com Aoble structure trom ‘he databaie, i,@_DEET_ Command soil a)s0.temove Gul dala from table but wolth DELETE data detetion. Con be rolled. back and turncate Acts a data _deleton voith no roll back Possible, | @ TE any delete triggers are detined nonithe table then He. brigg ens are not ered on the _| Kum cobe table. Turncate oil de-aliocake: memory Space. So hat the Free space con be | used by othey tables unlike the DELETE _ Commands. 2 © Syntax .: __ TURNCATE TABLE 4 Table Name 2 © EX. TwRNcATE TABLE emp; _@ Ven you ereeubd op hen you executed o poi statement, it bores effect immediately, as ib is Auto Committed _ 1 foto! the datotoate - Hence no rollback Operakion _ | Cundo) Can be performed tolth thee Set of Commands. view, Sequence ete.Compare Traditiona! elle. system wilky databases File Suster DBMS System @ this is the ‘tradttona) Dr method to store data way to roca keand éfles in the comp. = manage database __ @. | File system help toys») @n the DBMS! system —_ to store the data io swe can easily create the computer's hard disk. insert, Delete and_updat the data from the databa In File system it is @ _ In osms insertion — Cifeicult HO manipulate’ | delebion and modificakto: ig done by sar. __ Coz it is done manually ©) ric very Wieeicult +0! (G)! Me data ts secure tore the data under fin dpm: dhe! Ale System. Be t © Th file system lot oF G) There t+ no data __lsedundant dataare ——redandancy in availablel@nd nof BNA Rt ystem. mechanfsm FOr contro} on data redudancy6 Tn DBM ¥ a eniiea to Do eo 6] | Pile syste” big access unauthorised acc = Horisea “> -— author _ i Nery dificult once the data i stort bas Werghig tepicutt tO secovet it —_____—_——_— d) There is compareHvely a More Secuy jless: security io ale In DBMS ystem ©) dato in seile sustem “te| date in Bel js _very tnooniicten Sustem ig f § provides inconsistency ConsistenC2 T® Lok pe q Stud ent Department) it wil! {OUS fF OM “he Jere Mlude alt the CStudent dnd my from |theuninits tain - table £ Matching. ow « tab} Z| Fxplatr tnt ane, ang Normal 61.09 yp x nol bo itn example | CIOL a's. Noymati ia Hor Frosh Noxma} fourm (INF). 3 : Wis 180 “He chenolest torn Of Wovmalization mPlFfe SPeach attyibutes in 2. INF s Melation Stoles shat alr at mutt have | atom attributes vom the » tributes 1 relation Co Cinvisiole) values cand 1G tuple much haye a Ssinaile value domain of that attributes. A: sxclation a ——L Exactly ane vaiue for each att Re Ae Bo Sinos tales for data’ mn D2 th “osidinle Ghould ‘contain only i i0 INP i€ everqieroeo. Contaty A. Cdlumn Avisilblendata. Considey an employee table with columo co showy 1M diagrarn ,Thename, | veld ect ee bhp sganh Bi ichom ante Lh | enome Ram it E PRaM fas Seo wh vLumini mining Domain Re jundoney » The Ei (1) 1) fow scot tl Solve Utne group: redundancy 0Ce i tndomain value a1 it allows — only of ot) wolue “eros tne: ‘domain of thal tortie So, Nt toil! Solve all problems elated 8 ___| domain atdundancy’. Nested erclations Doihetimoved to convert heations in INF. 2] igecand inortna ee sen ned Nf neta iona Tare Be MINE | 2. Bn the Stcond no¥mal Form jail the in Ottri butts ave fury Functional tne primary yeu! ini te Example —fets Assume a schoo! con sto Bibi reaches and swe Sujechs Ahey beach . Bn Schoo) , a teacher Can teach move than | _obsectTEACHER tonle TeacHERstD tn the given ja Age is depender px0 pew i iolets dhe eng Subcer of a Candidate teu: ‘To con a Ane q ) it inko too Hanles EO fess ) SUB: , + ee A sine Biolog 4 Aah tu Engitsh iy N16 Hoy Compu her bile non: Poime atte ules TEACHERS 1 On TEA CHERAID whichis a funy loiter ane iven fable into ANF we decompose a TEACH ER -IDE TAIL vtabe + 1 2 TEACH ER=10 TEACHER -AGE E i o7 | sat See 4h BOs ie. | 2 ay at ‘) as bog wen Fd Fae aha ___ I) teatier. soa secr tanie: a fo. E ) MEACHE R2tD 15 '60 BTEC ti Elie fg) Chemistry | 25 i Biology i Aq y Englich 1 I 119 83. @ it Maths I 83. Computer.SS aes 2) trind Nowrial E ST pia xelalion Hotlt Seliniane fee eel hot conta? Jany transitive partral deper >. JOnf is used +o reduce the data’ duptica ae ch used tovachieve the data integ itl 5. gf there ts Noubondtive dependency” Ep non: prime LattHbutes 4 then the neato \ |b beliin dhe aia normal | forms 2 A relation feat? one of the following ‘cond Hoos very non-Frival Eunctton dependency Kom }. UKE HO Buper’ jew fy | eemmless 9. Visa prime abtibutes Bramplet _Ereployee — DETAIL table | EMp..10 Emp. NAME eMmpeztp 222 g Harry 201010 Me EY i Seephan e008 Gay lan Goo] cos kathavine 4 06384" - 666 (John 6200] | Super bey im the itable above: . PEMP-10 4 '§ EMp.10, EMP_NAME s if = Z ’ EMP.1D, Pee eee tists ty _Condidate vey! fEMP.1Dy Non-paime Othibuies - tn She agen tab! UL ath ibutes except €MP.1D aie _non- prtmae