MadeEasy Test Series: Databases - Transactions

Question

#plz check i am right ??

Answer 1

Strict Schedule is a schedule in which a transaction can neither Read(x) nor Write(x) until the last transaction that wrote x has committed or aborted.

after w3(A) the commit should be there to make it a strict schedule so it is not strict recoverable schedule

There is no cycle that makes it a confict serializable schedule

Comments

i  am saying that here first commited of Tx1 that have no problem but after that W3(A)  then C2 then R3(A) so i think here                                       |    w(A)

                                           commit      |     

                                                            |     R(A)

                                                            |      commit

but strict recoverable condition is:

                    W(A)     |

                     C/R      |

                                 |    W(A)/R(A)

 so above first diagram other side non read or write executed so i said it strict recoverable plz check??

---

there is only one write so commit will come after that, if commit is not there the it is not strict recoverable

---

@pavan,in the last two operations os write and then read on A,they are both done in a same trasaction i.e t3 is reading value of A which has been written by T3 itself,not by anyother transaction.so,its no the case of strict schedule.