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...
How do you determine which fields are good candidates for the row and column headings in a crosstab query?
What will be an ideal response?
A Web ____________________ is a computer connected to the Internet that stores Web pages and other Web content and displays it to a Web browser.
Fill in the blank(s) with the appropriate word(s).
Which traffic-shaping parameter is a measure of the average number of bits transmitted during a timing interval?
a. CIR b. Tc c. Bc d. Be
The buffer is located __________ .
A. in the heap B. on the stack C. in the data section of the process D. all the above