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 an attributes, What are attributes? Give examples. An entity is...

What are attributes? Give examples. An entity is shown by a set of attributes. Attributes are descriptive properties possessed by every member of an entity set. Example: pos

What is the used of specifying alias, What is the used of specifying alias?...

What is the used of specifying alias? Specifying alias: is used to rename column or attribute in a table.

Extended e-r features, Although, the essential features of E-R diagrams are...

Although, the essential features of E-R diagrams are enough to design many database situations. Though, with more difficult relations and advanced database applications, it is need

Create table employee and enter employee data in sql, Create table employee...

Create table employee and enter employee data in SQL? Consider the following relational schemas: EMPLOYEE (EMPLOYEE_NAME, STREET, CITY) WORKS (EMPLOYEE_NAME, COMPANYNAME, SAL

Key, Q.   Explain the terms key constraints participation constraints and m...

Q.   Explain the terms key constraints participation constraints and mapping caradinalities in ER model.  Participation Constraints :   The participation of an entity set E i

Define deadlock detection, Define Deadlock detection If a system does ...

Define Deadlock detection If a system does not employ a few protocols that make sure deadlock freedom, after that a detection and recovery scheme should be used. An algorithm

Example of sequences, Example : Create a sequence named SEQSS that starts a...

Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000.  CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA

Optimistic concurrency control, Optimistic Concurrency Control Is locki...

Optimistic Concurrency Control Is locking the only way to stop concurrency related problems? There exist some other ways too. One such way is known as an Optimistic Concurrency

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

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