CS 4250: Database Management Systems

Fall 2022 - Homework 4

Concurrency Control and Recovery Homework

Upload to the CS Homework system on or before midnight on Friday, 16 December 2022. 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:

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

    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.
    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), T1: W(A), T2: W(B), T1: R(C), T2: R(C), T3: R(D), T3: W(D), T2: W(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.
    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. Consider the following schedule:

    T2: W(A), T3: R(A), T1: R(A), T3: R(A), T2: R(B), T3: R(D), T2: W(B), T3: W(D), T1: W(A), T2: R(C), T3: 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.
    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














    4. For questions 4-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 P3
    20 Update: T2 writes P2
    30 T2 abort
    40 Update: T5 writes P1
    50 T5 commit
    60 Update: T4 writes P2
    70 Update: T1 writes P4
    80 T5 end
    90 CLR: Undo T2 LSN 20
    100 T4 abort
    110 Update: T1 writes P2
    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.

  4. During Analysis:

  5. During Redo:

  6. During Undo:

  7. Consider these tables (from Homework 2).
    Engineer (engineerID: integer, lname: string, fname: string, jobtitle: string, email: string, proEngineerExamTitle: string, proEngineerExamPassDate: date, salary: integer, vacationDaysAccumulated: integer)
    Project (projectID: integer, name: string, startDate: date, endDate: date, customerID: integer, monthlyBudget: integer, totalBudget: integer, managerID: integer)
    ProjectEngineers (projectID: integer, engineerID: integer, hoursPerWeek: integer)
    Assume the Project table has 5,000 tuples in it, the ProjectEngineers table has 10,00 tuples in it, and the Engineer table has 1,000 tuples. Projects have 10 to 100 engineers working on them. Only 50 of the engineers also work as managers on projects.
    Also consider this question:

    Find the last and first names, and professional engineer exam titles of engineers who work on a project supervised by the person with a manager ID number equal to 123.

    One possible solution to the question is:

    SELECT lname, fname, proEngineerExamTitle
    FROM Engineer E, Project P, ProjectEngineers PE
    WHERE E.engineerID = PE.engineerID AND P.projectID = PE.projectD AND p.managerID = 123

    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.