MIT OpenCourseWare, 6.830 Database Systems, Fall 2010, Prof. Carlo Curino and Prof. Michael Stonebraker. Licensed CC BY-NC-SA 4.0. Reorganized into modules by Sequence 106. No lecture videos were published for this course; each session is notes plus readings. Source · CC BY-NC-SA 4.0
Module 4 · Transactions and concurrency control · Activity 14 of 32
Lecture 11: Optimistic concurrency control
Lecture notes · Michael Stonebraker
Readings and discussion questions
In this lecture, we will continue our discussion of concurrency control and study another approach for isolating transactions called “Optimistic Concurrency Control.” Read:
Kung, H. T., and John T. Robinson. “On Optimistic Methods for Concurrency Control.” ACM Transactions on Database Systems 6, no. 2 (1981): 213-226. In the Red Book.
As you read, note any terms you are unfamiliar with and come to class prepared to answer the following questions:
- When would you expect that optimistic concurrency control would outperform locking-based concurrency control?
- Can optimistic concurrency control result in deadlock?
- How would you implement optimistic concurrency control in SimpleDB?
Assigned by MIT for this session; links go to the papers where MIT linked them. Books: Readings in Database Systems (the Red Book, 4th ed.) and Ramakrishnan & Gehrke.