1.

A ___________ is one where, for each pair of transactions Ti and Tj such that Tj reads a data item previously written by Ti , the commit operation of Ti appears before the commit operation of Tj(a) Partial schedule(b) Dependent schedule(c) Recoverable schedule(d) None of the mentionedThe question was asked in an online quiz.I would like to ask this question from Transaction Isolation in chapter Transactions of RDBMS

Answer»

Correct option is (c) RECOVERABLE schedule

Explanation: A Recoverable schedule is one where, for each PAIR of transactions TI and Tj such that Tj reads a data item PREVIOUSLY written by Ti , the COMMIT operation of Ti appears before the commit operation of Tj.



Discussion

No Comment Found

Related InterviewSolutions