ConcurrencyControl.pptVIP

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.) Refinement of The Two-Phase Locking Protocol: Lock Conversions The Two-Phase Locking Protocol: Automatic Acquisition of Locks The Two-Phase Locking Protocol: Automatic Acquisition of Locks (Cont.) Graph-Based Protocols Tree Protocol Serializable Schedule Under the Tree Protocol Graph-Based Protocols (Cont.) Timestamp-Based Protocols Timestamp-Based Protocols (Cont.) Timestamp-Based Protocols (Cont.) Correctness of Timestamp-Ordering Protocol Recoverability and Cascade Freedom Validation-Based Protocol Validation-Based Protocol (Cont.) Validation Test for Transaction Tj Schedule Produced by Validation Multiple Granularity Example of Granularity Hierarchy Deadlock Handling Deadlock Handling More Deadlock Prevention Strategies Deadlock prevention (Cont.) Deadlock Detection Deadlock Detection (Cont.) Deadlock Recovery Insert and Delete Operations ?Silberschatz, Korth and Sudarshan 16.* Database System Concepts 3rd Edition * Lock-Based Protocols Timestamp-Based Protocols Validation-Based Protocols Multiple Granularity Multiversion Schemes Deadlock Handling Insert and Delete Operations Concurrency in Index Structures A lock is a mechanism to control concurrent access to a data item Data items can be locked in two modes : 1. exclusive (X) mode. Data item can be both read as well as written. X-lock is requested using lock-X instruction. 2. shared (S) mode. Data item can only be read. S-lock is requested using lock-S instruction. Lock requests are made to concurrency-control manager. Transaction can proceed only after request is granted. Lock-compatibility matrix A transaction may be granted a lock on an item if the requested lock is com