浙江大學(xué)數(shù)據(jù)庫(kù)系統(tǒng)概念PPT第十六章_第1頁(yè)
浙江大學(xué)數(shù)據(jù)庫(kù)系統(tǒng)概念PPT第十六章_第2頁(yè)
浙江大學(xué)數(shù)據(jù)庫(kù)系統(tǒng)概念PPT第十六章_第3頁(yè)
浙江大學(xué)數(shù)據(jù)庫(kù)系統(tǒng)概念PPT第十六章_第4頁(yè)
浙江大學(xué)數(shù)據(jù)庫(kù)系統(tǒng)概念PPT第十六章_第5頁(yè)
已閱讀5頁(yè),還剩22頁(yè)未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說(shuō)明:本文檔由用戶(hù)提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

Chapter16:ConcurrencyControlLock-BasedProtocolsMultipleGranularityDeadlockHandlingInsertandDeleteOperationsConcurrencyinIndexStructuresLock-BasedProtocolsAlockisamechanismtocontrolconcurrentaccesstoadataitemDataitemscanbelockedintwomodes:

1.exclusive(X)mode.Dataitemcanbebothreadaswellaswritten.X-lockisrequestedusinglock-Xinstruction.

2.shared(S)mode.Dataitemcanonlyberead.S-lockisrequestedusinglock-Sinstruction.Lockrequestsaremadetoconcurrency-controlmanager.Transactioncanproceedonlyafterrequestisgranted.Lock-BasedProtocols(Cont.)Lock-compatibilitymatrixAtransactionmaybegrantedalockonanitemiftherequestedlockiscompatiblewithlocksalreadyheldontheitembyothertransactionsAnynumberoftransactionscanholdsharedlocksonanitem,butifanytransactionholdsanexclusiveontheitemnoothertransactionmayholdanylockontheitem.Ifalockcannotbegranted,therequestingtransactionismadetowaittillallincompatiblelocksheldbyothertransactionshavebeenreleased.Thelockisthengranted.PitfallsofLock-BasedProtocolsConsiderthepartialschedule

NeitherT3norT4canmakeprogress—executinglock-S(B)causesT4towaitforT3toreleaseitslockonB,whileexecutinglock-X(A)causesT3

towaitforT4toreleaseitslockonA.Suchasituationiscalledadeadlock.TohandleadeadlockoneofT3orT4mustberolledback

anditslocksreleased.PitfallsofLock-BasedProtocols(Cont.)Thepotentialfordeadlockexistsinmostlockingprotocols.Deadlocksareanecessaryevil.Starvationisalsopossibleifconcurrencycontrolmanagerisbadlydesigned.Forexample:AtransactionmaybewaitingforanX-lockonanitem,whileasequenceofothertransactionsrequestandaregrantedanS-lockonthesameitem.Thesametransactionisrepeatedlyrolledbackduetodeadlocks.Concurrencycontrolmanagercanbedesignedtopreventstarvation.TheTwo-PhaseLockingProtocolTwo-PhaseLockingisaprotocolwhichensuresconflict-serializableschedules.Phase1:GrowingPhasetransactionmayobtainlockstransactionmaynotreleaselocksPhase2:ShrinkingPhasetransactionmayreleaselockstransactionmaynotobtainlocksTheprotocolassuresserializability.Itcanbeprovedthatthetransactionscanbeserializedintheorderoftheirlockpoints

(i.e.thepointwhereatransactionacquireditsfinallock).TheTwo-PhaseLockingProtocol(Cont.)Theremaybeconflictserializableschedulesthatcannotbeobtainediftwo-phaselockingisused.Toobtainconflictserializableschedulesthoughnon-two-phaselockingprotocol,weneed:EithertohaveadditionalinformationaboutthetransactionsOrtoimposesomestructureororderingonthesetofdateitemsinthedatabase.LockConversionsLockConversions:OnlyacquireXlockwhennecessary.ProvideamechanismforupgradingaSlocktoaXlock.Two-phaselockingwithlockconversions:–FirstPhase:canacquirealock-Sonitemcanacquirealock-Xonitemcanconvertalock-Stoalock-X(upgrade)–SecondPhase:canreleasealock-Scanreleasealock-Xcanconvertalock-Xtoalock-S

