Question 1

Consider the following (incomplete) schedule involving transactions T1, T2, T3, and T4.

Your answers should consider only what is contained in the schedule snapshot below (i.e., do not worry about what may happen afterward).

• Is this schedule recoverable? Explain.
• Does this schedule avoid cascading aborts? Explain.
• Could it be generated by non-strict 2PL? Explain.
• Could it be generated by strict 2PL? Explain.

Question 2

Determine if the following schedules are: conflict serializable, and/or serializable. If it is, provide a possible equivalent serial schedule.

Schedule A

Schedule B

Schedule C

Schedule D

Question 3

Determine if the schedules B, C, D in Question 2 will deadlock if 2 PL is used, and state which transactions deadlock if any.

Assume that lock requests are filled in the order they arrive in the schedule. If a transaction has a request in queue, it will not ask for other locks.

A shared lock is forced into the queue if there is an exclusive lock request on the same object and is also in queue. This is to prevent starvation.

Furthermore, a lock upgrade request (read lock to write lock) is granted immediately if the requesting transaction is the only holder of the shared lock on the object. Otherwise, the requester must wait until all other shared locks are released.

Part 2: ACID and ARIES Protocol

Question 4 (15 points)

Consider the following example of operations on a DBMS:

1. Transaction 1 modifies Page 1 2. Transaction 1 modifies Page 3
2. Transaction 2 modifies Page 2
3. Crash!!!!

Assume that:

• The memory can only accommodate 2 pages
• Avoid writing pages back to disk if not necessary ( do not force )
• No logging or any other kind of book keeping technique is used here

• [3 points] At timestamp 3, What does the DBMS have to do to make sure there is space to modify Page 2?
• [4 points] After timestamp 4, the DBMS came back without running any recovery protocol. Which property in ACID does it violates now? Explain it in 1~2 sentences.

Now consider another scenario:

1. Transaction 1 modifies Page 1
2. Transaction 1 modifies Page 3
3. Transaction 1 commits
4. Transaction 2 modifies Page 2
5. Crash!!!!

Again, assume that:

• The memory can accommodate 4 pages
• Avoid writing pages back to disk if not necessary ( do not force )
• No logging or any other kind of book keeping technique is used here

• [4 points] After timestamp 5., the DBMS came back without running any recovery protocol. Which property in ACID does it violates now? Explain it in 1~2 sentences.
• [4 points] How can we restore this property without using logging? Is there any tradeoff?

Question 5 (19 points)

Consider the following log file, which was found on disk, and the ARIES recovery protocol:

• Describe the dirty page table at the end of the ANALYSIS phase of recovery. For example:

• Describe the transaction table at the end of the ANALYSIS phase of recovery. For example:

• Which transactions are loser transactions, whose result does not persist?
• Are there any new compensation log records (CLRs) written during the REDO phase of recovery? Explain.
• How many CLR records are added in the UNDO phase? Briefly describe them.