Consider three transactions T1, T2, T3 and two data iterns X, Y T1: R (X); R(Y); W (Y) T2: R (X); W (X) T3: R(Y); R (X); W (X) Given the following schedule of interleaved operations from T1, T2, and T3 S: R1 (X); R3 (Y); R3 (X); R1 (Y); R2 (X); W1 (Y); Al; W2 (X); C2; W3 (X); C3 "A1" means transaction T1 aborts; "C2" (resp. "C3") means transaction 12 (resp. T3) commits (1) What anomalies occur in this schedule? Explain your answer (2) protocol. (3) For each transaction T1, T2, T3, insert all the lock and unlock operations to make the transaction satisfy the strict 2PL protocol. (Note: You can add a write lock directly if the transaction needs to both read and write a data item) Two-Phase Locking (2PL) is widely used for concurrency control in relational database systems. Briefly describe the strict 2PL
Consider three transactions T1, T2, T3 and two data iterns X, Y T1: R (X); R(Y); W (Y) T2: R (X); W (X) T3: R(Y); R (X); W (X) Given the following schedule of interleaved operations from T1, T2, and T3 S: R1 (X); R3 (Y); R3 (X); R1 (Y); R2 (X); W1 (Y); Al; W2 (X); C2; W3 (X); C3 "A1" means transaction T1 aborts; "C2" (resp. "C3") means transaction 12 (resp. T3) commits (1) What anomalies occur in this schedule? Explain your answer (2) protocol. (3) For each transaction T1, T2, T3, insert all the lock and unlock operations to make the transaction satisfy the strict 2PL protocol. (Note: You can add a write lock directly if the transaction needs to both read and write a data item) Two-Phase Locking (2PL) is widely used for concurrency control in relational database systems. Briefly describe the strict 2PL
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
please quickly thanks !

Transcribed Image Text:QUESTION 7
Consider three transactions T1, T2, T3 and two data iterns X, Y
T1: R (X); R(Y); W (Y)
T2: R (X); W (X)
T3: R(Y); R (X); W (X)
Given the following schedule of interleaved operations from T1, T2, and T3:
S: R1 (X); R3 (Y); R3 (X); R1 (Y); R2 (X); W1 (Y); A1; W2 (X); C2; W3 (X); C3
"A1" means transaction T1 aborts, "C2" (resp. "C3") means transaction 12 (resp. T3) commits
What anomalies occur in this schedule? Explain your answer.
(1)
(2)
protocol.
Two-Phase Locking (2PL) is widely used for concurrency control in relational database systems. Briefly describe the strict 2PL
(3)
For each transaction T1, T2, T3, insert all the lock and unlock operations to make the transaction satisfy the strict 2PL protocol.
(Note: You can add a write lock directly if the transaction needs to both read and write a data item)
Construct a wait-for-graph (WFG) for this schedule based on the strict 2PL protocol. Is there any deadlock in the schedule? Justify
(4)
your answer.
Note: Here is an example about how to describe a wait-for-graph: T1-> T2 means there is an edge from transaction T1 to transaction T2 in the wait-
for-graph.
(5)
Victim selection is used to decide which transaction should be aborted when a deadlock is detected. List at least three factors that
should be considered in victim selection.
Timeout is a mechanism for handling deadlocks. Explain the advantages and disadvantages of short timeout compared to long
(6)
timeout
Assume that transaction T1 is aborted to address the deadlock issue. Modify schedule S based on strict 2PL to prevent the anomaly
(7)
Justify your answer.
ALTIEN 10 Mac)
pro
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education