1. 10 1 Chapter 10_B Concurrency Control Database Systems: Design, Implementation, and Management, Rob and Coronel

2. 10 2 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel In this part, you will learn: What concurrency control is and what role it plays in maintaining the database’s integrity What locking methods are and how they work How stamping methods are used for concurrency control How optimistic methods are used for concurrency control How database recovery management is used to maintain database integrity

3. 10 3 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Concurrency Control Coordination of simultaneous transaction execution in a multiprocessing database system Objective is to ensure serializability of transactions in a multiuser database environment

4. 10 4 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Concurrency Control (continued) Simultaneous execution of transactions over a shared database can create several data integrity and consistency problems: –Lost updates –Uncommitted data –Inconsistent retrievals

5. 10 5 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lost Updates Assume that you have a product whose current PROD_QOH value is 35

6. 10 6 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lost Updates (continued) Suppose that a transaction is able to read a product’s PROD_QOH value from the table before a previous transaction (using the same product) has been committed

7. 10 7 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Uncommitted Data The phenomenon of uncommitted data occurs when two transactions, T1 and T2, are executed concurrently and the first transaction (T1) is rolled back after the second transaction (T2) has already accessed the uncommitted data—thus violating the isolation property of transactions. T1 is forced to roll back due to an error during the update of the invoice total; hence, it rolls back all the way, undoing the inventory update

8. 10 8 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Uncommitted Data (continued)

9. 10 9 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Tue 11-3 Inconsistent Retrievals Inconsistent retrievals occur when a transaction accesses data before and after another transaction(s) finish working with such data.

10. 10 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Inconsistent Retrievals (continued)

11. 10 11 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Inconsistent Retrievals (continued)

12. 10 12 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel The Scheduler Special DBMS program –Purpose is to establish order of operations within which concurrent transactions are executed Interleaves execution of database operations to ensure serializability and isolation of transactions

13. 10 13 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel The Scheduler (continued) Bases its actions on concurrency control algorithms, like locking and time stamping. Ensures computer’s central processing unit (CPU) is used efficiently, not based on FCFS –With FCFS CPU waits for read and write operation to finish. Facilitates data isolation to ensure that two transactions do not update same data element at same time

14. 10 14 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel The Scheduler (continued)

15. 10 15 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Concurrency Control with Locking Methods Lock –Guarantees exclusive use of a data item to a current transaction –Required to prevent another transaction from reading inconsistent data Lock manager –Responsible for assigning and policing the locks used by transactions

16. 10 16 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lock Granularity Indicates level of lock use Locking can take place at following levels: –Database –Table –Page –Row –Field (attribute)

17. 10 17 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lock Granularity (continued) Database-level lock –Entire database is locked (good for batch not for multi-user DB) Table-level lock –Entire table is locked Page-level lock –Entire diskpage is locked –The most frequently used method

18. 10 18 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lock Granularity (continued) Row-level lock –Allows concurrent transactions to access different rows of same table, even if rows are located on same page. It creates overhead Field-level lock –Allows concurrent transactions to access same row, as long as they require use of different fields (attributes) within that row –Rarely done. It creates highest overhead

19. 10 19 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lock Granularity (continued)

20. 10 20 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lock Granularity (continued)

21. 10 21 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lock Granularity (continued)

22. 10 22 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lock Granularity (continued)

23. 10 23 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Mon 24-6 Lock Types Binary lock –Has only two states: locked (1) or unlocked (0) –If an object—that is, a database, table, page, or row—is locked by a transaction, no other transaction can use that object. If an object is unlocked, any transaction can lock the object for its use. –a transaction must unlock the object after its termination. Exclusive lock –Access is specifically reserved for transaction that locked object –Must be used when potential for conflict exists Shared lock –Concurrent transactions are granted Read access on basis of a common lock

24. 10 24 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Lock Types (continued)

25. 10 25 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Two-Phase Locking to Ensure Serializability Serializability : To ensures that concurrent execution of several transactions yields consistent results Defines how transactions acquire and relinquish locks Guarantees serializability, but it does not prevent deadlocks –Growing phase - Transaction acquires all required locks without unlocking any data –Shrinking phase - Transaction releases all locks and cannot obtain any new lock

26. 10 26 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Two-Phase Locking to Ensure Serializability (continued) Governed by the following rules: –Two transactions cannot have conflicting locks –No unlock operation can precede a lock operation in the same transaction –No data are affected until all locks are obtained—that is, until transaction is in its locked point

27. 10 27 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Two-Phase Locking to Ensure Serializability (continued)

