Soumettre la recherche
Mettre en ligne
Database Chapter on Transactions
•
Télécharger en tant que PPT, PDF
•
1 j'aime
•
341 vues
Titre amélioré par l'IA
Welly Dian Astika
Suivre
Sistem Basis Data Database
Lire moins
Lire la suite
Formation
Technologie
Signaler
Partager
Signaler
Partager
1 sur 42
Télécharger maintenant
Recommandé
Transaction slide
Transaction slide
shawon roy
Transactions in dbms
Transactions in dbms
Nancy Gulati
15. Transactions in DBMS
15. Transactions in DBMS
koolkampus
Transaction states PPT
Transaction states PPT
Pondicherry Central University
Dbms voc 5 unit
Dbms voc 5 unit
gurjotkawatra
Transaction Properties in database | ACID Properties
Transaction Properties in database | ACID Properties
nomanbarki
Distributed concurrency control
Distributed concurrency control
Binte fatima
Transaction processing ppt
Transaction processing ppt
Javed Khan
Recommandé
Transaction slide
Transaction slide
shawon roy
Transactions in dbms
Transactions in dbms
Nancy Gulati
15. Transactions in DBMS
15. Transactions in DBMS
koolkampus
Transaction states PPT
Transaction states PPT
Pondicherry Central University
Dbms voc 5 unit
Dbms voc 5 unit
gurjotkawatra
Transaction Properties in database | ACID Properties
Transaction Properties in database | ACID Properties
nomanbarki
Distributed concurrency control
Distributed concurrency control
Binte fatima
Transaction processing ppt
Transaction processing ppt
Javed Khan
Advanced DBMS presentation
Advanced DBMS presentation
Hindustan Petroleum
Ch24
Ch24
Welly Dian Astika
transaction management, concept & State
transaction management, concept & State
Surya Swaroop
Acid properties
Acid properties
Abhilasha Lahigude
Transaction management
Transaction management
ArchanaMani2
Sayed database system_architecture
Sayed database system_architecture
Sayed Ahmed
HbaseHivePigbyRohitDubey
HbaseHivePigbyRohitDubey
Rohit Dubey
Unit no 5 transation processing DMS 22319
Unit no 5 transation processing DMS 22319
ARVIND SARDAR
Svetlin Nakov - Transactions: Case Study
Svetlin Nakov - Transactions: Case Study
Svetlin Nakov
Chapter 4 u
Chapter 4 u
Sandeep Singh
Real time databases
Real time databases
Nipuna Hewamadduma
Data migration
Data migration
Dragoş Bugă
Chapter 13
Chapter 13
AbDul ThaYyal
ACID Property in DBMS
ACID Property in DBMS
Techtud Network
Lec08
Lec08
saryu2011
E3 chap-20
E3 chap-20
Welly Dian Astika
Imk pertemuan-1
Imk pertemuan-1
Welly Dian Astika
App c
App c
Welly Dian Astika
Ch22
Ch22
Welly Dian Astika
Ch13 protection
Ch13 protection
Welly Dian Astika
Peubah acak-kontinu
Peubah acak-kontinu
Welly Dian Astika
Sebaran peluang-bersama
Sebaran peluang-bersama
Welly Dian Astika
Contenu connexe
Tendances
Advanced DBMS presentation
Advanced DBMS presentation
Hindustan Petroleum
Ch24
Ch24
Welly Dian Astika
transaction management, concept & State
transaction management, concept & State
Surya Swaroop
Acid properties
Acid properties
Abhilasha Lahigude
Transaction management
Transaction management
ArchanaMani2
Sayed database system_architecture
Sayed database system_architecture
Sayed Ahmed
HbaseHivePigbyRohitDubey
HbaseHivePigbyRohitDubey
Rohit Dubey
Unit no 5 transation processing DMS 22319
Unit no 5 transation processing DMS 22319
ARVIND SARDAR
Svetlin Nakov - Transactions: Case Study
Svetlin Nakov - Transactions: Case Study
Svetlin Nakov
Chapter 4 u
Chapter 4 u
Sandeep Singh
Real time databases
Real time databases
Nipuna Hewamadduma
Data migration
Data migration
Dragoş Bugă
Chapter 13
Chapter 13
AbDul ThaYyal
ACID Property in DBMS
ACID Property in DBMS
Techtud Network
Lec08
Lec08
saryu2011
Tendances
(15)
Advanced DBMS presentation
Advanced DBMS presentation
Ch24
Ch24
transaction management, concept & State
transaction management, concept & State
Acid properties
Acid properties
Transaction management
Transaction management
Sayed database system_architecture
Sayed database system_architecture
HbaseHivePigbyRohitDubey
HbaseHivePigbyRohitDubey
Unit no 5 transation processing DMS 22319
Unit no 5 transation processing DMS 22319
Svetlin Nakov - Transactions: Case Study
Svetlin Nakov - Transactions: Case Study
Chapter 4 u
Chapter 4 u
Real time databases
Real time databases
Data migration
Data migration
Chapter 13
Chapter 13
ACID Property in DBMS
ACID Property in DBMS
Lec08
Lec08
En vedette
E3 chap-20
E3 chap-20
Welly Dian Astika
Imk pertemuan-1
Imk pertemuan-1
Welly Dian Astika
App c
App c
Welly Dian Astika
Ch22
Ch22
Welly Dian Astika
Ch13 protection
Ch13 protection
Welly Dian Astika
Peubah acak-kontinu
Peubah acak-kontinu
Welly Dian Astika
Sebaran peluang-bersama
Sebaran peluang-bersama
Welly Dian Astika
Hci [6]interaction design
Hci [6]interaction design
Welly Dian Astika
E3 chap-03
E3 chap-03
Welly Dian Astika
E3 chap-04
E3 chap-04
Welly Dian Astika
Ch11 file system implementation
Ch11 file system implementation
Welly Dian Astika
E3 chap-06
E3 chap-06
Welly Dian Astika
Ch8 main memory
Ch8 main memory
Welly Dian Astika
Ch2
Ch2
Welly Dian Astika
E3 chap-11
E3 chap-11
Welly Dian Astika
Ch12
Ch12
Welly Dian Astika
Ch6 cpu scheduling
Ch6 cpu scheduling
Welly Dian Astika
Ch17
Ch17
Welly Dian Astika
Ch1
Ch1
Welly Dian Astika
En vedette
(19)
E3 chap-20
E3 chap-20
Imk pertemuan-1
Imk pertemuan-1
App c
App c
Ch22
Ch22
Ch13 protection
Ch13 protection
Peubah acak-kontinu
Peubah acak-kontinu
Sebaran peluang-bersama
Sebaran peluang-bersama
Hci [6]interaction design
Hci [6]interaction design
E3 chap-03
E3 chap-03
E3 chap-04
E3 chap-04
Ch11 file system implementation
Ch11 file system implementation
E3 chap-06
E3 chap-06
Ch8 main memory
Ch8 main memory
Ch2
Ch2
E3 chap-11
E3 chap-11
Ch12
Ch12
Ch6 cpu scheduling
Ch6 cpu scheduling
Ch17
Ch17
Ch1
Ch1
Similaire à Database Chapter on Transactions
ch14.ppt
ch14.ppt
SyedMalek2
DBMS Transcations
DBMS Transcations
AjayReddy994773
ch17.pptx
ch17.pptx
JallaSudharshanReddy
Transaction
Transaction
Amin Omi
24904 lecture11
24904 lecture11
Universitas Bina Darma Palembang
dokumen.tips_silberschatz-korth-and-sudarshan1-transactions-transaction-conce...
dokumen.tips_silberschatz-korth-and-sudarshan1-transactions-transaction-conce...
DrCViji
Ch15 3717
Ch15 3717
Vinoth Kumar
Ch15 3717
Ch15 3717
Kumbala Sushanth Cool
Cs501 transaction
Cs501 transaction
Kamal Singh Lodhi
Ch15
Ch15
Vinod Kosta
Unit06 dbms
Unit06 dbms
arnold 7490
Dbms sixth chapter_part-1_2011
Dbms sixth chapter_part-1_2011
sumit_study
Tybsc cs dbms2 notes
Tybsc cs dbms2 notes
Niraj Bharambe
DBMS UNIT 4
DBMS UNIT 4
SURBHI SAROHA
Introduction to transaction processing
Introduction to transaction processing
Jafar Nesargi
Chapter 9 introduction to transaction processing
Chapter 9 introduction to transaction processing
Jafar Nesargi
Chapter 9 introduction to transaction processing
Chapter 9 introduction to transaction processing
Jafar Nesargi
DBMS Unit III Material
DBMS Unit III Material
ArthyR3
DBMS-chap 2-Concurrency Control
DBMS-chap 2-Concurrency Control
Mukesh Tekwani
UNIT-IV: Transaction Processing Concepts
UNIT-IV: Transaction Processing Concepts
Raj vardhan
Similaire à Database Chapter on Transactions
(20)
ch14.ppt
ch14.ppt
DBMS Transcations
DBMS Transcations
ch17.pptx
ch17.pptx
Transaction
Transaction
24904 lecture11
24904 lecture11
dokumen.tips_silberschatz-korth-and-sudarshan1-transactions-transaction-conce...
dokumen.tips_silberschatz-korth-and-sudarshan1-transactions-transaction-conce...
Ch15 3717
Ch15 3717
Ch15 3717
Ch15 3717
Cs501 transaction
Cs501 transaction
Ch15
Ch15
Unit06 dbms
Unit06 dbms
Dbms sixth chapter_part-1_2011
Dbms sixth chapter_part-1_2011
Tybsc cs dbms2 notes
Tybsc cs dbms2 notes
DBMS UNIT 4
DBMS UNIT 4
Introduction to transaction processing
Introduction to transaction processing
Chapter 9 introduction to transaction processing
Chapter 9 introduction to transaction processing
Chapter 9 introduction to transaction processing
Chapter 9 introduction to transaction processing
DBMS Unit III Material
DBMS Unit III Material
DBMS-chap 2-Concurrency Control
DBMS-chap 2-Concurrency Control
UNIT-IV: Transaction Processing Concepts
UNIT-IV: Transaction Processing Concepts
Dernier
Congestive Cardiac Failure..presentation
Congestive Cardiac Failure..presentation
deepaannamalai16
Using Grammatical Signals Suitable to Patterns of Idea Development
Using Grammatical Signals Suitable to Patterns of Idea Development
chesterberbo7
ROLES IN A STAGE PRODUCTION in arts.pptx
ROLES IN A STAGE PRODUCTION in arts.pptx
VanesaIglesias10
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptx
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptx
Humphrey A Beña
Visit to a blind student's school🧑🦯🧑🦯(community medicine)
Visit to a blind student's school🧑🦯🧑🦯(community medicine)
lakshayb543
4.11.24 Mass Incarceration and the New Jim Crow.pptx
4.11.24 Mass Incarceration and the New Jim Crow.pptx
mary850239
Multi Domain Alias In the Odoo 17 ERP Module
Multi Domain Alias In the Odoo 17 ERP Module
Celine George
4.16.24 Poverty and Precarity--Desmond.pptx
4.16.24 Poverty and Precarity--Desmond.pptx
mary850239
Q-Factor General Quiz-7th April 2024, Quiz Club NITW
Q-Factor General Quiz-7th April 2024, Quiz Club NITW
Quiz Club NITW
Paradigm shift in nursing research by RS MEHTA
Paradigm shift in nursing research by RS MEHTA
BP KOIRALA INSTITUTE OF HELATH SCIENCS,, NEPAL
How to Make a Duplicate of Your Odoo 17 Database
How to Make a Duplicate of Your Odoo 17 Database
Celine George
Beauty Amidst the Bytes_ Unearthing Unexpected Advantages of the Digital Wast...
Beauty Amidst the Bytes_ Unearthing Unexpected Advantages of the Digital Wast...
DhatriParmar
Decoding the Tweet _ Practical Criticism in the Age of Hashtag.pptx
Decoding the Tweet _ Practical Criticism in the Age of Hashtag.pptx
DhatriParmar
week 1 cookery 8 fourth - quarter .pptx
week 1 cookery 8 fourth - quarter .pptx
JonalynLegaspi2
Q4-PPT-Music9_Lesson-1-Romantic-Opera.pptx
Q4-PPT-Music9_Lesson-1-Romantic-Opera.pptx
lancelewisportillo
Active Learning Strategies (in short ALS).pdf
Active Learning Strategies (in short ALS).pdf
Patidar M
Grade Three -ELLNA-REVIEWER-ENGLISH.pptx
Grade Three -ELLNA-REVIEWER-ENGLISH.pptx
karenfajardo43
4.16.24 21st Century Movements for Black Lives.pptx
4.16.24 21st Century Movements for Black Lives.pptx
mary850239
Reading and Writing Skills 11 quarter 4 melc 1
Reading and Writing Skills 11 quarter 4 melc 1
GloryAnnCastre1
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Jemuel Francisco
Dernier
(20)
Congestive Cardiac Failure..presentation
Congestive Cardiac Failure..presentation
Using Grammatical Signals Suitable to Patterns of Idea Development
Using Grammatical Signals Suitable to Patterns of Idea Development
ROLES IN A STAGE PRODUCTION in arts.pptx
ROLES IN A STAGE PRODUCTION in arts.pptx
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptx
INTRODUCTION TO CATHOLIC CHRISTOLOGY.pptx
Visit to a blind student's school🧑🦯🧑🦯(community medicine)
Visit to a blind student's school🧑🦯🧑🦯(community medicine)
4.11.24 Mass Incarceration and the New Jim Crow.pptx
4.11.24 Mass Incarceration and the New Jim Crow.pptx
Multi Domain Alias In the Odoo 17 ERP Module
Multi Domain Alias In the Odoo 17 ERP Module
4.16.24 Poverty and Precarity--Desmond.pptx
4.16.24 Poverty and Precarity--Desmond.pptx
Q-Factor General Quiz-7th April 2024, Quiz Club NITW
Q-Factor General Quiz-7th April 2024, Quiz Club NITW
Paradigm shift in nursing research by RS MEHTA
Paradigm shift in nursing research by RS MEHTA
How to Make a Duplicate of Your Odoo 17 Database
How to Make a Duplicate of Your Odoo 17 Database
Beauty Amidst the Bytes_ Unearthing Unexpected Advantages of the Digital Wast...
Beauty Amidst the Bytes_ Unearthing Unexpected Advantages of the Digital Wast...
Decoding the Tweet _ Practical Criticism in the Age of Hashtag.pptx
Decoding the Tweet _ Practical Criticism in the Age of Hashtag.pptx
week 1 cookery 8 fourth - quarter .pptx
week 1 cookery 8 fourth - quarter .pptx
Q4-PPT-Music9_Lesson-1-Romantic-Opera.pptx
Q4-PPT-Music9_Lesson-1-Romantic-Opera.pptx
Active Learning Strategies (in short ALS).pdf
Active Learning Strategies (in short ALS).pdf
Grade Three -ELLNA-REVIEWER-ENGLISH.pptx
Grade Three -ELLNA-REVIEWER-ENGLISH.pptx
4.16.24 21st Century Movements for Black Lives.pptx
4.16.24 21st Century Movements for Black Lives.pptx
Reading and Writing Skills 11 quarter 4 melc 1
Reading and Writing Skills 11 quarter 4 melc 1
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Database Chapter on Transactions
1.
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
2.
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 Database System Concepts 15.2 ©Silberschatz, Korth and Sudarshan
3.
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. 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. Database System Concepts 15.3 ©Silberschatz, Korth and Sudarshan
4.
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. Database System Concepts 15.4 ©Silberschatz, Korth and Sudarshan
5.
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 ©Silberschatz, Korth and Sudarshan
6.
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. Database System Concepts 15.6 ©Silberschatz, Korth and Sudarshan
7.
Transaction State (Cont.) Database
System Concepts 15.7 ©Silberschatz, Korth and Sudarshan
8.
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. Database System Concepts 15.8 ©Silberschatz, Korth and Sudarshan
9.
Implementation of Atomicity
and Durability (Cont.) The shadow-database scheme: 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 ©Silberschatz, Korth and Sudarshan
10.
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. Database System Concepts 15.10 ©Silberschatz, Korth and Sudarshan
11.
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. Database System Concepts 15.11 ©Silberschatz, Korth and Sudarshan
12.
Example Schedules 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. Database System Concepts 15.12 ©Silberschatz, Korth and Sudarshan
13.
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. In both Schedule 1 and 3, the sum A + B is preserved. Database System Concepts 15.13 ©Silberschatz, Korth and Sudarshan
14.
Example Schedules (Cont.) The
following concurrent schedule (Schedule 4 in the text) does not preserve the value of the the sum A + B. Database System Concepts 15.14 ©Silberschatz, Korth and Sudarshan
15.
Serializability Basic Assumption –
Each transaction preserves database consistency. Thus serial execution of a set of transactions preserves database consistency. A (possibly concurrent) schedule is serializable if it is equivalent to a serial schedule. Different forms of schedule equivalence give rise to the notions of: 1. conflict serializability 2. view serializability We ignore operations other than read and write instructions, and we assume that transactions may perform arbitrary computations on data in local buffers in between reads and writes. Our simplified schedules consist of only read and write instructions. Database System Concepts 15.15 ©Silberschatz, Korth and Sudarshan
16.
Conflict Serializability Instructions li
and lj of transactions Ti and Tj respectively, conflict if and only if there exists some item Q accessed by both li and lj, and at least one of these instructions wrote Q. 1. li = read(Q), lj = read(Q). 2. li = read(Q), lj = write(Q). 3. li = write(Q), lj = read(Q). 4. li = write(Q), lj = write(Q). li and lj don’t conflict. They conflict. They conflict They conflict Intuitively, a conflict between li and lj forces a (logical) temporal order between them. If li and lj are consecutive in a schedule and they do not conflict, their results would remain the same even if they had been interchanged in the schedule. Database System Concepts 15.16 ©Silberschatz, Korth and Sudarshan
17.
Conflict Serializability (Cont.) 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´ are conflict equivalent. We say that a schedule S is conflict serializable if it is conflict equivalent to a serial schedule Example of a schedule that is not conflict serializable: T3 read(Q) T4 write(Q) write(Q) We are unable to swap instructions in the above schedule to obtain either the serial schedule < T3, T4 >, or the serial schedule < T4, T3 >. Database System Concepts 15.17 ©Silberschatz, Korth and Sudarshan
18.
Conflict Serializability (Cont.) Schedule
3 below can be transformed into Schedule 1, a serial schedule where T2 follows T1, by series of swaps of non-conflicting instructions. Therefore Schedule 3 is conflict serializable. Database System Concepts 15.18 ©Silberschatz, Korth and Sudarshan
19.
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: 1. For each data item Q, if transaction Ti reads the initial value of Q in schedule S, then transaction Ti must, in schedule S´, also read the initial value of Q. 2. For each data item Q if transaction Ti executes read(Q) in schedule S, and that value was produced by transaction Tj (if any), then transaction Ti must in schedule S´ also read the value of Q that was produced by transaction Tj . 3. For each data item Q, the transaction (if any) that performs the final write(Q) operation in schedule S must perform the final write(Q) operation in schedule S´. As can be seen, view equivalence is also based purely on reads and writes alone. Database System Concepts 15.19 ©Silberschatz, Korth and Sudarshan
20.
View Serializability (Cont.) A
schedule S is view serializable it is view equivalent to a serial schedule. Every conflict serializable schedule is also view serializable. Schedule 9 (from text) — a schedule which is view-serializable but not conflict serializable. Every view serializable schedule that is not conflict serializable has blind writes. Database System Concepts 15.20 ©Silberschatz, Korth and Sudarshan
21.
Other Notions of
Serializability Schedule 8 (from text) given below produces same outcome as the serial schedule < T1, T5 >, yet is not conflict equivalent or view equivalent to it. Determining such equivalence requires analysis of operations other than read and write. Database System Concepts 15.21 ©Silberschatz, Korth and Sudarshan
22.
Recoverability Need to address
the effect of transaction failures on concurrently running transactions. Recoverable schedule — if a transaction Tj reads a data items previously written by a transaction Ti , the commit operation of Ti appears before the commit operation of Tj. The following schedule (Schedule 11) is not recoverable if T9 commits immediately after the read If T8 should abort, T9 would have read (and possibly shown to the user) an inconsistent database state. Hence database must ensure that schedules are recoverable. Database System Concepts 15.22 ©Silberschatz, Korth and Sudarshan
23.
Recoverability (Cont.) Cascading rollback
– a single transaction failure leads to a series of transaction rollbacks. Consider the following schedule where none of the transactions has yet committed (so the schedule is recoverable) If T10 fails, T11 and T12 must also be rolled back. Can lead to the undoing of a significant amount of work Database System Concepts 15.23 ©Silberschatz, Korth and Sudarshan
24.
Recoverability (Cont.) Cascadeless schedules
— cascading rollbacks cannot occur; for each pair of transactions Ti and Tj such that Tj reads a data item previously written by Ti, the commit operation of Ti appears before the read operation of Tj. Every cascadeless schedule is also recoverable It is desirable to restrict the schedules to those that are cascadeless Database System Concepts 15.24 ©Silberschatz, Korth and Sudarshan
25.
Implementation of Isolation 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 time generates serial schedules, but provides a poor degree of concurrency.. Concurrency-control schemes tradeoff between the amount of concurrency they allow and the amount of overhead that they incur. Some schemes allow only conflict-serializable schedules to be generated, while others allow view-serializable schedules that are not conflict-serializable. Database System Concepts 15.25 ©Silberschatz, Korth and Sudarshan
26.
Transaction Definition in
SQL Data manipulation language must include a construct for specifying the set of actions that comprise a transaction. In SQL, a transaction begins implicitly. A transaction in SQL ends by: Commit work commits current transaction and begins a new one. Rollback work causes current transaction to abort. Levels of consistency specified by SQL-92: Database System Concepts Serializable — default Repeatable read Read committed Read uncommitted 15.26 ©Silberschatz, Korth and Sudarshan
27.
Levels of Consistency
in SQL-92 Serializable — default Repeatable read — only committed records to be read, repeated reads of same record must return same value. However, a transaction may not be serializable – it may find some records inserted by a transaction but not find others. Read committed — only committed records can be read, but successive 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 database, e.g., statistics for query optimizer. Database System Concepts 15.27 ©Silberschatz, Korth and Sudarshan
28.
Testing for Serializability Consider
some schedule of a set of transactions T1, T2, ..., Tn Precedence graph — a direct graph where the vertices are the transactions (names). We draw an arc from Ti to Tj if the two transaction conflict, and Ti accessed the data item on which the conflict arose earlier. We may label the arc by the item that was accessed. Example 1 x y Database System Concepts 15.28 ©Silberschatz, Korth and Sudarshan
29.
Example Schedule (Schedule
A) T1 T2 read(X) T3 T4 T5 read(Y) read(Z) read(V) read(W) read(W) read(Y) write(Y) write(Z) read(U) read(Y) write(Y) read(Z) write(Z) read(U) write(U) Database System Concepts 15.29 ©Silberschatz, Korth and Sudarshan
30.
Precedence Graph for
Schedule A T1 T2 T4 T3 Database System Concepts 15.30 ©Silberschatz, Korth and Sudarshan
31.
Test for Conflict
Serializability A schedule is conflict serializable if and only if its precedence graph is acyclic. Cycle-detection algorithms exist which take order n2 time, where n is the number of vertices in the graph. (Better algorithms take order n + e where e is the number of edges.) If precedence graph is acyclic, the serializability order can be obtained by a topological sorting of the graph. This is a linear order consistent with the partial order of the graph. For example, a serializability order for Schedule A would be T5 → T1 → T3 → T2 → T4 . Database System Concepts 15.31 ©Silberschatz, Korth and Sudarshan
32.
Test for View
Serializability The precedence graph test for conflict serializability must be modified to apply to a test for view serializability. The problem of checking if a schedule is view serializable falls in the class of NP-complete problems. Thus existence of an efficient algorithm is unlikely. However practical algorithms that just check some sufficient conditions for view serializability can still be used. Database System Concepts 15.32 ©Silberschatz, Korth and Sudarshan
33.
Concurrency Control vs.
Serializability Tests Testing a schedule for serializability after it has executed is a little too late! Goal – to develop concurrency control protocols that will assure serializability. They will generally not examine the precedence graph as it is being created; instead a protocol will impose a discipline that avoids nonseralizable schedules. Will study such protocols in Chapter 16. Tests for serializability help understand why a concurrency control protocol is correct. Database System Concepts 15.33 ©Silberschatz, Korth and Sudarshan
34.
End of Chapter
35.
Schedule 2 --
A Serial Schedule in Which T 2 is Followed by T 1 Database System Concepts 15.35 ©Silberschatz, Korth and Sudarshan
36.
Schedule 5 --
Schedule 3 After Swapping A Pair of Instructions Database System Concepts 15.36 ©Silberschatz, Korth and Sudarshan
37.
Schedule 6 --
A Serial Schedule That is Equivalent to Schedule 3 Database System Concepts 15.37 ©Silberschatz, Korth and Sudarshan
38.
Schedule 7 Database System
Concepts 15.38 ©Silberschatz, Korth and Sudarshan
39.
Precedence Graph for (a)
Schedule 1 and (b) Schedule 2 Database System Concepts 15.39 ©Silberschatz, Korth and Sudarshan
40.
Illustration of Topological
Sorting Database System Concepts 15.40 ©Silberschatz, Korth and Sudarshan
41.
Precedence Graph Database System
Concepts 15.41 ©Silberschatz, Korth and Sudarshan
42.
fig. 15.21 Database System
Concepts 15.42 ©Silberschatz, Korth and Sudarshan
Télécharger maintenant