[Announcements | Schedule and Readings | Assignments and Quizzes | Syllabus/Policies ]
Reading Questions, Lecture 13 (10/25)
Papers: Granularity of Locking and Degrees of Consistency,
This paper presents two distinct ideas: first, the notion that there is a "hierarchy of locking" -- e.g.,
that databases can lock pages, tables, tuples, or fields, and that there is a tradeoff between these
various degrees of locking. Second, the paper presents that idea that there are different degrees of
consistency which transactions can require, and those different degrees imply different locking disciplines with
different performance characteristics.
As you read the papers, consider the following questions:
- What is the tradeoff between coarse granularity (e.g., table-level) and fine granularity (e.g., tuple-level) locks in a database system?
- How does hierarchical locking help address the phantom problem (hint: see page 374 and the discussion
of index-interval locks.)
- What are the performance tradeoffs between the different degrees of locking?
- How does degree-0 locking ensure compatibility with all other locking modes?
Samuel Madden (madden at csail dot mit dot edu)
Last modified: Sun Oct 24 17:24:37 EDT 2004