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

Managing Data in Databases, Answer SQL Queries to extract data from data ta...

Answer SQL Queries to extract data from data tables and questions on mapping conceptual data models into relational data model.

Define various ways in which select statement, Define various ways in which...

Define various ways in which SELECT statement can be used for record selection Technology?  SELECT gives you control over a number of aspects for record retrieval: 1) Which

Which components of the schema architecture proposed by ansi, What are thre...

What are three components of the schema architecture proposed by ANSI/SPARC? The three component schema architecture proposed by ANSI/SPARC is as given below: External sche

Field, examples of fields in a database

examples of fields in a database

Define granularity and hierarchy of granularity of locks, Define granularit...

Define granularity, hierarchy of granularity of locks & multiple granularity locking. Explain the modified two phase locking along with multiple granularity locking. Ans: The s

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

What are the concurrency issues, Concurrency issues Data integrity...

Concurrency issues Data integrity: Threads accessing same object need to be synchronized, such as: banking account. Deadlock: One or more threads in system are perman

What is middleware, Question: a) What is Client/Server and what benefit...

Question: a) What is Client/Server and what benefits can be expected from Client/Server systems? b) Explain what middleware is and what it does. Why would MIS managers be p

Define the basic operations of the relational algebra, Define the basic ope...

Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

Optimistic concurrency contents -write-set(t), write-set(T): Each data ite...

write-set(T): Each data items that are written by a transaction T

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