Problem 1
What is the two-phase locking protocol? How does it guarantee serializability?
Problem 2
What are some variations of the two-phase locking protocol? Why is strict or rigorous two-phase locking often preferred?
Problem 3
Discuss the problems of deadlock and starvation, and the different approaches to dealing with these problems.
Problem 4
Compare binary locks to exclusive/shared locks. Why is the latter type of locks preferable?
Problem 5
Describe the wait-die and wound-wait protocols for deadlock prevention.
Problem 6
Describe the cautious waiting, no waiting, and timeout protocols for deadlock prevention.
Problem 7
What is a timestamp? How does the system generate timestamps?
Problem 8
Discuss the timestamp ordering protocol for concurrency control. How does strict timestamp ordering differ from basic timestamp ordering?
Problem 11
How do optimistic concurrency control techniques differ from other concurrency control techniques? Why are they also called validation or certification tech. niques? Discuss the typical phases of an optimistic concurrency control method.
Problem 12
How does the granularity of data items affect the performance of concurrency control? What factors affect selection of granularity size for data items?