GATE 2024 Databases Foundation Quiz 60

Consider the following schedule :

r₁(c) r₃(b) w₂(c) r₄(a) r₁(a) w₁(b) w₃(c) w₁(a) w₄(d) w₃(a) r₁(d) r₃(d) w₂(c) w₃(a)

The above schedule is serializable as

Consider the following statements about two transactions, T_i & T_j & schedules S & S′.

S₁: If T_i reads the initial value of A is S, then T_i should also read the initial value of data item A is S′

S₂: If T_j produces the final write operation of A in S, then T_j should also perform the final write operation of A in S′

S₃: If T_j reads a value produced by T_i in S, then T_j must also read the value produced by T_i in S′.

S₄: If T_i produces the final read operation of A in S, then T_i should also perform the final read operation of A in S′.

Schedule S is the serial schedule & S′ is non Serial schedule. Which of the above statements is/are the necessary conditions for S′ to be view serializable?

Which of the following is/are Incorrect?

Which of the following is/are correct according to Graph based protocol concerning the below Graph?

Which of the following is/are correct statements?