Explain two phase locking protocol, Database Management System

Assignment Help:

Explain Two phase locking protocol

A transaction is consider as to follow the two-phase locking protocol if all locking operations precede the first unlock operation in the transaction. Such type of transaction can be divided into two phases: and expanding or growing (first) phase, throughout which new locks on items can be acquired but none can be released; and a shrinking (second) phase, throughout which existing locks can be released but no new locks can be obtained. This two-phase protocol can make sure the serializability because all the data items needed by a transaction will be locked at the starting of the  transaction and if other transaction needs to use those data items then it has to wait till they become unlocked.


Related Discussions:- Explain two phase locking protocol

Explain the two types of participation constraint, Explain the two types of...

Explain the two types of participation constraint.  Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i

Prepare heart failure registry database, Prepare Heart Failure Registry dat...

Prepare Heart Failure Registry database How are you today? Please I would like you to design a Heart Failure registry where doctors will log in to enter information about their

Glory be, what does glory be mean

what does glory be mean

desirable properties of decomposition, Desirable Properties Of Decompositi...

Desirable Properties Of Decomposition Decomposition is a process of dividing a relation into its projections that will not be disjoint. Please remind the Relational projection

Describe participation constraints, Describe Participation Constraints? ...

Describe Participation Constraints? Participation Constraints - The participation constraint exacts whether the existence of an entity depends on its being related to another

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

What is functional dependency, A Functional dependency is described by ...

A Functional dependency is described by X Y between two groups of attributes Y and X that are subsets of R specifies a constraint on the possible tuple that can make a relation

Which data type can store unstructured data, Which data type can store unst...

Which data type can store unstructured data? Raw data type can store unstructured data.

State the objectives of object design, Determine the OBJECTIVES of  object ...

Determine the OBJECTIVES of  object design After passing through this unit, you should be able to: describe and apply concept of generalisation; understand and appl

Managing databases, Code an Oracle Database trigger to enforce the constrai...

Code an Oracle Database trigger to enforce the constraint that an employee can never change his or her department.

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