CS 4250: Database Management Systems

Fall 2021 - Homework 4

Concurrency Control and Recovery Homework

Question 6 replaced with new question on 8 Dec 2021.

Upload to the CS Homework system on or before midnight on 13 December 2021. Typed, in a plain text, PDF or MS Word document.

(Strongly prefer plain text. Will accept PDF or MSWord documents, if typed.)

Handwritten answers, on paper or as photographs, strongly discouraged.

This is an individual assignment. All work must be your own. You should not look at any other student's work (in whole or in part, on paper or on screen), nor allow anyone else to look at yours, during the course of this assignment.

Note: T<number> identifies a transaction numbered number. R(<letter>) identifies a read operation on database object letter. W(<letter>) identifies a write operation on database object letter.

Questions

  1. Consider the following schedule:

    T1: R(A), T1: W(A), T3: R(C), T3: R(D), T2: R(C), T2: W(C), T3: R(A), T1: R(B), T1: W(B), T2: R(B), T2: R(D), T2: W(D), T3: W(A)

    Is the schedule serializable? If so, show an equivalent serial transaction order. If not, precisely describe why not.

    If relevant, fill in this table with the equivalent serial transaction order. Time proceeds from left to right, with only one action possible in each time slot.
    Serializable Schedule Time 1 Time 2 Time 3 Time 4 Time 5 Time 6 Time 7 Time 8 Time 9 Time 10 Time 11 Time 12 Time 13 Time 14 Time 15
    T1














    T2














    T3














  2. Consider the following schedule:

    T2: W(A), T3: R(A), T1: R(A), T3: R(A), T2: R(B), T2: W(B), T1: W(A), T3: R(B), T3: W(A), T1: R(C), T2: R(C)

    Is the schedule serializable? If so, show an equivalent serial transaction order. If not, precisely describe why not.

    If relevant, fill in this table with the equivalent serial transaction order. Time proceeds from left to right, with only one action possible in each time slot.
    Serializable Schedule Time 1 Time 2 Time 3 Time 4 Time 5 Time 6 Time 7 Time 8 Time 9 Time 10 Time 11 Time 12 Time 13 Time 14 Time 15
    T1














    T2














    T3














    3. For questions 3-5, consider the execution of the ARIES recovery algorithm given the following log:

    LSN Log Record
    00 begin_checkpoint
    05 end_checkpoint
    10 Update: T2 writes P1
    20 Update: T1 writes P1
    30 Update: T3 writes P3
    40 Update: T3 writes P2
    50 T2 commit
    60 T3 abort
    70 CLR: Undo T3 LSN 40
    80 Update: T1 writes P2
    90 T2 end
    100 Update: T4 writes P3
    110 T4 commit
    X - crash, restart

    For the questions below, when you are asked which log records are read, you are to supply the exact list of LSNs from log above. When data pages are asked for, you are to supply the exact list of page identifiers from the log above. And so on. Be specific and concrete in your answers, answering specifically for the provided log.

    Operations can be identified using the LSN for the log record recording that operation. (So, of course, can the log record itself.)

    Generic statements or quotations from the textbook (or slides) will earn 0 points. Example: "all the pages" == 0 points. "P1, P2 and P3" == more than 0 points, assuming those are the pages read. (Don't use English. List the log record numbers, list the page numbers, etc.)

    For questions 3-5, parts a-c are separate questions. Answer a through c separately. Label your answers so that it is clear what is your answer to '3.a' and what is your answer to '4.c', and so on.

  3. During Analysis:

  4. During Redo:

  5. During Undo:

    6. Question added 8 Dec 2021

  6. New Question, replacing previous #6
    Consider the execution of the ARIES recovery algorithm given the following log:

    LSN Log Record
    00 begin_checkpoint
    05 end_checkpoint
    10 Update: T1 writes P1
    20 Update: T2 writes P4
    30 Update: T3 writes P2
    40 T3 commit
    50 Update: T2 writes P2
    60 T1 abort
    70 CLR: Undo T1 LSN 10
    80 Update: T4 writes P3
    90 T1 end
    X - crash, restart

    Same rules for this question as for 3-5 -- no generic answers accepted.

    During Analysis:

    7. Question removed 8 Dec 2021
  7. Consider these tables (from Homework 2).
    Project (projectID: integer, name: string, startDate: date, endDate: date, customerID: integer, monthlyBudget: integer, totalBudget: integer, managerID: integer)
    Customer (customerID: integer, name: string, address: string, phone: char(10), contactName: string, contactPhone: char(10))
    Assume the Project table has 10,000 tuples in it and the Customer table has 500 tuples. Half of the projects in the database have budgets above a million dollars.

    Also consider this question:

    Find the names of projects and the names of the customers paying for those projects, where the project total budget is bigger than $1,000,000. The resulting names should be alphabetized by project name.

    One possible solution to the question is:

    SELECT P.name, C.name FROM Project P, Customer C WHERE P.customerID = C.customerID AND P.totalBudget > 1000000 ORDER BY P.name;

    a) Translate this SQL query into a corresponding relational algebra expression (and write down the expression).
    b) Then draw the query tree for your relational algebra expression.
    c) Using equivalencies of relational algebra expressions, re-write your relational algebra expression into a more efficient form, if possible. Draw the new, corresponding query tree. Explain why your new expression is more efficient.