Question 1810 – Database-Management-System
May 14, 2024Question 3563 – Database-Management-System
May 14, 2024Question 1889 – Database-Management-System
Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R. It will
Correct Answer: B
Question 374 Explanation:
● Shared locks exist when two transactions are granted read access.
● One transaction gets the shared lock on data and when the second transaction requests the same data it is also given a shared lock.
● Both transactions are in a read-only mode, updating the data is not allowed until the shared lock is released.
● There is no conflict with the shared lock because nothing is being updated.
● Shared locks last as long as they need to last; it depends on the level of the transaction that holds the lock.
● One transaction gets the shared lock on data and when the second transaction requests the same data it is also given a shared lock.
● Both transactions are in a read-only mode, updating the data is not allowed until the shared lock is released.
● There is no conflict with the shared lock because nothing is being updated.
● Shared locks last as long as they need to last; it depends on the level of the transaction that holds the lock.
result in deadlock situation
immediately be granted
immediately be rejected
be granted as soon as it is released by A
Subscribe
Login
0 Comments