数据库系统原理精品教学（吉林大学）16-web答案.pdfVIP

C H A P T E R 1 6 Concurrency Control Solutions to Practice Exercises 16.1 Suppose two-phase locking does not ensure serializability. Then there exists a set of transactions T0 , T1 ... Tn−1 which obey 2PL and which produce a non- serializable schedule. A non-serializable schedule implies a cycle in the prece- dence graph, and we shall show that 2PL cannot produce such cycles. Without loss of generality, assume the following cycle exists in the precedence graph: T → T → T → ... → T → T . Let α be the