1.

If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are(a) Non conflict equivalent(b) Equal(c) Conflict equivalent(d) Isolation equivalentThis question was addressed to me during an interview.This key question is from Serializability topic in division Transactions of RDBMS

Answer»

Right option is (c) Conflict EQUIVALENT

The best I can EXPLAIN: If a schedule S can be TRANSFORMED into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are conflict equivalent. Not all serial SCHEDULES are conflict equivalent to each other.



Discussion

No Comment Found

Related InterviewSolutions