Home › GATE CSE › computerscience › Database Management Systems › A concurrent schedule is called serializable if
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).
Related questions
The main reasons production DBMSs avoid shadow paging in favour of WAL are that shadow pagWhat is the purpose of a Compensation Log Record (CLR) in ARIES?ARIES recovery is structured as exactlyFuzzy checkpoints differ from naive checkpoints byIn standard log-based recovery, the order of operations isAfter a crash, with checkpointing, the recovery system scans the logA complete log record for a write operation includesPer WAL semantics, a transaction is officially committed at the moment