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

Describe the terms ‘database'' and ‘data warehouse'', Problem: ‘Users a...

Problem: ‘Users and Information system specialists need to spend inordinate amounts of time locating and gathering data' (Watson and Hal, 1998) Recent developments in the ar

Primary index, Primary index A primary index is a file that has a sorte...

Primary index A primary index is a file that has a sorted series of records having two columns: a block address for that key field in the data file; and the ordering key field.

Explain thomas write rule, Explain Thomas' Write rule.  Show how it is diff...

Explain Thomas' Write rule.  Show how it is different from timestamp ordering protol Ans: In timestamp-based concurrency control the thomas Write rule is a rule. Given a Timest

Data base design, how to design a bakery business in data base

how to design a bakery business in data base

Determine the persistent object, Determine the Persistent object Persis...

Determine the Persistent object Persistent object can be stored in one of the following: Files Cheap, permanent, simple storage Low level (Write, Read) Ap

Define the categories of sql statements, Define the categories of SQL State...

Define the categories of SQL Statements? 1) Statements that don't return a result set. This statement class includes INSERT, DELETE, and UPDATE. 2)Statements that return

Define the wait for graph, Define the Wait for graph Ans: The wait-for-...

Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap

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