Exams › GATE › Technical

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?

1. I only
2. II only
3. Both I and II
4. Neither I nor II

Correct answer: Both I and II

Solution

Both statements are true because the strict two-phase locking protocol ensures that transactions are executed in a way that maintains conflict serializability and recoverability. Additionally, the timestamp-ordering concurrency control with Thomas' Write Rule allows for the generation of view serializable schedules that may not adhere to conflict serializability due to its handling of write operations.

Related GATE Technical questions

• A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
• Which one of the following kinds of derivation is used by LR parsers?
• In 16-bit 2’s complement representation, the decimal number −28 is:
• Let U = {1,2,...,n}. Let A = {(x,X)|x ∈ X, X ⊆ U}. Consider the following two statements on |A|. I. |A| = n2^(n−1) II. |A| = ∑(k=1 to n) k C(n,k) Which of the above statements is/are TRUE?
• Which one of the following is NOT a valid identity?
• If L is a regular language over Σ = {a, b}, which one of the following languages is NOT regular?

⚔️ Practice GATE Technical free + battle 1v1 →