retagged by
294 views
1 votes
1 votes

A schedule with two transactions T1 and T2 is as mentioned below:

$\begin{array}{|c|c|} \hline T1 & T2 \\ \hline \text{read(A)} & {} \\  \hline \text{write(A)} & {} \\ \hline {} & \text{read(A)} \\ \hline {} & \text{commit} \\ \hline \text{read(A)} & {} \\ \hline \text{abort} & {} \\ \hline \end{array}$

The above schedule is an example of:

  1. Cascade-less schedule
  2. Recoverable schedule
  3. Both Cascade-less and Recoverable schedule
  4. Irrecoverable schedule
retagged by

1 Answer

Best answer
2 votes
2 votes

T2 reads a value which is written by T1, and commits before T1. So, if T1 faces any error and aborts after T2 commits (as in the last line of schedule), T1 will be rolled back, but T2 is not able to roll back since it is already committed.

So, we have an irrecoverable schedule

selected by
Answer:

Related questions

1 votes
1 votes
1 answer
1
2 votes
2 votes
1 answer
2
Bikram asked Aug 26, 2017
317 views
Consider the following transaction involving two bank accounts $A$ and $B$.$\begin{array}{|l|} \hline \text{read(A);} \\ \hline A:=A-250; \\ \hline \text{write(A);} \\ \...
3 votes
3 votes
2 answers
3