retagged by
1,021 views
0 votes
0 votes

A' is set of all possible schedules

'C' is set of all possible schedules that are guaranteed to produce a correct final result

'S' is the set of all serializable schedules

'P' is the set of all schedules possible under 2-phase locking protocol 
Which is FALSE?

  1. $P\subseteq C$
  2. $S\subset P$
  3. $S\subseteq P$
  4. $P\subset C$
retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
gateexplore asked Jun 30, 2023
199 views
Show that the two phase locking protocol ensures conflict serializability and that transaction can be serialized according to their lock points.
1 votes
1 votes
1 answer
2
Parshu gate asked Sep 21, 2017
328 views
If total n! serial schedules are possible , will all of them give the same result?
2 votes
2 votes
1 answer
3
just_bhavana asked Aug 4, 2017
12,737 views
Answer is given as D. Not serializable, agreed. But how is it strict??
0 votes
0 votes
1 answer
4