Ch14 Transactions
-
Upload
josenildo-silva -
Category
Documents
-
view
258 -
download
0
Transcript of Ch14 Transactions
-
8/3/2019 Ch14 Transactions
1/53
Database System Concepts, 6 th Ed . Silberschatz, Korth and Sudarshan
See www.db-book.com for conditions on re-use
Chapter 14: Transactions
http://www.db-book.com/http://www.db-book.com/http://www.db-book.com/http://www.db-book.com/ -
8/3/2019 Ch14 Transactions
2/53
Silberschatz, Korth and Sudarshan14.2Database System Concepts - 6 th Edition
Chapter 14: Transactions
Transaction Concept
Transaction StateConcurrent Executions
Serializability
Recoverability
Implementation of IsolationTransaction Definition in SQL
Testing for Serializability.
-
8/3/2019 Ch14 Transactions
3/53
Silberschatz, Korth and Sudarshan14.3Database System Concepts - 6 th Edition
Transaction Concept
A transaction is a unit of program execution that accesses and
possibly updates various data items.E.g. 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)
Two main issues to deal with:
Failures of various kinds, such as hardware failures and systemcrashes
Concurrent execution of multiple transactions
-
8/3/2019 Ch14 Transactions
4/53
Silberschatz, Korth and Sudarshan14.4Database System Concepts - 6 th Edition
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)
Atomicity requirement
if the transaction fails after step 3 and before step 6, money will be lostleading to an inconsistent database state
Failure could be due to software or hardware
the system should ensure that updates of a partially executed transaction
are not reflected in the databaseDurability requirement once the user has been notified that the transactionhas completed (i.e., the transfer of the $50 has taken place), the updates to thedatabase by the transaction must persist even if there are software orhardware failures.
-
8/3/2019 Ch14 Transactions
5/53
Silberschatz, Korth and Sudarshan14.5Database System Concepts - 6 th Edition
Example of Fund Transfer (Cont.)
Transaction to transfer $50 from account A to account B:1. read (A)2. A := A 503. write (A)4. read (B )5. B := B + 506. write (B)
Consistency requirement in above example:the sum of A and B is unchanged by the execution of the transaction
In general, consistency requirements includeExplicitly specified integrity constraints such as primary keys and foreignkeysImplicit integrity constraints e.g. sum of balances of all accounts, minus sum of loan amounts
must equal value of cash-in-handA transaction must see a consistent database.During transaction execution the database may be temporarily inconsistent.When the transaction completes successfully the database must beconsistent
Erroneous transaction logic can lead to inconsistency
-
8/3/2019 Ch14 Transactions
6/53
Silberschatz, Korth and Sudarshan14.6Database System Concepts - 6 th Edition
Example of Fund Transfer (Cont.)
Isolation requirement if between steps 3 and 6, another
transaction T2 is allowed to access the partially updated database, itwill see an inconsistent database (the sum A + B will be less than itshould be).
T1 T21. read (A)2. A := A 50
3. write (A) read(A), read(B), print(A+B)4. read (B )5. B := B + 506. write (B
Isolation can be ensured trivially by running transactions seriallythat is, one after the other.
However, executing multiple transactions concurrently has significantbenefits, as we will see later.
-
8/3/2019 Ch14 Transactions
7/53 Silberschatz, Korth and Sudarshan14.7Database System Concepts - 6 th Edition
ACID Properties
Atomicity . Either all operations of the transaction are properly reflectedin 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 executingtransactions. Intermediate transaction results must be hidden from otherconcurrently executed transactions.
That is, for every pair of transactions T i and T j , it appears to T i thateither T j , finished execution before T i started, or T j started executionafter T i finished.
Durability . After a transaction completes successfully, the changes ithas made to the database persist, even if there are system failures.
A transaction is a unit of program execution that accesses and possibly
updates various data items.To preserve the integrity of data the databasesystem must ensure:
-
8/3/2019 Ch14 Transactions
8/53 Silberschatz, Korth and Sudarshan14.8Database System Concepts - 6 th Edition
Transaction State
Active the initial state; the transaction stays in this state while it is
executingPartially committed after the final statement has been executed.
Failed -- after the discovery that normal execution can no longerproceed.
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
can be done only if no internal logical error
kill the transaction
Committed after successful completion.
-
8/3/2019 Ch14 Transactions
9/53 Silberschatz, Korth and Sudarshan14.9Database System Concepts - 6 th Edition
Transaction State (Cont.)
-
8/3/2019 Ch14 Transactions
10/53 Silberschatz, Korth and Sudarshan14.10Database System Concepts - 6 th Edition
Concurrent Executions
Multiple transactions are allowed to run concurrently in the system.
Advantages are:increased processor and disk utilization , leading to bettertransaction throughput
E.g. one transaction can be using the CPU while another isreading from or writing to the disk
reduced average response time for transactions: shorttransactions need not wait behind long ones.
Concurrency control schemes mechanisms to achieve isolation
that is, to control the interaction among the concurrenttransactions in order to prevent them from destroying the
consistency of the databaseWill study in Chapter 16, after studying notion of correctnessof concurrent executions.
-
8/3/2019 Ch14 Transactions
11/53 Silberschatz, Korth and Sudarshan14.11Database System Concepts - 6 th Edition
Schedules
Schedule a sequences of instructions that specify the chronological
order in which instructions of concurrent transactions are executeda schedule for a set of transactions must consist of all instructionsof those transactions
must preserve the order in which the instructions appear in eachindividual transaction.
A transaction that successfully completes its execution will have acommit instructions as the last statement
by default transaction assumed to execute commit instruction as itslast step
A transaction that fails to successfully complete its execution will have
an abort instruction as the last statement
-
8/3/2019 Ch14 Transactions
12/53 Silberschatz, Korth and Sudarshan14.12Database System Concepts - 6 th Edition
Schedule 1
Let T 1 transfer $50 from A to B , and T 2 transfer 10% of the
balance fromA
toB.
A serial schedule in which T 1 is followed by T 2 :
-
8/3/2019 Ch14 Transactions
13/53 Silberschatz, Korth and Sudarshan14.13Database System Concepts - 6 th Edition
Schedule 2
A serial schedule where T 2 is followed by T 1
-
8/3/2019 Ch14 Transactions
14/53 Silberschatz, Korth and Sudarshan14.14Database System Concepts - 6 th Edition
Schedule 3
Let T 1 and T 2 be the transactions defined previously . The
following schedule is not a serial schedule, but it is equivalent to Schedule 1.
In Schedules 1, 2 and 3, the sum A + B is preserved.
-
8/3/2019 Ch14 Transactions
15/53 Silberschatz, Korth and Sudarshan14.15Database System Concepts - 6 th Edition
Schedule 4
The following concurrent schedule does not preserve the
value of ( A + B ).
-
8/3/2019 Ch14 Transactions
16/53 Silberschatz, Korth and Sudarshan14.16Database System Concepts - 6 th Edition
Serializability
Basic Assumption Each transaction preserves database
consistency.Thus serial execution of a set of transactions preservesdatabase consistency.
A (possibly concurrent) schedule is serializable if it isequivalent to a serial schedule. Different forms of schedule
equivalence give rise to the notions of:1. conflict serializability
2. view serializability
-
8/3/2019 Ch14 Transactions
17/53 Silberschatz, Korth and Sudarshan14.17Database System Concepts - 6 th Edition
Simplified view of transactions
We ignore operations other than read and write instructions
We assume that transactions may perform arbitrarycomputations on data in local buffers in between readsand writes.
Our simplified schedules consist of only read and writeinstructions.
-
8/3/2019 Ch14 Transactions
18/53 Silberschatz, Korth and Sudarshan14.18Database System Concepts - 6 th Edition
Conflicting Instructions
Instructions l i and l j of transactions T i and T j respectively, conflict
if and only if there exists some item Q accessed by both l i and l j ,and at least one of these instructions wrote Q.
1. l i = read (Q), l j = read (Q ). l i and l j dont conflict. 2. l i = read (Q), l j = write (Q ). They conflict.3. l i = write (Q), l j = read (Q ). They conflict4. l i = write (Q), l j = write (Q ). They conflict
Intuitively, a conflict between l i and l j forces a (logical) temporalorder between them.
If l i and l j are consecutive in a schedule and they do notconflict, their results would remain the same even if they hadbeen interchanged in the schedule.
-
8/3/2019 Ch14 Transactions
19/53 Silberschatz, Korth and Sudarshan14.19Database System Concepts - 6 th Edition
Conflict Serializability
If a schedule S can be transformed into a schedule S
by a series of
swaps of non-conflicting instructions, we say that S and S
areconflict equivalent .
We say that a schedule S is conflict serializable if it is conflictequivalent to a serial schedule
-
8/3/2019 Ch14 Transactions
20/53 Silberschatz, Korth and Sudarshan14.20Database System Concepts - 6 th Edition
Conflict Serializability (Cont.)
Schedule 3 can be transformed into Schedule 6, a serial
schedule where T 2 follows T 1, by series of swaps of non-conflicting instructions. Therefore Schedule 3 is conflictserializable.
Schedule 3 Schedule 6
-
8/3/2019 Ch14 Transactions
21/53 Silberschatz, Korth and Sudarshan14.21Database System Concepts - 6 th Edition
Conflict Serializability (Cont.)
Example of a schedule that is not conflict serializable:
We are unable to swap instructions in the above schedule toobtain either the serial schedule < T 3, T 4 >, or the serialschedule < T 4, T 3 >.
-
8/3/2019 Ch14 Transactions
22/53 Silberschatz, Korth and Sudarshan14.22Database System Concepts - 6 th Edition
View Serializability
Let S and S
be two schedules with the same set of transactions. S
and S
are view equivalent if the following three conditions are met,for each data item Q,
1. If in schedule S, transaction T i reads the initial value of Q , then inschedule S also transaction T i must read the initial value of Q.
2. If in schedule S transaction T i executes read (Q) , and that value
was produced by transaction T j (if any), then in scheduleS
alsotransaction T i must read the value of Q that was produced by thesame write (Q) operation of transaction T j .
3. The transaction (if any) that performs the final write (Q ) operationin schedule S must also perform the final write (Q ) operation inschedule S.
As can be seen, view equivalence is also based purely on reads andwrites alone.
-
8/3/2019 Ch14 Transactions
23/53 Silberschatz, Korth and Sudarshan14.23Database System Concepts - 6 th Edition
View Serializability (Cont.)
A schedule S is view serializable if it is view equivalent to a serial
schedule.Every conflict serializable schedule is also view serializable.
Below is a schedule which is view-serializable but not conflictserializable.
What serial schedule is above equivalent to?
Every view serializable schedule that is not conflict serializable hasblind writes .
-
8/3/2019 Ch14 Transactions
24/53
Silberschatz, Korth and Sudarshan14.24Database System Concepts - 6 th Edition
Other Notions of Serializability
The schedule below produces same outcome as the serial
schedule < T 1, T 5 >, yet is not conflict equivalent or viewequivalent to it.
Determining such equivalence requires analysis of operationsother than read and write.
-
8/3/2019 Ch14 Transactions
25/53
Silberschatz, Korth and Sudarshan14.25Database System Concepts - 6 th Edition
Testing for Serializability
Consider some schedule of a set of transactions T 1, T 2, ..., T n
Precedence graph a direct graph where the vertices arethe transactions (names).
We draw an arc from T i to T j if the two transaction conflict,and T i accessed the data item on which the conflict aroseearlier.
We may label the arc by the item that was accessed.Example 1
-
8/3/2019 Ch14 Transactions
26/53
Silberschatz, Korth and Sudarshan14.26Database System Concepts - 6 th Edition
Test for Conflict Serializability
A schedule is conflict serializable if and only
if its precedence graph is acyclic.Cycle-detection algorithms exist which takeorder n 2 time, where n is the number ofvertices in the graph.
(Better algorithms take order n + e
where e is the number of edges.)If precedence graph is acyclic, theserializability order can be obtained by atopological sorting of the graph.
This is a linear order consistent with thepartial order of the graph.
For example, a serializability order forSchedule A would beT 5 T 1 T 3 T 2 T 4
Are there others?
-
8/3/2019 Ch14 Transactions
27/53
Silberschatz, Korth and Sudarshan14.27Database System Concepts - 6 th Edition
Test for View Serializability
The precedence graph test for conflict serializability cannot be used
directly to test for view serializability.Extension to test for view serializability has cost exponential in thesize of the precedence graph.
The problem of checking if a schedule is view serializable falls in theclass of NP -complete problems.
Thus existence of an efficient algorithm is extremely unlikely.However practical algorithms that just check some sufficient conditions for view serializability can still be used.
-
8/3/2019 Ch14 Transactions
28/53
Silberschatz, Korth and Sudarshan14.28Database System Concepts - 6 th Edition
Recoverable Schedules
Recoverable schedule if a transaction T j reads a data itempreviously written by a transaction T i , then the commit operation of T i appears before the commit operation of T j .
The following schedule (Schedule 11) is not recoverable if T 9 commitsimmediately after the read
If T 8 should abort, T 9 would have read (and possibly shown to the user)an inconsistent database state. Hence, database must ensure thatschedules are recoverable.
Need to address the effect of transaction failures on concurrently
running transactions.
-
8/3/2019 Ch14 Transactions
29/53
Silberschatz, Korth and Sudarshan14.29Database System Concepts - 6 th Edition
Cascading Rollbacks
Cascading rollback a single transaction failure leads to a
series of transaction rollbacks. Consider the following schedulewhere none of the transactions has yet committed (so theschedule is recoverable)
If T 10 fails, T 11 and T 12 must also be rolled back.Can lead to the undoing of a significant amount of work
-
8/3/2019 Ch14 Transactions
30/53
Silberschatz, Korth and Sudarshan14.30Database System Concepts - 6 th Edition
Cascadeless Schedules
Cascadeless schedules cascading rollbacks cannot occur; for
each pair of transactions T i and T j such that T j reads a data itempreviously written by T i , the commit operation of T i appears before theread operation of T j .
Every cascadeless schedule is also recoverable
It is desirable to restrict the schedules to those that are cascadeless
-
8/3/2019 Ch14 Transactions
31/53
Silberschatz, Korth and Sudarshan14.31Database System Concepts - 6 th Edition
Concurrency Control
A database must provide a mechanism that will ensure that all possible
schedules areeither conflict or view serializable, and
are recoverable and preferably cascadeless
A policy in which only one transaction can execute at a time generatesserial schedules, but provides a poor degree of concurrency
Are serial schedules recoverable/cascadeless?Testing a schedule for serializability after it has executed is a little toolate!
Goal to develop concurrency control protocols that will assureserializability.
-
8/3/2019 Ch14 Transactions
32/53
Silberschatz, Korth and Sudarshan14.32Database System Concepts - 6 th Edition
Concurrency Control (Cont.)
Schedules must be conflict or view serializable, and recoverable,
for the sake of database consistency, and preferably cascadeless.A policy in which only one transaction can execute at a timegenerates serial schedules, but provides a poor degree ofconcurrency.
Concurrency-control schemes tradeoff between the amount ofconcurrency they allow and the amount of overhead that theyincur.
Some schemes allow only conflict-serializable schedules to begenerated, while others allow view-serializable schedules that arenot conflict-serializable.
-
8/3/2019 Ch14 Transactions
33/53
Silberschatz, Korth and Sudarshan14.33Database System Concepts - 6 th Edition
Concurrency Control vs. Serializability Tests
Concurrency-control protocols allow concurrent schedules, but ensurethat the schedules are conflict/view serializable, and are recoverableand cascadeless .
Concurrency control protocols generally do not examine theprecedence graph as it is being created
Instead a protocol imposes a discipline that avoids nonseralizableschedules.
We study such protocols in Chapter 16.
Different concurrency control protocols provide different tradeoffsbetween the amount of concurrency they allow and the amount of
overhead that they incur.Tests for serializability help us understand why a concurrency controlprotocol is correct.
-
8/3/2019 Ch14 Transactions
34/53
Silberschatz, Korth and Sudarshan14.34Database System Concepts - 6 th Edition
Weak Levels of Consistency
Some applications are willing to live with weak levels of consistency,
allowing schedules that are not serializableE.g. a read-only transaction that wants to get an approximate totalbalance of all accounts
E.g. database statistics computed for query optimization can beapproximate (why?)
Such transactions need not be serializable with respect to othertransactions
Tradeoff accuracy for performance
-
8/3/2019 Ch14 Transactions
35/53
Silberschatz, Korth and Sudarshan14.35Database System Concepts - 6 th Edition
Levels of Consistency in SQL-92
Serializable default
Repeatable read only committed records to be read, repeatedreads of same record must return same value. However, atransaction may not be serializable it may find some recordsinserted by a transaction but not find others.
Read committed only committed records can be read, butsuccessive reads of record may return different (but committed)values.
Read uncommitted even uncommitted records may be read.
Lower degrees of consistency useful for gathering approximate
information about the databaseWarning: some database systems do not ensure serializableschedules by default
E.g. Oracle and PostgreSQL by default support a level ofconsistency called snapshot isolation (not part of the SQL
standard)
-
8/3/2019 Ch14 Transactions
36/53
-
8/3/2019 Ch14 Transactions
37/53
Database System Concepts, 6 th Ed . Silberschatz, Korth and Sudarshan
See www.db-book.com for conditions on re-use
End of Chapter 14
http://www.db-book.com/http://www.db-book.com/http://www.db-book.com/http://www.db-book.com/ -
8/3/2019 Ch14 Transactions
38/53
Silberschatz, Korth and Sudarshan14.38Database System Concepts - 6 th Edition
Figure 14.01
-
8/3/2019 Ch14 Transactions
39/53
Silberschatz, Korth and Sudarshan14.39Database System Concepts - 6 th Edition
Figure 14.02
-
8/3/2019 Ch14 Transactions
40/53
Silberschatz, Korth and Sudarshan14.40Database System Concepts - 6 th Edition
Figure 14.03
-
8/3/2019 Ch14 Transactions
41/53
Silberschatz, Korth and Sudarshan14.41Database System Concepts - 6 th Edition
Figure 14.04
-
8/3/2019 Ch14 Transactions
42/53
Silberschatz, Korth and Sudarshan14.42Database System Concepts - 6 th Edition
Figure 14.05
-
8/3/2019 Ch14 Transactions
43/53
Silberschatz, Korth and Sudarshan14.43Database System Concepts - 6 th Edition
Figure 14.06
i 14 0
-
8/3/2019 Ch14 Transactions
44/53
Silberschatz, Korth and Sudarshan14.44Database System Concepts - 6 th Edition
Figure 14.07
Fi 14 08
-
8/3/2019 Ch14 Transactions
45/53
Silberschatz, Korth and Sudarshan14.45Database System Concepts - 6 th Edition
Figure 14.08
Fi 14 09
-
8/3/2019 Ch14 Transactions
46/53
Silberschatz, Korth and Sudarshan14.46Database System Concepts - 6 th Edition
Figure 14.09
Fi 14 10
-
8/3/2019 Ch14 Transactions
47/53
Silberschatz, Korth and Sudarshan14.47Database System Concepts - 6 th Edition
Figure 14.10
Fi 14 11
-
8/3/2019 Ch14 Transactions
48/53
Silberschatz, Korth and Sudarshan14.48Database System Concepts - 6 th Edition
Figure 14.11
Fi 14 12
-
8/3/2019 Ch14 Transactions
49/53
Silberschatz, Korth and Sudarshan14.49Database System Concepts - 6 th Edition
Figure 14.12
Fi 14 13
-
8/3/2019 Ch14 Transactions
50/53
Silberschatz, Korth and Sudarshan14.50Database System Concepts - 6 th Edition
Figure 14.13
Fig 14 14
-
8/3/2019 Ch14 Transactions
51/53
Silberschatz, Korth and Sudarshan14.51Database System Concepts - 6 th Edition
Figure 14.14
Fig 14 15
-
8/3/2019 Ch14 Transactions
52/53
Silberschatz, Korth and Sudarshan14.52Database System Concepts - 6 th Edition
Figure 14.15
Figure 14 16
-
8/3/2019 Ch14 Transactions
53/53
Figure 14.16