The Gateway to Computer Science Excellence
0 votes
223 views

Which of the following 2PL schemes guarantee conflict serializability?

  1. Basic 2PL
  2. Conservative 2PL
  3. Strict 2PL
  4. Rigorous 2PL
in Databases by Loyal (6.3k points)
edited by | 223 views
+1

For details you can see this..https://en.wikipedia.org/wiki/Two-phase_locking

1 Answer

0 votes
Any schedule which is possible under 2-PL scheme ensures conflict serializability
by Junior (951 points)
0
0
i am also having confusion in this thing.one thing that is sure is every conflict serializable schedule is not possible in basiz /strict/rigorous  2pl.

but i have also read somewhere that basic 2pl ensures conflcit serializability but can suffer from deadlock.

 

T1                T2              T3

sh(A)

r(a)           sh(B)

                  r(B)              sh(C)

                                       r(C)

                                       x(D)

                                        w(D)

                                        rel(C)

                                        rel(D)

                    x(C)

                     w(C)

                     rel(B)

                     rel(C)

x(B)

w(B)

rel(A)

basic 2pl schedule ensures conflict serilizability as  t3 -> t2 -> t1
0
Meanwhile got it. 2PL guaranteed conflict serializable schedule are proper set of conflict serializable schedules. i.e every 2PL schedule is conflict serializable but every serializable schedule is not to be ensured by 2PL.
0
ok..thnaks for confirming.and what about uther 2pl??do they ensure conflcit serializabiltiy??
0
All 2PL schemes guarantee conflict serializability.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,353 answers
198,477 comments
105,248 users