alleryStart learning →A concurrent schedule is called serializable if
Asame final state as some serial schedule of the same transactions
Bevery operation in it has at most one conflicting operation
Cit runs faster than the corresponding serial schedule
Dit commits all transactions before the first abort
Answer & Solution
Correct answer: A. same final state as some serial schedule of the same transactions
Serializability is defined by behavioural equivalence to some serial order: the final state must match what some serial schedule would have produced.
We don't care which serial order works, only that one does.
The other options describe unrelated properties (recoverability, performance, conflict counts).
Keep practising Database Management Systems
Browse all Database Management Systems questions for GATE CSE, or explore more Computer Science topics.