Explain the lock based protocol, Database Management System

Assignment Help:

Lock Based Protocol

A lock is nothing but a mechanism that tells the DBMS whether a particular data item is being used by any transaction for read/write purpose. As there are two types of operations, i.e. read and write, whose basic nature are dissimilar, the locks for read and write operation might be behave differently.

Read operation performed by dissimilar transactions on the same data item poses less of a challenge. The value of the data item, if constant, can be read by any number of transactions at any given time.

 


Related Discussions:- Explain the lock based protocol

Explain the exists and unique functions of sql, Explain the EXISTS and UNIQ...

Explain the EXISTS and UNIQUE functions of SQL. Give an example for each? EXISTS: The EXISTS function takes one parameter that is a SQL statement. If any records exist which

What is a primary index, What is a primary index? A primary index is an...

What is a primary index? A primary index is an index whose search key also explains the sequential order of the file.

What are the disadvantages of relational data, What are the disadvantages o...

What are the disadvantages of relational data ? Disadvantages • Performance - If the number of tables among that relationships to be established are large and the tables t

Software engineering, Critically evaluate the bulleted list of information-...

Critically evaluate the bulleted list of information-related items in this case study. How are each contradictory to the notion of being an information-literate knowledge worker?

EER models, Ask question #MinimThe Georgia Tech Library (GTL) has approxima...

Ask question #MinimThe Georgia Tech Library (GTL) has approximately 16,000 members, 100,000 titles, and 250,000 volumes (an average of 2.5 copies per book). About 10 percent of the

find a non-redundant cover and canonical cove, Given the following set of ...

Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?

Illustrate the term- abstracting out common behaviour, Illustrate the term-...

Illustrate the term- Abstracting Out Common Behaviour Inheritance is not every time recognised during analysis phase of development, thus it is necessary to re-evaluate object

Distributed and client server databases, Distributed And Client Server Data...

Distributed And Client Server Databases Introduction This unit tells the distributed database systems which are primarily relational and one important execution model: the

Sparse and dense indexes, Sparse and Dense Indexes These indexes in pri...

Sparse and Dense Indexes These indexes in principle are the similar as that of indexes used at the back of the book. The key facts of the indexes are: They are arranged

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