Register

GATE Overflow Test Series | Mixed Subjects | Test 3 | Question: 19

• edited by
108 views
1 votes
1 votes

Which of the following is/are correct with respect to concurrency control of database transactions? (Mark all the appropriate options)

  1. There are schedules common to both $\text{2PL}$ and time-stamp based protocol
  2. Basic time-stamp based concurrency control ensures serializability and freedom from deadlock but the schedule may not be recoverable
  3. The use of Thomas' write rule allows schedules to be generated that would not have been possible with basic timestamp protocol
  4. There are schedules that can be produced by basic time-stamp based protocol but not $\text{2PL}$
• edited by
User Avatar

1 Answer

1 votes
1 votes
All the given statements are TRUE.

There are schedules common to both $\text{2PL}$ and time-stamp based protocol.

There are schedules that can be produced by basic time-stamp based protocol but not $\text{2PL}$ and vice versa.

So, the correct answer is $A; B; C; D.$
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
3
gatecse asked Oct 15, 2020
95 views
GATE Overflow Test Series | Mixed Subjects | Test 3 | Question: 13
If there are $n$ transactions each having $m_{1},m_{2},\dots,m_{n}$ ...
If there are $n$ transactions each having $m_{1},m_{2},\dots,m_{n}$ operations respectively, the number of concurrent schedules possible is ______ (Mark all the appropria...
User Avatar
Link Copied!