Assigamens: 1-04 Name:- Pxanshu Pol Roll Noi- 2Losos F300 H~ Subject*= DBMS Q1 Detine transaction ancl explain ACLD properties of tronsactions A transaction is a logical unit of Re database processin the includes one of mofe database access cperatioity;, these include insertion, deletion, modification and stekrieual operation - The database operations Rot” form a transaction can be embedded within an applicator program - ACID propectier:- i) Atomicity:- Yt implies hed eithee all of the operations of the ‘transaction should execute | or none of Rem Should occur: , ii) Consistency:- The State of detabare before te execution of transaction and after the execution of transacti@n shold be Same- ii) Ysoletion'- A transaction must not affect ether Jrangaction S Tet ate otanniag parallel te it: tiv) Deseadility’- Once a trensaction is Completed! sucessfully The changes meade by transacHen pecist i dectabare -Q-2 otven a Schedule S fer transacdi wath Sek of vtec wd write re mete Se RAL) RIOD RAY) WILY) RLY) WLOO > Telertify , wohe Rese given Schedule 1S exyui veer Jo Sseseial Schedule or not ? Ane To determine if a gwen Schedule 1S equivalent to a seriol schedule, we need te check if Re fined oterult Of Re 4ronsaction in the given schedule is the ame a he greault of — Some setind execution o} the transachens - lets analyze Re given schedule S* REL) RIK) RAY) w20) ALY) WED: (i) RIOD: Transaction TL steads wie x: Gi) RLY? Transaction TQ cteacs value X° ip, RACY): Fransaction TQ vteacs value Y Gu) “Ww2ty): Transaction T2 corites value Ye ty) RLCY): Transaction TL oxeads value Y fur) WL) Jransacon TL vontes value x: Now let's ty + find a Sexied — Schedule Rot poreduces Ro Aame. orenult- One possible ceseiad Schedule, is follows : G) Transaction TL? RLOO WLU Gi) Trongaction TI: R200) Ry) waCy) RLY)This sesicl —Scheclule ensures ho the oteccadl and worte operations — ae Consistent teil the given Schedule. Now » lel's Compaxe fhe stesult. a ovate CS): RICK) Qa) RIL) WAED RIO) WIL) scieQ Schectetle + RIK) Wyx) RI) R2W) way) RIV) | The tine sterult of the stead and write > mbion in beth ccheclales ase the ame. Thereseres he, wen Sthedule 1S eqaiualert to he Sescial Schedule mentioned above: Qg-3 Whar axe distribued ctogodase 2 List odvarcage’ and gaia veplicadion ond dota -jragmnension. disad verciage> cet Saitable ‘ample Anag- A distributed database gystern consist of Collection of siter. Connected tagethess foygh a commurucafion neduork: Each side hos its own \ocad datab ore aiginbuded dadabare is “ragmertel indo Smoller doka Sexs: posms can and gobo! 4ransacten. handle both \oca pata Repl icotien.- Advandages:- + Foutk Tolerente . Ymproved Pechor mance + load Distr budion « olfline AccessDisadvantages’ * Consistency Tssued * Data update Challages + Tnereated Storgge dteyairemerdts : compet Consider a globes e-commerce platform ushere product information 1S oreplicated across multiple data centers This allows users from different regions to access Product details — qruickly anc ensiutes jeu folerence , in Core one data Center expedcencer downtime - WW) Data {rggmentedtien:- Aavantgger: - . ‘Tmpreved gpuory performance < Efficient Sto rage . cenabiigy + Customaahen Disadvantages = + Complex qe Optimirgection © Decta Acpenden’ >» Tnereaded Manayemenc™ Overheael < Haka Distribadion overhead Consider a Social media platform —echere sere profiles gute reg mercbed bared on efageaphical dteions:This allows the plotform jo eticiently manage and’ otelrieve ASO data for Used in. specific locedions cy quer perfor mance for stagione activities - Q@-4 Whak is deadlock 7 when does it occux 2 How is it deleted in database system ? How can it be avoicecl ? ' Fins:= Pendlock:= A deadlock in a database System ores when two of more -Yronsections arte Bocked: eoch waiting ter Me lest to orelease a dtenowtce, ocosul ting in a circulate waiting Condition: + mutual exclusion * Bold and wart + Mo powemption © circalast Goadt + Timeout Mechanism + Weit for ayregh « Resource Allocedion (waph Avsidonce of Dendlrcks in Dede! hare ema Sock Timeout + ghrick Twoo- hore locking protocol . geadtock —Preverchon - Deadlock Detection and RevolutionQ:-5 Explain Seualizabilidy ot Schedule and discuss its tyre ; Tr the Context of databure vansaction « Serial “aobili}s) is a Properly Rot enswies the the. ‘execetion of concwurent Aransaclion produces a ~ ocenalt eqaivalent fo Some social ordet of - hen exeactions - es of Seriotizability:- fing: * Conflict Sesializability * View Sedolixzability * frecedence — Gtroph Example? = Considext teoo tronsachons TL and 12 with the fellocsing Schedule : Tis RIAD, WLAD, RB), WIB) Ta: RUB), w(8)) RUA), WIA)