Home › GATE CSE › computerscience › Database Management Systems › Timestamp ordering is naturally deadlock-free be…
Timestamp ordering is naturally deadlock-free because
Ano transaction ever waits on a lock; conflicts produce aborts instead
Ball transactions are forced to run serially
Cevery item has at most one timestamp at any moment
Dthe optimiser detects cycles and removes them automatically
Answer & Solution
Correct answer: A. no transaction ever waits on a lock; conflicts produce aborts instead
Pure timestamp ordering has no notion of waiting on a lock. A conflict makes the late transaction abort rather than wait. With no waiting there can be no wait-for cycle, so no deadlock. Transactions can still run concurrently (option B is wrong); items have two timestamps (R-TS, W-TS), not one.
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