浙江大学数据库系统概念PPT第十五章,对应原版教材第五版
合集下载
相关主题
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
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
©Silberschatz, Korth and Sudarshan, Bo Zhou
Concurrent Executions
Multiple transactions are allowed to run concurrently in the system. Advantages are:
Database System Concepts
15.1
©Silberschatz, Korth and Sudarshan, Bo Zhou
Transaction Concept
E.g. Transaction to transfer $50 from account A to account B:
T1 1 2 3 4 5 X = x+1 Write(x) X = x*2 Write(x) Read(x) Read(x) T2
Dirty Read:
T1 1 2 3 rollback Write(T) Read(T) T2
Database System Concepts
15.7
©Silberschatz, Korth and Sudarshan, Bo Zhou
Some notions:
Serial Schedule Equivalent schedule Serializable Schedule
Database System Concepts
15.9
©Silberschatz, Korth and Sudarshan, Bo Zhou
Example Schedules
1. read(A) 2. A := A – 50 3. write(A) 4. read(B) 5. B := B + 50 6. write(B
A transaction is a unit of program execution that accesses and possibly updates various data items.
Consistency problems (Cont.)
Non repeatable read
T1 1 2 3 Read(x) X? Read(x) Write(x) T2
Database System Concepts
15.8
©Silberschatz, Korth and Sudarshan, Bo Zhou
Failure could be due to software or hardware
Database System Concepts
15.4
©Silberschatz, Korth and Sudarshan, Bo Zhou
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).
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
In both Schedule 1 and 3, the sum A + B is preserved.
Database System Concepts 15.11 ©Silberschatz, Korth and Sudarshan, Bo Zhou
15.2
©Silberschatz, Korth and Sudarshan, Bo Zhou
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.
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.
Let T1 transfer $50 from A to B, and T2 transfer 10% of the balance from A to B. The following is a serial schedule (Schedule 1 in the text), in which T1 is followed by T2.
1. 2. 3. 4. 5. 6. read(A) A := A – 50 write(A) read(B) B := B + 50 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.
Database System Concepts
15.6
©Silberschatz, Korth and Sudarshan, Bo Zhou
Consistency problems of concurrent Execution without control
Lost modification:
Database System Concepts
15.3
©Silberschatz, Korth and Sudarshan, Bo Zhou
Example of Fund Transfer
Transaction to transfer $50 from account A to account B:
Chapter 15: Transactions
Transaction Concept Concurrent Executions Serializability Testing for Serializability Recoverability Transaction Definition in SQL
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
Database System Concepts
Schedules
Schedules – sequences that indicate the chronological order in which instructions of concurrent transactions are executed
a schedule for a set of transactions must consist of all instructions of those transactions must preserve the order in which the instructions appear in each individual transaction.
Commit a transaction Rollback a transaction
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. 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.10
©Silberschatz, Korth and Sudarshan, Bo Zhou
Example Schedule (Cont.)
Let T1 and T2 be the transactions defined previously. The following schedule (Schedule 3 in the text) is not a serial schedule, but it is equivalent to Schedule 1.
Database System Concepts
15.5
©Silberschatz, Korth and Sudarshan, Bo Zhou
Concurrent Executions
Multiple transactions are allowed to run concurrently in the system. Advantages are:
Database System Concepts
15.1
©Silberschatz, Korth and Sudarshan, Bo Zhou
Transaction Concept
E.g. Transaction to transfer $50 from account A to account B:
T1 1 2 3 4 5 X = x+1 Write(x) X = x*2 Write(x) Read(x) Read(x) T2
Dirty Read:
T1 1 2 3 rollback Write(T) Read(T) T2
Database System Concepts
15.7
©Silberschatz, Korth and Sudarshan, Bo Zhou
Some notions:
Serial Schedule Equivalent schedule Serializable Schedule
Database System Concepts
15.9
©Silberschatz, Korth and Sudarshan, Bo Zhou
Example Schedules
1. read(A) 2. A := A – 50 3. write(A) 4. read(B) 5. B := B + 50 6. write(B
A transaction is a unit of program execution that accesses and possibly updates various data items.
Consistency problems (Cont.)
Non repeatable read
T1 1 2 3 Read(x) X? Read(x) Write(x) T2
Database System Concepts
15.8
©Silberschatz, Korth and Sudarshan, Bo Zhou
Failure could be due to software or hardware
Database System Concepts
15.4
©Silberschatz, Korth and Sudarshan, Bo Zhou
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).
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
In both Schedule 1 and 3, the sum A + B is preserved.
Database System Concepts 15.11 ©Silberschatz, Korth and Sudarshan, Bo Zhou
15.2
©Silberschatz, Korth and Sudarshan, Bo Zhou
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.
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.
Let T1 transfer $50 from A to B, and T2 transfer 10% of the balance from A to B. The following is a serial schedule (Schedule 1 in the text), in which T1 is followed by T2.
1. 2. 3. 4. 5. 6. read(A) A := A – 50 write(A) read(B) B := B + 50 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.
Database System Concepts
15.6
©Silberschatz, Korth and Sudarshan, Bo Zhou
Consistency problems of concurrent Execution without control
Lost modification:
Database System Concepts
15.3
©Silberschatz, Korth and Sudarshan, Bo Zhou
Example of Fund Transfer
Transaction to transfer $50 from account A to account B:
Chapter 15: Transactions
Transaction Concept Concurrent Executions Serializability Testing for Serializability Recoverability Transaction Definition in SQL
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
Database System Concepts
Schedules
Schedules – sequences that indicate the chronological order in which instructions of concurrent transactions are executed
a schedule for a set of transactions must consist of all instructions of those transactions must preserve the order in which the instructions appear in each individual transaction.
Commit a transaction Rollback a transaction
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. 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.10
©Silberschatz, Korth and Sudarshan, Bo Zhou
Example Schedule (Cont.)
Let T1 and T2 be the transactions defined previously. The following schedule (Schedule 3 in the text) is not a serial schedule, but it is equivalent to Schedule 1.