0ch16-bygyb(冲突时的文件备份2015-06-0313_07_54)剖析.ppt

Deadlock prevention (Cont.) Timeout-Based Schemes : a transaction waits for a lock only for a specified amount of time. After that, the wait times out and the transaction is rolled back. thus deadlocks are not possible simple to implement; but starvation is possible. Also difficult to determine good value of the timeout interval. Deadlock Detection（死锁检测） Deadlocks can be described as a wait-for graph等待图, which consists of a pair G = (V,E), V is a set of vertices (all the transactions in the system) E is a set of edges; each element is an ordered pair Ti ?Tj. Deadlock Detection (Cont.) Wait-