OO << <<< NAME: B pRIyANKA 7 DATABASE MANAGEMENT — poit alot azeaincaer0 SYSTEM BRANCH: CSC~C ASSIGINMENT-2_ D] earapule ae dase Of the lowing Gt ob Auman depend ms Foe a yelatonal serena RCA/BiCD.E) =fAsBe, coe S50, Enh. Lot the candidate keys toe @. Step-L: @ ax SHOX with A> Ah=jay hope + At=paB,ch Boao + At=fn,8,00} cose 3 ATS fa, B,C O,E 4, Wahi rotons A deturines all athibults 1/6, 6 0.F © ee = B= {By Boos ets 1b bs B* does nok determine all athibutes, ‘ = cote jek ct does not deltarmine othe, athilbuks: @ oF L, ots fo} D aloes not detamime any altibule. ®etra erates. ESA => Lep at. ET Leak. As B,c => B'=ftyA/5,c4 BoD > ETSEABIC DKS SHE deturinty all athibo}s ae ,¢;0, 54 aaa — —pep — : nk ES eo OE Wnaliwldualty deituraine all altaowias °° ‘ aes ~ aN Candidate. Feuls Aexplany abd the ‘Two Phare Locking Footncol I . The & phase Locting 15. & concwrenrd} paved wed ° databases to enaue Seializabilty of. Lransaclion>: achelts oy cividing locking procus jie hoy phowts” Phases DL phose locking dGmnwwing phase A Wwansatkon can acquire locks bub cannot ele Yronsation builds up Lochs ik needs dusting phase 3 Siafoking Phase: + Qh Avansackion can release Leth bur canmok acquive ancy | nev locke: | z « Once a transachon releases fish lock ,i} Cannot veques) any more ecks Types of 2 phase \ocking. Si ape: are lots - A Skicter vention whee a transaction holds all jks exclutve lacks until tansactongs is commilted oy aborted. ) Rigorous 2PL: + Pin even Sticke Westin where @ bransacHivy holds bok Shove Gind exclurive ache unkl transaction commits Ov Aborts: + Grovanies Sich Seaalrcobatity,/ Sn stack 2PL coscading abouts clo hak orci. fy te 1,7, or f Ty wants to vead & write To wanty do wate X L . we Ya tr acquires vend lock on % IN growing Phare a waqrades to wiht tock Once Ty releases Weck. 7g paotiels Contioteney achieved: 3 Discuss about the, Multiple Gromulosity Con eerrenee} contro} poutocol allows Aransochons to locke dato at dijferenk loves of Apomulovity- 4b tepemies Lancugieney and reduces Lacking by allowing hansadions 40 acquive Weeks a} most level foe thei operabion. Shere exigt multi, oulaniky levels 3 oo le qa’ Ky levels in DBMS. hey are: * Table + Record . Cell. Table ¢ a EEEEE free Pe Gromubasiky meane cliffevent levels b\ clala where cmealles levels ave nested iy higher level. trade. dalabare —y te cords —y cells. |Sis a volts i yn ec 7 4 oe \, 7 Dala Values: . ay de o> ; + decendent, \s A Yack. cam be appled ol a nodes th ee dos ex's A node. Weve ave Une types of intenthon locks ) Intention shared (18)! St Yodicotes thok de ov muxe oxeluciree locks will be requested H dercendenk nodes Shoned ) Intention Exclurive Ce)y H sndeatts thak one or more excludve Iycks will be requested On desemdent noder- > Shaved Unteneion Peclueve (61%: Cusment locks fs locked tr shared mode bul one ov prowe exclurive locks will be mequeskd on descendent nocle- > do multiple gponulasity locks are aequived In Lopdown, veteard Wy lovltonn up: & Explain deletion ond inseston operations in Stal exlondire hashing with example) Sake Hashing: dhe hash dunctton maps toys $0 a aed nuradu ol} buckebs Fay bucket has a dined Hse , ant Inseefion ov cleterion Wolves uploading there buckelss 4) thant cledausets eddhacot ty, G hashing, : handles rowing ev.Tnseon i state Slashing: © Compute how value tee ber] Using hash funchon Cee). @ Map ‘he key to a bucket B Using heey) ® Place the key buckel 1@ AL buckel Ovelans, + Use chaining or vver{fou buckel~ Yq Hash table wilh 4 Buckets [o,8u 8 Bs) Sleey) = lay mod 4, Key) teed) |] Buckeb to lomedq=2] og, '5 is medqs3| 63, Ocletion tn state. Havnings © Compute hash valued} Ley). @ lecake bucket B where key should, nerde ® Seouth key in B G delete tk ® chaining 1s used, remove Key rom Uinked Uist Io delele ts feora above havh table compute, blis)=3 lotoke Bs and vemove I Extendible Havhing: fr numba of hath bib: + Gldoal Depty (00)! Sndicates nurebbey of bit, used wy hash dundion do index into clivectory Dynawei Cally adjust rurloe of buckets as datas! craws ov shines. Jt uses o Aivectony and, hash qundion , a voolable* Loco de pth (Lod: Specifics nuraber b] his used ty do Aherentiake keys in & parblertay bask el Anseyion: > Compute haa value of ku > B85 GH biks ch hark do locate civectony eniny avd bucket > N pucket apace is evphy ov nok dull: Inbed ~» tse © 4) Weagn = spit and rvediskiloute bey @ Lo=aoar double &O se | vedishaiule kay XP Qd= a Leap age =4 Coo, d1, 10, tt) {raed to (224 IG g heey) = Neeny wood + (aiinanys last a bh). KEN) teakteinayy) } pucket t weno | QQ Add S10 \o Bo wvedlows split & vediehtoute Ordckon: © Compote houl valle, of bey @ Vox divectony to locate bucket ® Remove ey @ Aa delelion > 4h buekel becotnes eenphy merge With same LO- 34) Lpr update divectony and reduce &D HQC \ EQ Odleling to-- | Whiv)= 10 (cormpuls), Locale Bie & yemove hy 4} Bip foceomes enapty eenerqe with aiblineyConst Br tree Yee the +ollowing set of values! | (ar818) iM 1142324 3- AGEuME thal the bree is empty Janta, ond values oie adoled In ascencting orcler. Consbuct | obs ree Fee 4 dumloy vb puintuy ese Inset 9,3, 9,4 feaf node can bold up te 3 Hays. PANG THEM a3.5 Here ¥ SHI wom. Whin 71 inserted node oyertlows Splik leak node as ® Led pode fr3) © Right node 5,3}. Move Smaller vf vght (5) to pasant Mrs) tyset ML into Ught most leah 15,4, 11] 3 Node overtlows: SPA node ov @ kit 13/4) @ Bqhs tus} te rope Erallest of Aqht lt +o ae meres SRPHB! Anced NW rato AaHHMosh leah node b TSA whitey down werdlew Sep-4-. Ayotak A ote AHY TOY Leak Wwovt14) > Sb cloeaeie Neda KES Ynsve 23 into Ad most leaf Lu 131147) Node puesfloo spt Node an @ deh C19) & Right Tra, 239 capve eweallesy ob Aqht 14. to pos dept Ansuk 24 Inte toosk Rant most leaf a2) = lbecaw®s T14 /23/24) doesntk vilexflovy- —Il Sospat @ te Tt4,23) ©; Right T24r3t) Vavve smallest vl Wghh oI Now Ronenk Ts Mtg) over4 tows SpA © Leht T5in) Bight Tra, aa) Move Smabet of Rqhk [14) t _ a skep-ds dneeik at tno aAghtrnash of Trey 28129 (as) to. parent ~ | J. shod overflon| Qxne