中山大学数据库系统与技术（1）课件第9章2 并发控制.pptVIP

Chapter 16 : Concurrency Control Chapter 16: Concurrency Control Lock-Based Protocols(16.1) Lock-Based Protocols Lock-Based Protocols (Cont.) Lock-Based Protocols (Cont.) The Two-Phase Locking Protocol 丢失修改（写覆盖overwriting） 丢失修改是指事务1与事务2从数据库中读入同一数据并修改,事务2的提交结果破坏了事务1提交的结果，导致事务1的修改被丢失。 不可重复读 不可重复读是指事务1读取数据后，事务2执行更新操作，使事务1无法再现前一次读取结果。 读“脏”数据 事务1修改某一数据，并将其写回磁盘 事务2读取同一数据后事务1由于某种原因被撤消，这时事务1已修改过的数据恢复原值 事务2读到的数据就与数据库中的数据不一致，是不正确的数据，又称为“脏”数据。 The Two-Phase Locking Protocol (Cont.) The Two-Phase Locking Protocol (Cont.) Lock Conversions（锁转换） 更新锁 更新锁（U锁，Update lock） 在锁转换中,一个更新事务读取数据项Q，获取Q上的S锁，然后修改行，此操作要求锁转换为X锁。如果两个事务都获得了Q上的S锁，然后试图同时更新数据，则一个事务尝试将S锁转换为X锁，由于另一个事务持有Q上的S锁，所以发生锁等待。同样第二个事务也试图将其S锁升级为X锁以便进行更新，需要等待第一个事务释放Q上的锁，从而导致两个事务都无法进行，因此发生死锁。 当一个事务查询数据以便要进行修改时，可以对数据项施加更新锁，如果事务修改资源，则更新锁会转换为排它锁。一次只有一个事务可以获得资源上的更新锁，它允许其它事务对资源的共享式访问但阻止排他式的访问。 更新锁 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