Explain strict two-phase locking, Database Management System

Assignment Help:

Explain Strict Two-Phase locking

A transaction T does not release any type of its exclusive (X) locks until that transaction commits or aborts. In this method no other transaction can access the item which is written by T unless the transaction T commits. This is a better method than the two discussed.

In 2PL, a transaction may not be capable to release its locks even after make use of it. The data item will stay locked until the transaction ends all the actions on all the data items. If each transaction in a schedule follows 2PL after that conflict serializability can be made sure. This is since if the schedule is not serializable, the precedence graph for schedule S contains transactions T1, T2 ..... Tn will have a cycle ... assume that a cycle consists of T1, T2 ..... Tn ,T1.  The meaning of this is that a lock operation by T2 is followed by an unlock operation by T1; A Lockoperation T3 is followed by an unlock operation by T2 ... and etc.  Though this is a contradiction of the assertion that T1 is by using two phase locking protocol. So the assumption that graph is having a cycle is wrong and therefore S is serializable.


Related Discussions:- Explain strict two-phase locking

Sub query in the update command, Sub query in the UPDATE command : Exam...

Sub query in the UPDATE command : Example :  //Double  the  commission  for  employees,  who  have  got  at  least  2 increments. UPDATE EMP SET COMM = COMM * 2 WHERE

Fragmentation, Differentiate between horizontal & mixed horizontal fragment...

Differentiate between horizontal & mixed horizontal fragmentation?

What is conceptual schema, What is conceptual schema? The schemas at th...

What is conceptual schema? The schemas at the view level are known as subschema that describe dissimilar views of the database.

Computing the closure of a set of functional dependency, What is meant by c...

What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.

State the design of associations, State the Design of Associations Bef...

State the Design of Associations Before designing associations, it is essential to know the way they are used. For this, analysis of association traversals is required. It is

ER diagram, Construct a clean ans concise ER diagram for the database indic...

Construct a clean ans concise ER diagram for the database indicating the cardinality mapping for Employee management syatem

What is data block, What is data block? Data Block - In oracle the data...

What is data block? Data Block - In oracle the data blocks are referred to as tablespaces. A tablespace is an fields of disk consisting of one or more disk files. A tablespace

Give an example of enforcement in typing, Give an example of enforcement in...

Give an example of enforcement in Typing. You can understand the idea of enforcement as it makes sure objects of dissimilar classes may not be interchanged as below:  Exampl

How does query tree represent relational algebra expression, How does a que...

How does a query tree represent a relational algebra expression?  Discuss any three rules for query optimisation, giving example as to when should each rule be applied.     Ans

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd