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 components of database system in details., Explain the compone...

Explain the components of Database System in details.

A b-tree of order how much children m has maximum, A B-tree of order how mu...

A B-tree of order how much children m has maximum ? m has maximum m mchildren in a B tree.

Example of weak entity, Consider the entity type dependent related to emplo...

Consider the entity type dependent related to employee entity, which is used to keep track of the dependents of every employee. The attributes of dependents are: name, sex, birth d

Distinguish among different kinds of parameters, How can one distinguish am...

How can one distinguish among different kinds of parameters? Input parameters are used to pass data to subroutines. Output parameters are used to pass data from subrout

What is dml, What is DML (Data Manipulation Language)? This language th...

What is DML (Data Manipulation Language)? This language that enable user to access or manipulate data as organised by appropriate data model. Procedural DML or Low level: DM

What are the various symbols used to draw an e-r diagram, What are the vari...

What are the various symbols used to draw an E-R diagram? Explain with the help of an example how weak entity sets are represented in an E-R diagram. Various symbols used to d

Give short note on the following terms- dirty pages and etl, Give short not...

Give short note on the following terms:Dirty pages and ETL a.) Dirty pages. These are buffer pages which comprise modifications which haven't been written to disk. b.

Single valued normalisation, Single Valued Normalisation  Codd in the y...

Single Valued Normalisation  Codd in the year 1972 formed three normal forms (1NF, 2NF, and 3NF). These were based on functional dependencies between the attributes of a relati

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.

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