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

Er diagram, a publishing company produce scientific books on various subjec...

a publishing company produce scientific books on various subjects. the books are written by authors who specialize in one particular subject. the company employs editors who, not n

ER-diagram, The State of NewYork certifies firefighters throughout state an...

The State of NewYork certifies firefighters throughout state and keep track all of them, as well as of the state’s fire departments. Each fire department has unique department numb

Why do so various organizations use mysql, Why do so various organizations ...

Why do so various organizations use MySQL? Advantages: Open source Highly efficient Offers a high scalability in terms of size and connectivity. Highly prote

B2b business uk database, We have a new website where I need someone to 1: ...

We have a new website where I need someone to 1: Inhabit the back end with all the recruitment agencies in the UK. I require someone who is not manually going to do this, but who w

Why object-oriented system use the relational dbms, Why, generally does an ...

Why, generally does an object-oriented system use the relational DBMS? The reasons for using relational DBMS for OO systems could be any combination of following: a. Many or

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?

Which database object does not physically exist, Which database object does...

Which database object does not physically exist? A view database object does not physically exist.

Non-redundant cover and canonical cover, Given the following set of functio...

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.Find a non-redundant cover. b.Find a canonical cover.

Explain the two types of participation constraint., Explain the two types o...

Explain the two types of participation constraint. 1. Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i

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