Home › GATE CSE › computerscience › Database Management Systems › The DBMS detects a deadlock by finding
The DBMS detects a deadlock by finding
Atwo transactions with the same start timestamp
Ba chain of more than 3 waiting transactions
Ca transaction that has aborted more than once
Da directed cycle in the wait-for graph
Answer & Solution
Correct answer: D. a directed cycle in the wait-for graph
A cycle in the wait-for graph means each transaction in the cycle is waiting for a lock held by the next one, and no one can move. Detection = periodically run a cycle-finding algorithm on the graph. Same timestamp, chain length and abort history are unrelated to deadlock detection.
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