Submit Search
Upload
Ch15
•
3 likes
•
754 views
S
Subhankar Chowdhury
Follow
Data base Chapter 15
Read less
Read more
Education
Technology
Economy & Finance
Report
Share
Report
Share
1 of 46
Download now
Download to read offline
Recommended
Distributed DBMS - Unit 8 - Distributed Transaction Management & Concurrency ...
Distributed DBMS - Unit 8 - Distributed Transaction Management & Concurrency ...
Gyanmanjari Institute Of Technology
Transaction conccurency
Transaction conccurency
Esraa Farrag
Transaction slide
Transaction slide
shawon roy
UNIT-IV: Transaction Processing Concepts
UNIT-IV: Transaction Processing Concepts
Raj vardhan
Optimistic concurrency control in Distributed Systems
Optimistic concurrency control in Distributed Systems
mridul mishra
Transaction & Concurrency Control
Transaction & Concurrency Control
Ravimuthurajan
Database ,11 Concurrency Control
Database ,11 Concurrency Control
Ali Usman
Chapter 12 transactions and concurrency control
Chapter 12 transactions and concurrency control
AbDul ThaYyal
Recommended
Distributed DBMS - Unit 8 - Distributed Transaction Management & Concurrency ...
Distributed DBMS - Unit 8 - Distributed Transaction Management & Concurrency ...
Gyanmanjari Institute Of Technology
Transaction conccurency
Transaction conccurency
Esraa Farrag
Transaction slide
Transaction slide
shawon roy
UNIT-IV: Transaction Processing Concepts
UNIT-IV: Transaction Processing Concepts
Raj vardhan
Optimistic concurrency control in Distributed Systems
Optimistic concurrency control in Distributed Systems
mridul mishra
Transaction & Concurrency Control
Transaction & Concurrency Control
Ravimuthurajan
Database ,11 Concurrency Control
Database ,11 Concurrency Control
Ali Usman
Chapter 12 transactions and concurrency control
Chapter 12 transactions and concurrency control
AbDul ThaYyal
Concurrency
Concurrency
Naveen Sihag
VNSISPL_DBMS_Concepts_ch15
VNSISPL_DBMS_Concepts_ch15
sriprasoon
Concurrent control
Concurrent control
Felix Makundi
CS 542 -- Concurrency Control, Distributed Commit
CS 542 -- Concurrency Control, Distributed Commit
J Singh
Transactions and Concurrency Control
Transactions and Concurrency Control
Dilum Bandara
Logging Last Resource Optimization for Distributed Transactions in Oracle We...
Logging Last Resource Optimization for Distributed Transactions in Oracle We...
Gera Shegalov
Optimistic Algorithm and Concurrency Control Algorithm
Optimistic Algorithm and Concurrency Control Algorithm
Shounak Katyayan
S dbr paper
S dbr paper
Utkan Uluçay, MSc., CDDP
Logging Last Resource Optimization for Distributed Transactions in Oracle…
Logging Last Resource Optimization for Distributed Transactions in Oracle…
Gera Shegalov
Ch15
Ch15
Welly Dian Astika
DBMS-chap 2-Concurrency Control
DBMS-chap 2-Concurrency Control
Mukesh Tekwani
Distributed datababase Transaction and concurrency control
Distributed datababase Transaction and concurrency control
balamurugan.k Kalibalamurugan
Svetlin Nakov - Database Transactions
Svetlin Nakov - Database Transactions
Svetlin Nakov
Database management system chapter16
Database management system chapter16
Md. Mahedi Mahfuj
Transaction
Transaction
Amin Omi
24904 lecture11
24904 lecture11
Universitas Bina Darma Palembang
17. Recovery System in DBMS
17. Recovery System in DBMS
koolkampus
Transactions (Distributed computing)
Transactions (Distributed computing)
Sri Prasanna
Locks In Disributed Systems
Locks In Disributed Systems
mridul mishra
Concurrency Control
Concurrency Control
Nishant Munjal
առարկայական
առարկայական
Nelli Hambardzumyan
Wellfast Company Profile-201609
Wellfast Company Profile-201609
Tina Qiu
More Related Content
What's hot
Concurrency
Concurrency
Naveen Sihag
VNSISPL_DBMS_Concepts_ch15
VNSISPL_DBMS_Concepts_ch15
sriprasoon
Concurrent control
Concurrent control
Felix Makundi
CS 542 -- Concurrency Control, Distributed Commit
CS 542 -- Concurrency Control, Distributed Commit
J Singh
Transactions and Concurrency Control
Transactions and Concurrency Control
Dilum Bandara
Logging Last Resource Optimization for Distributed Transactions in Oracle We...
Logging Last Resource Optimization for Distributed Transactions in Oracle We...
Gera Shegalov
Optimistic Algorithm and Concurrency Control Algorithm
Optimistic Algorithm and Concurrency Control Algorithm
Shounak Katyayan
S dbr paper
S dbr paper
Utkan Uluçay, MSc., CDDP
Logging Last Resource Optimization for Distributed Transactions in Oracle…
Logging Last Resource Optimization for Distributed Transactions in Oracle…
Gera Shegalov
Ch15
Ch15
Welly Dian Astika
DBMS-chap 2-Concurrency Control
DBMS-chap 2-Concurrency Control
Mukesh Tekwani
Distributed datababase Transaction and concurrency control
Distributed datababase Transaction and concurrency control
balamurugan.k Kalibalamurugan
Svetlin Nakov - Database Transactions
Svetlin Nakov - Database Transactions
Svetlin Nakov
Database management system chapter16
Database management system chapter16
Md. Mahedi Mahfuj
Transaction
Transaction
Amin Omi
24904 lecture11
24904 lecture11
Universitas Bina Darma Palembang
17. Recovery System in DBMS
17. Recovery System in DBMS
koolkampus
Transactions (Distributed computing)
Transactions (Distributed computing)
Sri Prasanna
Locks In Disributed Systems
Locks In Disributed Systems
mridul mishra
Concurrency Control
Concurrency Control
Nishant Munjal
What's hot
(20)
Concurrency
Concurrency
VNSISPL_DBMS_Concepts_ch15
VNSISPL_DBMS_Concepts_ch15
Concurrent control
Concurrent control
CS 542 -- Concurrency Control, Distributed Commit
CS 542 -- Concurrency Control, Distributed Commit
Transactions and Concurrency Control
Transactions and Concurrency Control
Logging Last Resource Optimization for Distributed Transactions in Oracle We...
Logging Last Resource Optimization for Distributed Transactions in Oracle We...
Optimistic Algorithm and Concurrency Control Algorithm
Optimistic Algorithm and Concurrency Control Algorithm
S dbr paper
S dbr paper
Logging Last Resource Optimization for Distributed Transactions in Oracle…
Logging Last Resource Optimization for Distributed Transactions in Oracle…
Ch15
Ch15
DBMS-chap 2-Concurrency Control
DBMS-chap 2-Concurrency Control
Distributed datababase Transaction and concurrency control
Distributed datababase Transaction and concurrency control
Svetlin Nakov - Database Transactions
Svetlin Nakov - Database Transactions
Database management system chapter16
Database management system chapter16
Transaction
Transaction
24904 lecture11
24904 lecture11
17. Recovery System in DBMS
17. Recovery System in DBMS
Transactions (Distributed computing)
Transactions (Distributed computing)
Locks In Disributed Systems
Locks In Disributed Systems
Concurrency Control
Concurrency Control
Viewers also liked
առարկայական
առարկայական
Nelli Hambardzumyan
Wellfast Company Profile-201609
Wellfast Company Profile-201609
Tina Qiu
Մայրցամաքներ և օվկիանոսներ
Մայրցամաքներ և օվկիանոսներ
Nelli Hambardzumyan
Bio2#6
Bio2#6
Carlos Molina Arzabe
Ավանդապատումներ ծառերի մասին
Ավանդապատումներ ծառերի մասին
Gevorg Antonyan
Brahmand darshan introduction v1.0
Brahmand darshan introduction v1.0
mangeshsutar
Ch19
Ch19
Subhankar Chowdhury
Ch14
Ch14
Subhankar Chowdhury
Ch12
Ch12
Subhankar Chowdhury
Ch17
Ch17
Subhankar Chowdhury
Ch9
Ch9
Subhankar Chowdhury
Ch13
Ch13
Subhankar Chowdhury
Database Management Systems 4 - Normalization
Database Management Systems 4 - Normalization
Nickkisha Farrell
Bsc cs ii-dbms- u-iii-data modeling using e.r. model (entity relationship model)
Bsc cs ii-dbms- u-iii-data modeling using e.r. model (entity relationship model)
Rai University
Կարմիր ջրիմուռներ
Կարմիր ջրիմուռներ
Vanik Adamyan
Trabajo de la comunicacion presentacion [reparado]
Trabajo de la comunicacion presentacion [reparado]
mariagarcia_
Presentación1
Presentación1
Andres Betancourt
Ch16
Ch16
Subhankar Chowdhury
ծաղկի ցողուն
ծաղկի ցողուն
Manul06
Database Management Systems 1
Database Management Systems 1
Nickkisha Farrell
Viewers also liked
(20)
առարկայական
առարկայական
Wellfast Company Profile-201609
Wellfast Company Profile-201609
Մայրցամաքներ և օվկիանոսներ
Մայրցամաքներ և օվկիանոսներ
Bio2#6
Bio2#6
Ավանդապատումներ ծառերի մասին
Ավանդապատումներ ծառերի մասին
Brahmand darshan introduction v1.0
Brahmand darshan introduction v1.0
Ch19
Ch19
Ch14
Ch14
Ch12
Ch12
Ch17
Ch17
Ch9
Ch9
Ch13
Ch13
Database Management Systems 4 - Normalization
Database Management Systems 4 - Normalization
Bsc cs ii-dbms- u-iii-data modeling using e.r. model (entity relationship model)
Bsc cs ii-dbms- u-iii-data modeling using e.r. model (entity relationship model)
Կարմիր ջրիմուռներ
Կարմիր ջրիմուռներ
Trabajo de la comunicacion presentacion [reparado]
Trabajo de la comunicacion presentacion [reparado]
Presentación1
Presentación1
Ch16
Ch16
ծաղկի ցողուն
ծաղկի ցողուն
Database Management Systems 1
Database Management Systems 1
Similar to Ch15
dokumen.tips_silberschatz-korth-and-sudarshan1-transactions-transaction-conce...
dokumen.tips_silberschatz-korth-and-sudarshan1-transactions-transaction-conce...
DrCViji
ch14.ppt
ch14.ppt
SyedMalek2
DBMS Transcations
DBMS Transcations
AjayReddy994773
ch17.pptx
ch17.pptx
JallaSudharshanReddy
ch17_Transaction management in Database Management System
ch17_Transaction management in Database Management System
coolscools1231
Ch20
Ch20
Subhankar Chowdhury
DBMS Unit III Material
DBMS Unit III Material
ArthyR3
Dartabase Transaction.pptx
Dartabase Transaction.pptx
Bibus Poudel
Ch15
Ch15
Vinod Kosta
Ch17
Ch17
suman banoth
HbaseHivePigbyRohitDubey
HbaseHivePigbyRohitDubey
Rohit Dubey
Unit06 dbms
Unit06 dbms
arnold 7490
DBMS_unit-5-2022-23.pptx
DBMS_unit-5-2022-23.pptx
ADITIRAMTEKE1
Ch20
Ch20
Aravindharamanan S
Sayed database system_architecture
Sayed database system_architecture
Sayed Ahmed
Sayed database system_architecture
Sayed database system_architecture
Sayed Ahmed
DBMS 10 | Database Transactions
DBMS 10 | Database Transactions
Mohammad Imam Hossain
DBMS UNIT 4
DBMS UNIT 4
SURBHI SAROHA
ch15.ppt
ch15.ppt
mukul narayana
ch15.ppt
ch15.ppt
Lucky2417
Similar to Ch15
(20)
dokumen.tips_silberschatz-korth-and-sudarshan1-transactions-transaction-conce...
dokumen.tips_silberschatz-korth-and-sudarshan1-transactions-transaction-conce...
ch14.ppt
ch14.ppt
DBMS Transcations
DBMS Transcations
ch17.pptx
ch17.pptx
ch17_Transaction management in Database Management System
ch17_Transaction management in Database Management System
Ch20
Ch20
DBMS Unit III Material
DBMS Unit III Material
Dartabase Transaction.pptx
Dartabase Transaction.pptx
Ch15
Ch15
Ch17
Ch17
HbaseHivePigbyRohitDubey
HbaseHivePigbyRohitDubey
Unit06 dbms
Unit06 dbms
DBMS_unit-5-2022-23.pptx
DBMS_unit-5-2022-23.pptx
Ch20
Ch20
Sayed database system_architecture
Sayed database system_architecture
Sayed database system_architecture
Sayed database system_architecture
DBMS 10 | Database Transactions
DBMS 10 | Database Transactions
DBMS UNIT 4
DBMS UNIT 4
ch15.ppt
ch15.ppt
ch15.ppt
ch15.ppt
More from Subhankar Chowdhury
Ch11
Ch11
Subhankar Chowdhury
Ch10
Ch10
Subhankar Chowdhury
Ch8
Ch8
Subhankar Chowdhury
Ch7
Ch7
Subhankar Chowdhury
Ch6
Ch6
Subhankar Chowdhury
Ch5
Ch5
Subhankar Chowdhury
Ch4
Ch4
Subhankar Chowdhury
Ch3
Ch3
Subhankar Chowdhury
Ch2
Ch2
Subhankar Chowdhury
Ch1
Ch1
Subhankar Chowdhury
Ch22
Ch22
Subhankar Chowdhury
Ch21
Ch21
Subhankar Chowdhury
More from Subhankar Chowdhury
(12)
Ch11
Ch11
Ch10
Ch10
Ch8
Ch8
Ch7
Ch7
Ch6
Ch6
Ch5
Ch5
Ch4
Ch4
Ch3
Ch3
Ch2
Ch2
Ch1
Ch1
Ch22
Ch22
Ch21
Ch21
Recently uploaded
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
JhengPantaleon
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media Component
InMediaRes1
Sanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdf
sanyamsingh5019
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
anshu789521
A Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy Reform
Chameera Dedduwage
Class 11 Legal Studies Ch-1 Concept of State .pdf
Class 11 Legal Studies Ch-1 Concept of State .pdf
akmcokerachita
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953056974 Low Rate Call Girls In Saket, Delhi NCR
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
heathfieldcps1
MENTAL STATUS EXAMINATION format.docx
MENTAL STATUS EXAMINATION format.docx
PoojaSen20
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
GeoBlogs
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
VS Mahajan Coaching Centre
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
Maestría en Comunicación Digital Interactiva - UNR
Staff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSD
David Douglas School District
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
9953056974 Low Rate Call Girls In Saket, Delhi NCR
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon A
UnboundStockton
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
iammrhaywood
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf
ssuser54595a
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
eniolaolutunde
Separation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and Actinides
FatimaKhan178732
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
SoniaTolstoy
Recently uploaded
(20)
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media Component
Sanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdf
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
A Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy Reform
Class 11 Legal Studies Ch-1 Concept of State .pdf
Class 11 Legal Studies Ch-1 Concept of State .pdf
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
MENTAL STATUS EXAMINATION format.docx
MENTAL STATUS EXAMINATION format.docx
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
Staff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSD
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon A
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
Separation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and Actinides
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
Ch15
1.
Chapter 15: Transactions
Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See www.dbbook.com for conditions on reuse
2.
Chapter 15: Transactions
s Transaction Concept s Transaction State s Concurrent Executions s Serializability s Recoverability s Implementation of Isolation s Transaction Definition in SQL s Testing for Serializability. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
3.
Transaction Concept
s A transaction is a unit of program execution that accesses and possibly updates various data items. s 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) s Two main issues to deal with: q Failures of various kinds, such as hardware failures and system crashes q Concurrent execution of multiple transactions Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
4.
Example of Fund Transfer
s 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) s Atomicity requirement q if the transaction fails after step 3 and before step 6, money will be “lost” leading to an inconsistent database state Failure could be due to software or hardware q the system should ensure that updates of a partially executed transaction are not reflected in the database s 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 even if there are software or hardware failures. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
5.
Example of Fund Transfer (Cont.)
s 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) s Consistency requirement in above example: q the sum of A and B is unchanged by the execution of the transaction s In general, consistency requirements include Explicitly specified integrity constraints such as primary keys and foreign keys Implicit integrity constraints – e.g. sum of balances of all accounts, minus sum of loan amounts must equal value of cashinhand q A transaction must see a consistent database. q During transaction execution the database may be temporarily inconsistent. q When the transaction completes successfully the database must be consistent Erroneous transaction logic can lead to inconsistency Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
6.
Example of Fund Transfer (Cont.)
s Isolation requirement — if between steps 3 and 6, another transaction T2 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). T1 T2 1. read(A) 2. A := A – 50 3. write(A) read(A), read(B), print(A+B) 4. read(B) 5. B := B + 50 6. write(B s Isolation can be ensured trivially by running transactions serially q that is, one after the other. s However, executing multiple transactions concurrently has significant benefits, as we will see later. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
7.
ACID Properties
A transaction is a unit of program execution that accesses and possibly updates various data items.To preserve the integrity of data the database system must ensure: s Atomicity. Either all operations of the transaction are properly reflected in the database or none are. s Consistency. Execution of a transaction in isolation preserves the consistency of the database. s 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. q 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. s Durability. After a transaction completes successfully, the changes it has made to the database persist, even if there are system failures. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
8.
Transaction State
s Active – the initial state; the transaction stays in this state while it is executing s Partially committed – after the final statement has been executed. s Failed after the discovery that normal execution can no longer proceed. s 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: q restart the transaction can be done only if no internal logical error q kill the transaction s Committed – after successful completion. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
9.
Transaction State (Cont.) Database System Concepts 5th Edition, Sep 12, 2006.
15.<number> ©Silberschatz, Korth and Sudarshan
10.
Implementation of Atomicity and
Durability s The recoverymanagement component of a database system implements the support for atomicity and durability. s E.g. the shadowdatabase scheme: q all updates are made on a shadow copy of the database db_pointer is made to point to the updated shadow copy after – the transaction reaches partial commit and – all updated pages have been flushed to disk. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
11.
Implementation of Atomicity and Durability
(Cont.) s db_pointer always points to the current consistent copy of the database. q In case transaction fails, old consistent copy pointed to by db_pointer can be used, and the shadow copy can be deleted. s The shadowdatabase scheme: q Assumes that only one transaction is active at a time. q Assumes disks do not fail q Useful for text editors, but extremely inefficient for large databases (why?) – Variant called shadow paging reduces copying of data, but is still not practical for large databases q Does not handle concurrent transactions s Will study better schemes in Chapter 17. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
12.
Concurrent Executions
s Multiple transactions are allowed to run concurrently in the system. Advantages are: q increased processor and disk utilization, leading to better transaction throughput E.g. one transaction can be using the CPU while another is reading from or writing to the disk q reduced average response time for transactions: short transactions need not wait behind long ones. s Concurrency control schemes – mechanisms to achieve isolation q that is, to control the interaction among the concurrent transactions in order to prevent them from destroying the consistency of the database Will study in Chapter 16, after studying notion of correctness of concurrent executions. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
13.
Schedules
s Schedule – a sequences of instructions that specify the chronological order in which instructions of concurrent transactions are executed q a schedule for a set of transactions must consist of all instructions of those transactions q must preserve the order in which the instructions appear in each individual transaction. s A transaction that successfully completes its execution will have a commit instructions as the last statement q by default transaction assumed to execute commit instruction as its last step s A transaction that fails to successfully complete its execution will have an abort instruction as the last statement Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
14.
Schedule 1
s Let T1 transfer $50 from A to B, and T2 transfer 10% of the balance from A to B. s A serial schedule in which T1 is followed by T2 : Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
15.
Schedule 2
• A serial schedule where T2 is followed by T1 Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
16.
Schedule 3
s Let T1 and T2 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. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
17.
Schedule 4
s The following concurrent schedule does not preserve the value of (A + B ). Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
18.
Serializability
s Basic Assumption – Each transaction preserves database consistency. s Thus serial execution of a set of transactions preserves database consistency. s 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 s Simplified view of transactions q We ignore operations other than read and write instructions q We assume that transactions may perform arbitrary computations on data in local buffers in between reads and writes. q Our simplified schedules consist of only read and write instructions. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
19.
Conflicting Instructions
s 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). li and lj don’t conflict. 2. li = read(Q), lj = write(Q). They conflict. 3. li = write(Q), lj = read(Q). They conflict 4. li = write(Q), lj = write(Q). They conflict s Intuitively, a conflict between li and lj forces a (logical) temporal order between them. q 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 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
20.
Conflict Serializability
s If a schedule S can be transformed into a schedule S´ by a series of swaps of nonconflicting instructions, we say that S and S´ are conflict equivalent. s We say that a schedule S is conflict serializable if it is conflict equivalent to a serial schedule Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
21.
Conflict Serializability (Cont.)
s Schedule 3 can be transformed into Schedule 6, a serial schedule where T2 follows T1, by series of swaps of non conflicting instructions. q Therefore Schedule 3 is conflict serializable. Schedule 3 Schedule 6 Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
22.
Conflict Serializability (Cont.)
s Example of a schedule that is not conflict serializable: s 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 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
23.
View Serializability
s 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 Ti reads the initial value of Q, then in schedule S’ also transaction Ti must read the initial value of Q. 2. If in schedule S transaction Ti executes read(Q), and that value was produced by transaction Tj (if any), then in schedule S’ also transaction Ti must read the value of Q that was produced by the same write(Q) operation of transaction Tj . 3. The transaction (if any) that performs the final write(Q) operation in schedule S must also 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 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
24.
View Serializability (Cont.)
s A schedule S is view serializable if it is view equivalent to a serial schedule. s Every conflict serializable schedule is also view serializable. s Below is a schedule which is viewserializable but not conflict serializable. s What serial schedule is above equivalent to? s Every view serializable schedule that is not conflict serializable has blind writes. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
25.
Other Notions of Serializability
s The schedule below produces same outcome as the serial schedule < T1, T5 >, yet is not conflict equivalent or view equivalent to it. s Determining such equivalence requires analysis of operations other than read and write. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
26.
Testing for Serializability
s Consider some schedule of a set of transactions T1, T2, ..., Tn s Precedence graph — a direct graph where the vertices are the transactions (names). s 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. s We may label the arc by the item that was accessed. s Example 1 x y Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
27.
Example Schedule (Schedule A) + Precedence Graph
T1 T2 T3 T4 T5 read(X) read(Y) read(Z) read(V) read(W) T1 T2 read(W) read(Y) write(Y) write(Z) read(U) read(Y) T3 T4 write(Y) read(Z) write(Z) read(U) write(U) T5 Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
28.
Test for Conflict Serializability
s A schedule is conflict serializable if and only if its precedence graph is acyclic. s Cycledetection algorithms exist which take order n2 time, where n is the number of vertices in the graph. q (Better algorithms take order n + e where e is the number of edges.) s If precedence graph is acyclic, the serializability order can be obtained by a topological sorting of the graph. q This is a linear order consistent with the partial order of the graph. q For example, a serializability order for Schedule A would be T5 → T1 → T3 → T2 → T4 Are there others? Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
29.
Test for View Serializability
s The precedence graph test for conflict serializability cannot be used directly to test for view serializability. q Extension to test for view serializability has cost exponential in the size of the precedence graph. s The problem of checking if a schedule is view serializable falls in the class of NPcomplete problems. q Thus existence of an efficient algorithm is extremely unlikely. s However practical algorithms that just check some sufficient conditions for view serializability can still be used. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
30.
Recoverable Schedules
Need to address the effect of transaction failures on concurrently running transactions. s Recoverable schedule — if a transaction Tj reads a data item previously written by a transaction Ti , then the commit operation of Ti appears before the commit operation of Tj. s The following schedule (Schedule 11) is not recoverable if T9 commits immediately after the read s 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 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
31.
Cascading Rollbacks
s 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. s Can lead to the undoing of a significant amount of work Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
32.
Cascadeless Schedules
s 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. s Every cascadeless schedule is also recoverable s It is desirable to restrict the schedules to those that are cascadeless Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
33.
Concurrency Control
s A database must provide a mechanism that will ensure that all possible schedules are q either conflict or view serializable, and q are recoverable and preferably cascadeless s A policy in which only one transaction can execute at a time generates serial schedules, but provides a poor degree of concurrency q Are serial schedules recoverable/cascadeless? s Testing a schedule for serializability after it has executed is a little too late! s Goal – to develop concurrency control protocols that will assure serializability. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
34.
Concurrency Control vs. Serializability Tests
s Concurrencycontrol protocols allow concurrent schedules, but ensure that the schedules are conflict/view serializable, and are recoverable and cascadeless . s Concurrency control protocols generally do not examine the precedence graph as it is being created q Instead a protocol imposes a discipline that avoids nonseralizable schedules. q We study such protocols in Chapter 16. s Different concurrency control protocols provide different tradeoffs between the amount of concurrency they allow and the amount of overhead that they incur. s Tests for serializability help us understand why a concurrency control protocol is correct. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
35.
Weak Levels of Consistency
s Some applications are willing to live with weak levels of consistency, allowing schedules that are not serializable q E.g. a readonly transaction that wants to get an approximate total balance of all accounts q E.g. database statistics computed for query optimization can be approximate (why?) q Such transactions need not be serializable with respect to other transactions s Tradeoff accuracy for performance Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
36.
Levels of Consistency in SQL92
s Serializable — default s 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. s Read committed — only committed records can be read, but successive reads of record may return different (but committed) values. s Read uncommitted — even uncommitted records may be read. s Lower degrees of consistency useful for gathering approximate information about the database s Warning: some database systems do not ensure serializable schedules by default q E.g. Oracle and PostgreSQL by default support a level of consistency called snapshot isolation (not part of the SQL standard) Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
37.
Transaction Definition in SQL
s Data manipulation language must include a construct for specifying the set of actions that comprise a transaction. s In SQL, a transaction begins implicitly. s A transaction in SQL ends by: q Commit work commits current transaction and begins a new one. q Rollback work causes current transaction to abort. s In almost all database systems, by default, every SQL statement also commits implicitly if it executes successfully q Implicit commit can be turned off by a database directive E.g. in JDBC, connection.setAutoCommit(false); Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
38.
End of Chapter Database System Concepts, 5th Ed.
©Silberschatz, Korth and Sudarshan See www.dbbook.com for conditions on reuse
39.
Database System Concepts 5th Edition, Sep 12, 2006.
15.<number> ©Silberschatz, Korth and Sudarshan
40.
Database System Concepts 5th Edition, Sep 12, 2006.
15.<number> ©Silberschatz, Korth and Sudarshan
41.
Schedule 7 Database System Concepts 5th Edition, Sep 12, 2006.
15.<number> ©Silberschatz, Korth and Sudarshan
42.
Precedence Graph for
(a) Schedule 1 and (b) Schedule 2 Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
43.
Precedence Graph Database System Concepts 5th Edition, Sep 12, 2006.
15.<number> ©Silberschatz, Korth and Sudarshan
44.
fig. 15.21 Database System Concepts 5th Edition, Sep 12, 2006.
15.<number> ©Silberschatz, Korth and Sudarshan
45.
Implementation of Isolation
s Schedules must be conflict or view serializable, and recoverable, for the sake of database consistency, and preferably cascadeless. s A policy in which only one transaction can execute at a time generates serial schedules, but provides a poor degree of concurrency. s Concurrencycontrol schemes tradeoff between the amount of concurrency they allow and the amount of overhead that they incur. s Some schemes allow only conflictserializable schedules to be generated, while others allow viewserializable schedules that are not conflictserializable. Database System Concepts 5th Edition, Sep 12, 2006. 15.<number> ©Silberschatz, Korth and Sudarshan
46.
Figure 15.6 Database System Concepts 5th Edition, Sep 12, 2006.
15.<number> ©Silberschatz, Korth and Sudarshan
Download now