Lectures: 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23

Overview

In this lecture, we will study another approach to concurrency control 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 (June 1981): 213-226. Also in Readings in Database Systems. San Fransisco, CA: Morgan Kaufmann, 1998. ISBN: 1558605231.

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?