The following table presents the lock requests by transactions T1, T2, T3, and T4. S(.) and X(.) stand for 'shared lock' and exclusive lock', respectively. To prevent deadlocks, use a lock manager that uses the Wait-Die policy. Assume the four transactions have priority: T1< T2

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
icon
Related questions
Question
The following table presents the lock requests by transactions T1, T2, T3, and T4. S(.) and X(.) stand for shared lock' and `exclusive lock', respectively.
To prevent deadlocks, use a lock manager that uses the Wait-Die policy. Assume the four transactions have priority: T1 < T2 <T3 < T4. Determine which lock request
will be 'granted', 'blocked' or 'aborted'; for 'abort', specify which transaction is aborted, e.g., 'Tj aborts'.
time
t4
S(A)
X(D) | X(C)
t1
t2
t3
t5
to
t7
t8
X(B)
T2
T3
T4
S(C)
X(A)
X(B)
S(D)
O a
g, g, g, T1 aborts, g, T2 aborts, g, g
Ob.
g, g, g, b, g, T2 aborts, g, g
Oc.
g, g, g, T1 aborts, g, b, g, g
O d. g, g, g, T2 aborts, g, T1 aborts, g, g
Clear my choice
Transcribed Image Text:The following table presents the lock requests by transactions T1, T2, T3, and T4. S(.) and X(.) stand for shared lock' and `exclusive lock', respectively. To prevent deadlocks, use a lock manager that uses the Wait-Die policy. Assume the four transactions have priority: T1 < T2 <T3 < T4. Determine which lock request will be 'granted', 'blocked' or 'aborted'; for 'abort', specify which transaction is aborted, e.g., 'Tj aborts'. time t4 S(A) X(D) | X(C) t1 t2 t3 t5 to t7 t8 X(B) T2 T3 T4 S(C) X(A) X(B) S(D) O a g, g, g, T1 aborts, g, T2 aborts, g, g Ob. g, g, g, b, g, T2 aborts, g, g Oc. g, g, g, T1 aborts, g, b, g, g O d. g, g, g, T2 aborts, g, T1 aborts, g, g Clear my choice
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of Database Architectures
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education