multiple-mode locks, Database Management System

Multiple-mode locks: It offers two locks: exclusive locks and shared locks. But why do we require these two locks? There are a lot of transactions in the database system that never updates the data values. These transactions can coexist with some other transactions that update the database. In such a condition multiple reads are permitted on a data item, so multiple transactions can lock a data item in the read or shared lock. On the other hand, if a transaction is an updating transaction, i.e., it updates the data items, it has to make sure that no other transaction can access (read or write) those data items that it needs to update. In this situation, the transaction places an exclusive lock on the data items. Therefore, a somewhat higher level of concurrency can be achieved in comparison to the binary locking scheme

Posted Date: 3/12/2013 2:37:14 AM | Location : United States







Related Discussions:- multiple-mode locks, Assignment Help, Ask Question on multiple-mode locks, Get Answer, Expert's Help, multiple-mode locks Discussions

Write discussion on multiple-mode locks
Your posts are moderated
Related Questions
What are stored and derived attributes? Stored attributes: The attributes keeps in a data base are known as stored attributes. Derived attributes: The attributes that are de

What is hashing file organization? In the hashing file organization, a hash function is computed on some attribute of every record. The result of the hash function specify in

Objectives differentiate DDBMS and conventional DBMS; Describe Network topology for DDBMS; Describe the concepts of horizontal and vertical fragmentation; Descr

Describe Data Manipulation language ? Data Manipulation Language (DML) - A data manipulation language is a language which enables users to access or manipulate data as organize


Question (a) Differentiate between the following terms: (i) Distributed Database v/s Distributed Database management System (ii) Homogeneous Distributed Database v/s Hete


Briefly explain the state diagram by taking one example. State Diagram - An object can be given a sequence of input instructions. The state of the object can vary depending u

What is a candidate key? Minimal super keys are known as candidate keys.

Boyce-Code Normal Form (BCNF) A relationship is said to be in BCNF if it is already in 3NF and the left hand side of each dependency is a candidate key. A relation who is in 3N