(downgrade)Thisprotocolassuresserializability.Butstillreliesontheprogrammertoinsertthevariouslockinginstructions.AutomaticAcquisitionofLocks

(CommercialDBMSUses)AtransactionTiissuesthestandardread/writeinstruction,withoutexplicitlockingcalls.Theoperationread(D)isprocessedas:ifTihasalockonD

thenread(D)elsebegin

ifnecessarywaituntilnoothertransactionhasalock-XonDgrantTialock-SonD;read(D)endOtherConcurrencyControlProtocolsGraph-BasedLockingProtocol–TreeprotocolMaintainpartialorderingofalldataitems.OnlyXlockGuaranteeconflictserializableTimestamp-BasedProtocolValidation-BasedProtocolMultipleGranularityAllowdataitemstobeofvarioussizesanddefineahierarchyofdatagranularities,wherethesmallgranularitiesarenestedwithinlargeronesCanberepresentedgraphicallyasatreeWhenatransactionlocksanodeinthetreeexplicitly,itimplicitlylocksallthenode'sdescendentsinthesamemode.Granularityoflocking(levelintreewherelockingisdone):finegranularity(lowerintree):highconcurrency,highlockingoverheadcoarsegranularity

(higherintree):lowlockingoverhead,lowconcurrencyExampleofGranularityHierarchy

Thehighestlevelintheexamplehierarchyistheentiredatabase.Thelevelsbelowareoftypearea,fileandrecordinthatorder.CompatibilityMatrixwith

IntentionLockModesThecompatibilitymatrixforalllockmodesis:ISIXSSIXXISIXSSIXXMultipleGranularityLockingSchemeTransactionTicanlockanodeQ,usingthefollowingrules:1.Thelockcompatibilitymatrixmustbeobserved.2.Therootofthetreemustbelockedfirst,andmaybelockedinanymode.3.AnodeQcanbelockedbyTiinSorISmodeonlyiftheparentofQiscurrentlylockedbyTiineitherIXorISmode.4.AnodeQcanbelockedbyTiinX,SIX,orIXmodeonlyiftheparentofQiscurrentlylockedbyTiineitherIXorSIXmode.5.Ticanlockanodeonlyifithasnotpreviouslyunlockedanynode(thatis,Ti

istwo-phase).6.Ti

canunlockanodeQonlyifnoneofthechildrenofQarecurrentlylockedbyTi.Observethatlocksareacquiredinroot-to-leaforder,

whereastheyarereleasedinleaf-to-rootorder.DeadlockHandlingConsiderthefollowingtwotransactions:

T1:write(X)T2:write(Y)write(Y)write(X)SchedulewithdeadlockT1T2lock-XonXwrite(X)lock-XonYwrite(X)waitforlock-XonXwaitforlock-XonYMoreDeadlockPreventionStrategiesFollowingschemesusetransactiontimestampsforthesakeofdeadlockpreventionalone.wait-diescheme—non-preemptiveoldertransactionmaywaitforyoungeronetoreleasedataitem.Youngertransactionsneverwaitforolderones;theyarerolledbackinstead.atransactionmaydieseveraltimesbeforeacquiringneededdataitemwound-waitscheme—preemptiveoldertransactionwounds(forcesrollback)ofyoungertransactioninsteadofwaitingforit.Youngertransactionsmaywaitforolderones.maybefewerrollbacksthanwait-diescheme.Wait-dievs.Wound-waitThreetransactions:A,B,Corderedbystartingtime.BheldalockondataitemY.ThenWait-dieWound-waitAacquireYWaitBrollback;AgrantedthelockonYCacquireYCrollbackWaitDeadlockprevention(Cont.)Bothinwait-dieandinwound-waitschemes,arolledbacktransactionsisrestartedwithitsoriginaltimestamp.Oldertransactionsthushaveprecedenceovernewerones,andstarvationishenceavoided.Timeout-BasedSchemes:atransactionwaitsforalockonlyforasp

溫馨提示

  • 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶(hù)所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶(hù)上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶(hù)上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶(hù)因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

評(píng)論

0/150

提交評(píng)論