Strict 2pl-two phase locking (2pl), Database Management System

Assignment Help:

Strict 2PL:Though, this basic 2PL suffers from the trouble that it can result into loss of isolation / atomic property of transaction as theoretically speaking once a lock is released on a data item it can be changed by another transaction before the first transaction aborts or commits.

To leave such a situation we use strict two phase locking. The strict 2PL is graphically depicted in Figure. Though, the basic drawbacks of strict 2PL are that it restricts concurrency as it locks the item afar the time it is required by a transaction.

                                 693_Strict 2PL.png

                                                           Figure: Strict Two Phase Locking

Does the two phase locking solve all the problems of concurrent transactions? No, the strict 2PL answers the problem of concurrency and atomicity, though it introduces another problem.


Related Discussions:- Strict 2pl-two phase locking (2pl)

Write short notes on index structure of files, WRITE SHORT NOTES ON INDEX S...

WRITE SHORT NOTES ON INDEX STRUCTURE OF FILES? There are two basic parts of indices 1.   Ordered indices 2.   Hash indices Every technique must be evaluated on the bas

Physical location of record is determined by which formula, The physical lo...

The physical location of a record is determined by which mathematical formula that transforms a file key into a record location? The physical location of a record is determined

Create table and insert data manufacturer-dbms, Create a table according to...

Create a table according to given data:  AmbulanceDriver(Driver_Number#, Name, Address, Birth_Date) AmbulanceDriverTeam(Team_Number#, Driver_Number#, Join_Date, Lea

Set difference, Set Difference If R1 and R2 are two union compatible re...

Set Difference If R1 and R2 are two union compatible relations or relations then result of R3 =R1- R2 is the relation that have only those tuples that are in R1 but not in R2.

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.

Relational schema for person, Example: RELATIONAL SCHEMA for PERSON: ...

Example: RELATIONAL SCHEMA for PERSON: PERSON (PERSON_ID: integer, NAME: string, AGE: integer, ADDRESS: String) RELATION INSTANCE In this instance, m = 3 and n = 4

Discuss how the bi-directional implementations are made, Discuss how the bi...

Discuss how the bi-directional Implementations are made. In bi-directional implementation of the association, a pair of references must implement every link. The declarations a

Database tables design and test queries, Load sample data into the database...

Load sample data into the database tables design and test queries to return the following information • All rows and columns for employees • All rows and columns for customers •

Physical database design issues, Physical Database Design Issues The da...

Physical Database Design Issues The database design includes the process of logical design with the use of E-R diagram, normalisation, etc., followed by the physical design.

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