For each lecture, we'll post slides, an outline of the content, a recording, and supplemental reading. Slides will be up before lecture (but not necessarily at 9:00am); we post slides with all animations (good for following along exactly) and with limited animations (good for studying/taking notes on). The outline and recording will be posted after lecture (but not necessarily at 3:00pm; likely the next day or so). You can do the supplemental reading before or after lecture; whatever works best for you.

• Slides: all animations, limited animations
• Outline
• Recording
• Supplemental Reading: Textbook §9.4 before §9.4.1, §9.5

After this lecture, at a minimum, you should be able to do the following:

• Explain why actually running schedules serially (not in parallel) has poor performance.
• Given a schedule of transactions, determine the final written state of any variables, as well as the results of any intermediate reads.
• Given multiple transactions, determine the conflicts among them.
• Given a schedule, determine the order of the conflicts
• Given a schedule, draw its conflict graph, and determine whether the schedule is conflict-serializable
• Given a schedule, apply locks according to 2PL (both the initial version and with reader-/writer- locks)
• Given a schedule that uses locks, determine whether it adheres to 2PL (both the initial version and with reader-/writer- locks)
• Given a schedule that uses 2PL but deadlocks, resolve the deadlock
• Explain why adding reader-/writer-locks improve the performance of 2PL

Practice problems

• 2019, Problem 2 (Solutions)
• 2018, Problems 3, 5 (Solutions)
• 2017, Problem 4 (Solutions)
• 2016, Problems 8, 9 (Solutions)
• 2015, Problems 7-9 (Solutions)