If T1 has not unlocked data item Y, T2 cannot begin; if T2 has not unlocked data item X, T1 cannot continue. Consequently, T1 and T2 each wait for the other to unlock the required data item. Such a deadlock is also known as a(n) _____.
Correct Answer:
Verified
Q64: What are database checkpoints?
Q65: The _ rule states that only one
Q66: The DBMS uses the information stored in
Q67: What are the three basic techniques to
Q68: As a rule, a(n) _ must unlock
Q69: What is transaction isolation and why it
Q70: _ ensure that a disk physical failure
Q72: Uniqueness ensures that no equal time stamp
Q73: The _ protocol ensures that transaction logs
Q74: How does a shared/exclusive lock schema increase
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents