Give an example of a schedule in which transactions of the Student Registration System deadlock.
What will be an ideal response?
Consider the concurrent execution of a registration transaction, T1, and a deregistration
transaction, T2, for the same course, and assume the DBMS uses table locking (it locks
the table that is being accessed):
T2 first deletes the rowin Transcript describing the student registered in that
course and then decrements Enrollment in Class. The registration transaction, T1,
first updates Class, and then inserts a tuple in Transcript.
The schedule is:
w2(x) w1(y) w2(y) w1(x)
A deadlock results since T1 and T2 obtain their locks in the opposite order.
You might also like to view...
On Click enables you to start an animation when you click the slide or a trigger
Indicate whether the statement is true or false
Which command-line tool can be used to rearrange files contiguously and optimize performance?
a. Chkdsk.exe b. Cleanmgr.exe. c. Defrag.exe. d. DiskPart.exe