数据库课件lec11transaction幻灯片.ppt

  1. 1、本文档共52页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
* * * * * * * * * * * * * * * * * * * * * * * * * * * * Lock_X(A) Read(A) Lock_S(A) A: = A-50 Write(A) Lock_X(B) Unlock(A) Read(A) Lock_S(B) Read(B) B := B +50 Write(B) Unlock(B) Unlock(A) Read(B) Unlock(B) PRINT(A+B) 2PL, A= 1000, B=2000, Output =? Lock_X(A) Read(A) Lock_S(A) A: = A-50 Write(A) Lock_X(B) Read(B) B := B +50 Write(B) Unlock(A) Unlock(B) Read(A) Lock_S(B) Read(B) PRINT(A+B) Unlock(A) Unlock(B) Strict 2PL, A= 1000, B=2000, Output =? Venn Diagram for Schedules All Schedules Avoid Cascading Abort Serial View Serializable Conflict Serializable Which schedules does Strict 2PL allow? All Schedules Avoid Cascading Abort Serial View Serializable Conflict Serializable Lock Management Lock and unlock requests handled by Lock Manager. LM keeps an entry for each currently held lock. Entry contains: List of xacts currently holding lock Type of lock held (shared or exclusive) Queue of lock requests Lock Management (Contd.) When lock request arrives: Does any other transaction hold a conflicting lock? If no, grant the lock. If yes, put requestor into wait queue. Lock upgrade: A transaction with shared lock can request to upgrade to exclusive. Lock_X(A) Lock_S(B) Read(B) Lock_S(A) Read(A) A: = A-50 Write(A) Lock_X(B) Example Deadlocks Deadlock: Cycle of transactions waiting for locks to be released by each other. Ways of dealing with deadlocks: prevention detection avoidance Many systems just punt and use Timeouts What are the dangers with this approach? Deadlock Prevention Common technique in operating systems Standard approach: resource ordering Screen Network Card Printer Why is this problematic for Xacts in a DBMS? Deadlock Detection Create and maintain a “waits-for” graph Periodically check for cycles in graph Deadlock Detection (Continued) Example: T1: S(A), S(D), S(B) T2: X(B), X(C) T3: S(D), S(C), X(A) T4: X(B) T1 T2 T4 T3 Deadlock Avoidance Assign priorities based on timestamps. Say T

文档评论(0)

开心农场 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档