00:01
Hello students, so let us look at this question.
00:06
So during a seed availability checks, concurrent access to the database is easy because users are only performing read operations that don't conflict with each other.
00:18
So it is easy because, because users are only performing, users are only performing read operations, read operations that don't conflict with each other, that don't conflict with each other.
00:58
Second is that the company can use the two -phase locking, that is 2pl protocol to ensure a conflict sterizability of transaction.
01:08
So the company can use the two -phase, two -phase locking, that is 2pl protocol to ensure conflict, conflict serializability of transactions.
01:52
Now third is the wait for the graph, that should be wait for graph.
02:01
So it should be of order t1 greater than t2, greater than t3, greater than t4, greater than t5, and greater than t1.
02:14
Then deadlock occurs, deadlock occurs.
02:20
And fourth is recover the manager's actions, recover manager actions.
02:34
In that the first is to analyze the point of failure and identify the incomplete transaction, that is t2 and t5...