TransactionalInformation Systems まとめ 第四章 （１）

１．章構成

4.1 Goal and Overview

4.2 General Scheduler Design

4.3 Locking Schedulers

4.3.1 Introduction

4.3.2 The Two-Phase Locking Protocol

4.3.3 Deadlock Handling

4.3.4 Variants of 2PL

4.3.5 Ordered Sharing of Locks

4.3.6 Altruistic Locking

4.3.7 Non-Two-Phase Locking Protocols

4.3.8 On the Geometry of Locking

4.4 Nonlocking Schedulers

4.4.1 Timestamp Ordering

4.4.2 Serialization Graph Testing

4.4.3 Optimistic Protocols

4.5 Hybrid Protocols

4.6 Lessons Learned

Exercises

Bibliographic Notes

２．概略

　この章ではCSRのスケジュールを生成することをターゲットにする（we will concentrate on schedulers that produce conflict-serializable schedules）

　（１） Criteria

スケジュールをverifyするにあたっては、safeとpowerをcriteria。

how to designscheduling protocols in general, and on how to verify a given protocol and prove it correct.With respect to the latter, we will be interested in two criteria:

First, each protocol that we present has to be safein the sense that all histories it outputs have to be members of CSR, the class of conflict-serializable schedules.

Second, we are interested in thescheduling powerof a protocol, or in its ability to produce some class of serializable histories (e.g., class CSR) in its entirety or partially only.

　（２） Transactionの状態遷移モデル

図は別途作成予定。