Chapter 15: Transactions Transaction Concept Transaction State Implementation of Atomicity and Durability Concurrent executions Serializability Recoverability Implementation of Isolation Transaction Definition in SQL Testing for Serializability 标 Database System Concepts 15.1 @Silberschatz, Korth and Sudarshan
Database System Concepts 15.1 ©Silberschatz, Korth and Sudarshan Chapter 15: Transactions Transaction Concept Transaction State Implementation of Atomicity and Durability Concurrent Executions Serializability Recoverability Implementation of Isolation Transaction Definition in SQL Testing for Serializability
Transaction Concept A transaction is a unit of program execution that accesses and possibly updates various data items A transaction must see a consistent database During transaction execution the database may be inconsistent When the transaction is committed the database must be consistent Two main issues to deal with x Failures of various kinds, such as hardware failures and system crashes x Concurrent execution of multiple transactions 标 Database System Concepts 15.2 @Silberschatz, Korth and Sudarshan
Database System Concepts 15.2 ©Silberschatz, Korth and Sudarshan Transaction Concept A transaction is a unit of program execution that accesses and possibly updates various data items. A transaction must see a consistent database. During transaction execution the database may be inconsistent. When the transaction is committed, the database must be consistent. Two main issues to deal with: Failures of various kinds, such as hardware failures and system crashes Concurrent execution of multiple transactions
ACID Properties To preserve integrity of data, the database system must ensure Atomicity. Either all operations of the transaction are properly reflected in the database or none are Consistency. EXecution of a transaction in isolation preserves the consistency of the database Isolation. Although multiple transactions may execute concurrently, each transaction must be unaware of other concurrently executing transactions. Intermediate transaction results must be hidden from other concurrently executed transactions t That is, for every pair of transactions T; and T, it appears to Ti that either Ti, finished execution before Ti started, or Ti started execution after T finished Durability. After a transaction completes successfully, the changes it has made to the database persist, even if there are system failures Database System Concepts 15.3 OSilberschatz. Korth and Sudarshan
Database System Concepts 15.3 ©Silberschatz, Korth and Sudarshan ACID Properties Atomicity. Either all operations of the transaction are properly reflected in the database or none are. Consistency. Execution of a transaction in isolation preserves the consistency of the database. Isolation. Although multiple transactions may execute concurrently, each transaction must be unaware of other concurrently executing transactions. Intermediate transaction results must be hidden from other concurrently executed transactions. That is, for every pair of transactions Ti and Tj , it appears to Ti that either Tj , finished execution before Ti started, or Tj started execution after Ti finished. Durability. After a transaction completes successfully, the changes it has made to the database persist, even if there are system failures. To preserve integrity of data, the database system must ensure:
Example of Fund Transfer Transaction to transfer $50 from account a to account B 1. read(A 2.A:=A-50 3. write(A 4. read(B) 5.B:=B+50 6. write( B Consistency requirement -the sum of A and B is unchanged by the execution of the transaction Atomicity requirement -if the transaction fails after step 3 and before step 6, the system should ensure that its updates are not reflected in the database, else an inconsistency wil result 标 Database System Concepts 15.4 OSilberschatz. Korth and Sudarshan
Database System Concepts 15.4 ©Silberschatz, Korth and Sudarshan Example of Fund Transfer Transaction to transfer $50 from account A to account B: 1. read(A) 2. A := A – 50 3. write(A) 4. read(B) 5. B := B + 50 6. write(B) Consistency requirement – the sum of A and B is unchanged by the execution of the transaction. Atomicity requirement — if the transaction fails after step 3 and before step 6, the system should ensure that its updates are not reflected in the database, else an inconsistency will result
Example of Fund Transfer(Cont Durability requirement -once the user has been notified that the transaction has completed (i. e, the transfer of the $50 has taken place), the updates to the database by the transaction must persist despite failures Isolation requirement--if between steps 3 and 6, another transaction is allowed to access the partially updated database, it will see an inconsistent database (the sum A+ B will be less than it should be Can be ensured trivially by running transactions serially, that is one after the other. However, executing multiple transactions concurrently has significant benefits, as we will see 标 Database System Concepts 15.5 OSilberschatz. Korth and Sudarshan
Database System Concepts 15.5 ©Silberschatz, Korth and Sudarshan Example of Fund Transfer (Cont.) Durability requirement — once the user has been notified that the transaction has completed (i.e., the transfer of the $50 has taken place), the updates to the database by the transaction must persist despite failures. Isolation requirement — if between steps 3 and 6, another transaction is allowed to access the partially updated database, it will see an inconsistent database (the sum A + B will be less than it should be). Can be ensured trivially by running transactions serially, that is one after the other. However, executing multiple transactions concurrently has significant benefits, as we will see
Transaction State Active, the initial state; the transaction stays in this state while it is executing Partially committed, after the final statement has been executed Failed, after the discovery that normal execution can no longer proceed Aborted. after the transaction has been rolled back and the database restored to its state prior to the start of the transaction. Two options after it has been aborted t restart the transaction -only if no internal logical error ★ kill the transaction Committed, after successful completion 标 Database System Concepts 15.6 @Silberschatz, Korth and Sudarshan
Database System Concepts 15.6 ©Silberschatz, Korth and Sudarshan Transaction State Active, the initial state; the transaction stays in this state while it is executing Partially committed, after the final statement has been executed. Failed, after the discovery that normal execution can no longer proceed. Aborted, after the transaction has been rolled back and the database restored to its state prior to the start of the transaction. Two options after it has been aborted: restart the transaction – only if no internal logical error kill the transaction Committed, after successful completion
Transaction State(Cont) partially committed committed active failed aborted Database System Concepts 15.7 @Silberschatz, Korth and Sudarshan
Database System Concepts 15.7 ©Silberschatz, Korth and Sudarshan Transaction State (Cont.)
Implementation of Atomicity and Durability The recovery-management component of a database system implements the support for atomicity and durability The shadow-database scheme x assume that only one transaction is active at a time x a pointer called db_ pointer always points to the current consistent copy of the database t all updates are made on a shadow copy of the database, and db_ pointer is made to point to the updated shadow copy only after the transaction reaches partial commit and all updated pages have been flushed to disk x in case transaction fails, old consistent copy pointed to by db_pointer can be used, and the shadow copy can be deleted 标 Database System Concepts 15.8 OSilberschatz. Korth and Sudarshan
Database System Concepts 15.8 ©Silberschatz, Korth and Sudarshan Implementation of Atomicity and Durability The recovery-management component of a database system implements the support for atomicity and durability. The shadow-database scheme: assume that only one transaction is active at a time. a pointer called db_pointer always points to the current consistent copy of the database. all updates are made on a shadow copy of the database, and db_pointer is made to point to the updated shadow copy only after the transaction reaches partial commit and all updated pages have been flushed to disk. in case transaction fails, old consistent copy pointed to by db_pointer can be used, and the shadow copy can be deleted
Implementation of Atomicity and durability (Cont) The shadow-database scheme db_pointer db pointer old copy o old opy database database new copy of (to be deleted) database (a)Before update (b)After update Assumes disks to not fail Useful for text editors, but extremely inefficient for large databases: executing a single transaction requires copying the entire database. Will see better schemes in Chapter 17 Database System Concepts 15.9 OSilberschatz. Korth and Sudarshan
Database System Concepts 15.9 ©Silberschatz, Korth and Sudarshan Implementation of Atomicity and Durability (Cont.) Assumes disks to not fail Useful for text editors, but extremely inefficient for large databases: executing a single transaction requires copying the entire database. Will see better schemes in Chapter 17. The shadow-database scheme:
Concurrent Executions Multiple transactions are allowed to run concurrently in the system. Advantages are x increased processor and disk utilization, leading to better transaction throughput: one transaction can be using the CPU while another is reading from or writing to the disk x reduced average response time for transactions: short transactions need not wait behind long ones Concurrency control schemes- mechanisms to achieve isolation, i. e. to control the interaction among the concurrent transactions in order to prevent them from destroying the consistency of the database x Will study in Chapter 14, after studying notion of correctness of concurrent executions 标 Database System Concepts 15.10 OSilberschatz. Korth and Sudarshan
Database System Concepts 15.10 ©Silberschatz, Korth and Sudarshan Concurrent Executions Multiple transactions are allowed to run concurrently in the system. Advantages are: increased processor and disk utilization, leading to better transaction throughput: one transaction can be using the CPU while another is reading from or writing to the disk reduced average response time for transactions: short transactions need not wait behind long ones. Concurrency control schemes – mechanisms to achieve isolation, i.e., to control the interaction among the concurrent transactions in order to prevent them from destroying the consistency of the database Will study in Chapter 14, after studying notion of correctness of concurrent executions
