1. Define these terms: conflict-serializable schedule, view-serializable schedule, strict schedule
2. Describe each of the following locking protocols: 2PL, Conservative 2PL.
3. Why must lock and unlock be atomic operations?
4. What is the phantom problem? Can it occur in a database where the set of database objects is fixed and only the values of objects can be changed?
5. Identify one difference in the timestamps assigned to restarted transactions when timestamps are used for deadlock prevention versus when timestamps are used for concurrency control.
6. State and justify the Thomas Write Rule.