Question
Consider the following two statements about database transaction schedules:
I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.
II. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable schedules that are not conflict serializable.
Which of the above statements is/are TRUE?
Official answer and solution
- Official answer
- C
- From
- Official GATE 2019 answer key
Solution
Analyze the properties of Strict 2PL and Timestamp-Ordering with Thomas' Write Rule.
Evaluating Statement I:
- The Strict Two-Phase Locking (Strict 2PL) protocol requires all exclusive (write) locks to be held until the transaction commits or aborts.
- Like basic 2PL, Strict 2PL ensures conflict serializability because the lock point ordering provides an equivalent serial schedule.
- In addition, because no uncommitted writes can be read or overwritten by other transactions, Strict 2PL generates schedules that are strict. Since strict schedules are a subset of cascadeless schedules, which are in turn a subset of recoverable schedules, every Strict 2PL schedule is guaranteed to be recoverable. Statement I is TRUE.
Evaluating Statement II:
- Basic Timestamp Ordering concurrency control generates conflict serializable schedules.
- Thomas' Write Rule modifies the write rule: if a write request arrives from a transaction with timestamp smaller than the read/write timestamp, the obsolete write is simply ignored without aborting the transaction.
- Ignoring obsolete writes allows schedules that are view serializable but not conflict serializable (due to blind writes). Statement II is TRUE.
Therefore, both statements I and II are TRUE.
C
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2019 Computer Science and Information Technology (CS)
- Question
- 21 of 65, printed as CS Q.11
- Section
- Computer Science and Information Technology
Report an error in this question
GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.