0% found this document useful (0 votes)
24 views

DBMS Assignment 2

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
24 views

DBMS Assignment 2

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 7
ASSI (Start Writing From Here) GNMENT Primasy Inclex # Index_on_a_Set of field 2 Index that _i that includes the Uniay beimaiy Key and i$ wavantee! not to lontain primary index Ballet) have. Auplicetes dupliactes. # 906s not have_an impact on KReguizes the Yous in | data blocks to be ordered | hon the tows ave actrally | — Cn the index Hey. Organized in dota blocks 2 18 onl ria: 4 index. | SCondary Indexes. there ate no duplicts |_* thee Gan be dupliades | in_the _primasy fey. in_+e ary index. | bi)O«deved Indexing and Hashing ASSIGNMENT (Start Writing From Here) Static and yeas a. ci 7 se eae red pan. index ings Seandary indexin Cr. v = as cm ‘ein Avec t location of 1¢GulS en £xplain_ -in_delail about. Be bees -and_tsan Be Trees:- The Bt tee is a balanad binary Sarch tree. Tt Follows a oulti —Jevel index -fosmat a the Bt tree, lear node denote the :actual data Pointers: B+ sree enyres that all Mat rode vermin at the Sane height: sn the Bt tre0s the lene nodes are linked wing a hak — Nist- thesefores Q Bt 4x00 Gon Support seurkra acces 0s well as Sequential acces. Shuctine of a Bt yee _____* all D 5 er swir ASSIGNMENT (Start Writing From Here) ine era Pixed for every _ pipet Lett Contains an anternal nade and_leap nodes TaN eee eg [dn internal node of a+ bee bee (un atain at Least ne [-eCoxd pointers except the wot _node- [> Al most an inlerndl nade of tree Contains nl pointes. | ei | the leat node of Bee Gan (anda in at tawtnb reG@rd | Poindens and nfo hey values pla At mast sa teak pole Comtain'n’ re cad pounter § in'Key vchees Phey wot leap mde @rbins one block pointe? tp point -fo | next lens node» dexed Seiandial 4 Accoy’ Methad):- Wi ty \ at sosted oiler based _o e Qnd_an -index is maintained to -facilidate quick Seach Laperations: = The primasy advantage of Isam is Hird it. Combines [ise erat of both Sequential and divect acco lo | 84 Stens. i rted in pBMS to _ aekvieval ond insertion operation. a J ee (Start Writing From Here) Zethe_derecads in clla file_ate shred in sola cider _bosed_on Key Piel a) Index file: the index file_Qnlain jrdek: Lent ries ihich “axe pointers tn Bloke" in ape ‘datafi a Re Sotled Basted on key. Dovertlow frea:-This is used to Store Now = | Ose inserted beet Cannot fit into primary datd amen. Tt S also ewganized in Sexted _rnannes. ATA Re(ords. DATA Blocts IN_ Memory RL ARCOLA, RY AANCDBF RS {RS CoAKog Lea Bee pen AACDBE Explain -he ARIES Recowery Methed-When does a System recover rom a crash ?retn what ordes must a -bansaction 62 undone And redone? why iS this owler important? ARIES ReGvesy Metads proces §:- | Analysis phase. = Rusing_nownal opescitioNs ARIES eas iii by tracsactinns in th special Jog. fie. i iff whi L exe. iv ae parti i ithe, Crosh- T svar ripe x Redo | phaser. gr, = Sysleor sedoes all captertes “Lad Laske tepiald but not yet written to dick at -the time of Che > _ -3:Undo pha: a . [dM fhe wedo phe, Anes lives banactions tha active bat nat Gm mited_at the time’ Of Cras hen_tindlees “Ihe _dfanges made by these ransa clio solling Back to Previowws Consistent Slate sr [3k system recovers tron a Cioih bee soe be ec Process ed Abowe: This happens automati are ov _yolled back: >the ercler_of tindo and sedo iS pedo finsts ‘then undo” ee of =the ordey:- aerv; aie weversed ASSIGNMENT {Sart Waiting From Here) 3 What ts aphaw locking Lees PL with —— Sdvicd opt proto al? ‘ — the & phase locking Oru) frotow! isa Donatengh eae _ Method ued in dvla fase Management system to_ensuse.—§ Raial’z of -hansaclios: Tt Consists of 9 phass- — Li Growing | = hangactions @quine_lecks on eae: ee them, But once toch is released, it Cannot be reacquired. I Tn this phase, we Cannot release foc KG, ——______—— once atansaction seleae _locksit Connat request any Additional locks: DBiferences between apl and Strict gpli- Two - Phase Locking pl) Acquives tock s dusting thonsaction Execection. exeartion. # lochs _can_Ce_yeleased | Locks es bepore the tromactapelerseel only afte, Grom ts sviT | | |Occka Scala bility -+Consistanay ASSIGNMENT (Start Writing From Here) More Scalable due _| lv lock release desing bransaction —| Cnsuse_@nsistenry through lock _ Based Synchronization

You might also like