28. 10 28 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Deadlocks Condition that occurs when two transactions wait for each other to unlock data Possible only if one of the transactions wants to obtain an exclusive lock on a data item NO deadlock condition can exist among shared locks

29. 10 29 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Deadlocks (continued) Control through: –Prevention :A transaction requesting a new lock is aborted (rolled back and rescheduled) when there is the possibility that a deadlock can occur. Recommended if the probability of deadlocks is high. –Detection :The DBMS periodically tests the database for deadlocks. If a deadlock is found, one of the transactions (the “victim”) is aborted (rolled back and restarted) and the other transaction continues. Recommended if the probability of deadlocks is low. –Avoidance :The transaction must obtain all of the locks it needs before it can be executed. Recommended if response time is not of high priority.

30. 10 30 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Deadlocks (continued) TIMETRANSACTIONREPLYLOCK STATUS 0 Data X Data Y 1T1:LOCK(X)OKUnlocked 2T2: LOCK(Y)OKLocked Unlocked 3T1:LOCK(Y)WAITLocked 4T2:LOCK(X)WAITLocked 5T1:LOCK(Y)WAITLocked 6T2:LOCK(X)WAITLocked 7T1:LOCK(Y)WAITLocked 8T2:LOCK(X)WAITLocked 9T1:LOCK(Y)WAITLocked … …………..……..……… …….… ……………..……..……… …….… ……………..……..……… …….… ……………..……..………

31. 10 31 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Concurrency Control with Time Stamping Methods Assigns global unique time stamp to each transaction Produces explicit order in which transactions are submitted to DBMS Uniqueness –Ensures that no equal time stamp values can exist Monotonicity –Ensures that time stamp values always increase All database operations (READ and WRITE) within the same transaction must have the same time stamp

32. 10 32 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Wait/Die and Wound/Wait Schemes Assume that you have two conflicting transactions: Wait/die –If the transaction requesting the lock is the older of the two transactions, it will wait until the other transaction is completed and the locks are released. – If the transaction requesting the lock is the younger of the two transactions, it will die (roll back) and is rescheduled using the same time stamp. In short, in the wait/die scheme, the older transaction waits for the younger to complete and release its locks.

33. 10 33 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Wound/wait –If the transaction requesting the lock is the older of the two transactions, it will preempt (wound) the younger transaction (by rolling it back). T1 preempts T2 when T1 rolls back T2. The younger, preempted transaction is rescheduled using the same time stamp. – If the transaction requesting the lock is the younger of the two transactions, it will wait until the other transaction is completed and the locks are released. In short, in the wound/wait scheme, the older transaction rolls back the younger transaction and reschedules it. Wait/Die and Wound/Wait Schemes

34. 10 34 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Wait/Die and Wound/Wait Schemes

35. 10 35 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Concurrency Control with Optimistic Methods Optimistic approach - used in environments with low data contention. –Based on assumption that majority of database operations do not conflict –Does not require locking or time stamping techniques –Transaction is executed without restrictions (no locks) until it is committed –Phases are read, validation, and write

36. 10 36 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Concurrency Control with Optimistic Methods (cont.) During the read phase, the transaction reads the database, executes the needed computations, and makes the updates to a private copy of the database values. All update operations of the transaction are recorded in a temporary update file, which is not accessed by the remaining transactions. During the validation phase, the transaction is validated to ensure that the changes made will not affect the integrity and consistency of the database. If the validation test is positive, the transaction goes to the write phase. If the validation test is negative, the transaction is restarted and the changes are discarded. During the write phase, the changes are permanently applied to the database.

37. 10 37 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Database Recovery Management Database recovery (managed through backups) –Restores database from given state, usually inconsistent, to previously consistent state –Based on atomic transaction property All portions of transaction must be treated as single logical unit of work, so all operations must be applied and completed to produce consistent database –If transaction operation cannot be completed, transaction must be aborted, and any changes to database must be rolled back (undone)

38. 10 38 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Transaction Recovery Makes use of deferred-write and write-through techniques Deferred write –Transaction operations do not immediately update physical database –Only transaction log is updated –Database is physically updated only after transaction reaches its commit point using transaction log information

39. 10 39 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Transaction Recovery (continued) Database checkpoints are operations in which the DBMS writes all of its updated buffers to disk Write-through –Database is immediately updated by transaction operations during transaction’s execution, even before transaction reaches its commit point.

40. 10 40 Database Systems: Design, Implementation, & Management, 8 th Edition, Rob & Coronel Transaction Recovery (Using deferred write)