数据库系统概念5英文原版课件ch16.pptVIP

Chapter 16 : Concurrency Control Chapter 16: Concurrency Control Lock-Based Protocols Lock-Based Protocols (Cont.) Lock-Based Protocols (Cont.) Pitfalls of Lock-Based Protocols Pitfalls of Lock-Based Protocols (Cont.) The Two-Phase Locking Protocol The Two-Phase Locking Protocol (Cont.) The Two-Phase Locking Protocol (Cont.) Lock Conversions Automatic Acquisition of Locks Automatic Acquisition of Locks (Cont.) Implementation of Locking A lock manager can be implemented as a separate process to which transactions send lock and unlock requests The lock manager replies to a lock request by sending a lock grant messages (or a message asking the transaction to roll back, in case of a deadlock) The requesting transaction waits until its request is answered The lock manager maintains a data-structure called a lock table to record granted locks and pending requests The lock table is usually implemented as an in-memory hash table indexed on the name of the data item being locked Lock Table Black rectangles indicate granted locks, white ones indicate waiting requests Lock table also records the type of lock granted or requested New request is added to the end of the queue of requests for the data item, and granted if it is compatible with all earlier locks Unlock requests result in the request being deleted, and later requests are checked to see if they can now be granted If transaction aborts, all waiting or granted requests of the transaction are deleted lock manager may keep a list of locks held by each transaction, to implement this efficiently Graph-Based Protocols Tree Protocol Graph-Based Protocols (Cont.) Multiple Granularity Example of Granularity Hierarchy Intention Lock Modes Compatibility Matrix with Intention Lock Modes Multiple Granularity Locking Scheme Deadlock Handling Deadlock Handling More Deadlock Prevention Strategies Deadlock prevention (Cont.) Deadlock Detection Deadlock Detection (Cont.) Deadlock Recovery Other Approaches to Concurrency Control Tim