Two phase locking (2pl), Database Management System

Assignment Help:

Two Phase Locking (2PL)

The two-phase locking protocol having of two phases:

Phase 1: The lock acquisition phase: If a transaction T needs to read an object, it wants to obtain the S (shared) lock. If T needs to modify an object, it wants to obtain X (exclusive) lock. No conflicting locks are granted to a transaction. New locks on items can be obtained but no lock can be released till all the locks needed by the transaction are obtained.

Phase 2: Lock Release Phase: The existing locks can be released in any order but no new lock can be obtained after a lock has been released. The locks are held only till they are needed.

Normally the locks are taken by the DBMS. Any legal schedule of transactions that follows 2 phase locking protocol is sured to be serialisable. The 2 phase locking protocol has been confirmed for it correctness. Though, the proof of this protocol is beyond the scope of this Unit. You can refer to more readings for more details on this protocol.

 


Related Discussions:- Two phase locking (2pl)

Define deadlock prevention, Define deadlock prevention. Deadlock preven...

Define deadlock prevention. Deadlock prevention is a set of methods for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pre

Cost of reading a file , A file of employee have 10,000 blocks on a cylinde...

A file of employee have 10,000 blocks on a cylinder of a disk with characteristics r=8ms and btt=0.6ms I want to know the cost of read inthe file under following conditions for a q

Give the levels of data abstraction, Give the levels of data abstraction? ...

Give the levels of data abstraction? There are three levels of Data Abstraction a) Physical level b) logical level c) view level

What is a candidate key, What is a candidate key? Minimal super keys ar...

What is a candidate key? Minimal super keys are known as candidate keys.

Relational constraints, Relational and E-R Model There are three types o...

Relational and E-R Model There are three types of constraints on relational database that have: DOMAIN CONSTRAINT PRIMARY KEY CONSTRAINT INTEGRITY CONSTRAINT

Explain current page table and shadow page table, Explain current page tabl...

Explain current page table and shadow page table. The key idea behind the shadow paging method is to maintain two page tables during the life of the transaction: the current pa

ER Diagram, A database will be made to store information about patients in ...

A database will be made to store information about patients in a hospital. On arrival, each patient’s personal details (name, address, and telephone number) are recorded where poss

Define canonical cover, Define canonical cover? A canonical cover Fc fo...

Define canonical cover? A canonical cover Fc for F is a set of dependencies like F logically implies all dependencies in FC and Fc logically shows all dependencies in F.

Which element in the database can modified by changing, Which element in th...

Which element in the database can modified by changing the data dictionary? Data elements in the database can be changed or modified through changing the data dictionary.

Sql queries, find a name whose address is erode from student table

find a name whose address is erode from student table

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