in Databases retagged by
421 views
4 votes
4 votes
Which of the following statements is/are false?
  1. In a cascade-less schedule if a transaction $T_j$ read a data item written by transaction $T_i$ then the commit of $T_i$ has to be before this read operation of $T_j$
  2. A recoverable schedule is also cascade-less
  3. Not all conflict-serializable schedules are also 2PL
  4. A schedule that is $2 \mathrm{PL}$ (could have been produced using the $2 \mathrm{PL}$ locking protocol) is conflict-serializable.
in Databases retagged by
421 views

2 Comments

Answer explanation please 🙏
0
0
@xd_punk answer of B,C,D are trivial i think you are confused with option A

option A indirectly states that there is no dirty read and we know that

a schedule is cascade-less iff(<->) there is no dirty read

so A) is true
1
1

Please log in or register to answer this question.