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

Define an operator that a relational algebra does not have, Define an opera...

Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

What are the objectives of query processing, What are the objectives of que...

What are the objectives of query processing?       Ans: The objectives of query processing is to transform a query written in a high level language into a accurate and efficien

Increased overheads on update-data replication, Increased overheads on upda...

Increased overheads on update : On the drawbacks side, it will need the system to ensure that all replicas of a relation are consistent. This shows that all the replicas of the rel

What is transaction, What is transaction? Transaction is a unit of prog...

What is transaction? Transaction is a unit of program implementation that accesses and possibly updated several data items.

Ways to suggest the dba, a)  Suppose we updated the catalog tables in real ...

a)  Suppose we updated the catalog tables in real time, that is, after every update, insert, or delete SQL statement were executed-rather than only running RUNSTATS once every few

Define timestamp ordering, Define Timestamp ordering Ans In timestamp-b...

Define Timestamp ordering Ans In timestamp-based method, a serial order is made among the concurrent transaction by assigning to every transaction a unique nondecreasing number

Hangman, a method named WonGame that checks each letter in the word is matc...

a method named WonGame that checks each letter in the word is matched by its label

Explain the project-join normal form, Explain the Project-Join normal form ...

Explain the Project-Join normal form A relation R is in PJNF along with respect to a set of functional dependencies D if for all join dependencies of the outline *(R 1 , R 2 ,

What are wait-for-graphs, What are wait-for-graphs?Give the algorithm to co...

What are wait-for-graphs?Give the algorithm to construct a wait-for-graph from a given schedule of transactions? How can deadlocks be detected from wait-for-graphs?   Ans:  The

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