Question 76
A schedule is conflict-serializable if its precedence graph is -
A schedule is conflict-serializable exactly when its precedence (serialization) graph is acyclic.
A schedule is conflict-serializable if its precedence graph is -
A schedule is conflict-serializable exactly when its precedence (serialization) graph is acyclic.
A dirty read occurs when a transaction -
A dirty read is the reading of uncommitted data from another transaction, which may later be rolled back.
A lost update anomaly occurs when -
A lost update occurs when concurrent transactions update the same data and one update overwrites the effect of the other.
In the wait-die deadlock prevention scheme, when a younger transaction requests a lock held by an older transaction, the younger transaction -
Wait-die is non-preemptive: an older requester may wait for a younger holder, but a younger requester of an older holder is rolled back.
In database recovery, a log record is used primarily to -
Write-ahead logging records transaction changes so recovery can redo committed work and undo incomplete work after a failure.