Exclusive lock, Database Management System

Exclusive lock

  • It is asked for by a transaction on a data item that it wants to update.
  • No other transaction can put either a shared lock or an exclusive lock on a data item that is locked in an exclusive mode.

Let us explain the above two modes with the help of an instance. We will once again consider the transactions T1 and T2 but in addition a transaction T11 that search the total of accounts Y and Z.

Schedule

T1

T2

T11

S_Lock X

 

S_Lock X

 

S_Lock Y

 

S_Lock Y

 

Read X

 

Read X

 

S_Lock Y

 

 

S_Lock Y

S_Lock Z

 

 

S_Lock Z

 

 

 

Read Y

 

 

 

Read Z

X_Lock X

X_Lock X. The exclusive lock request on X is denied as T2 holds the Read lock. The transaction T1 Waits.

Read Y

 

Read Y

 

Display X+Y

 

Display X+Y

 

Unlock X

 

Unlock X

 

X_Lock Y

X_Lock Y. The previous exclusive lock request on X is granted as X is unlocked. But the new exclusive lock request on Y is not granted as Y is locked by T2 and T11 in read mode. Thus T1 waits till both T2 and T11 will release the read lock on Y.

Display Y+Z

 

 

Display Y+Z

Unlock Y

 

Unlock Y

 

Unlock Y

 

 

Unlock Y

Unlock Z

 

 

Unlock Z

Read X

Read X

 

 

Subtract 100

Subtract 100

 

 

Write X

Write X

 

 

Read Y

Read Y

 

 

Add 100

Add 100

 

 

Write Y

Write Y

 

 

Unlock X

Unlock X

 

 

Unlock Y

Unlock Y

 

 

                                                               Figure: Example of Locking in multiple-modes

Therefore, the locking as above results in a serialisable schedule. Now the query is can we release locks a bit early and have still no concurrency related problem?Yes, we can do it if we lock using two-phase locking protocol.

Posted Date: 3/12/2013 2:39:23 AM | Location : United States







Related Discussions:- Exclusive lock, Assignment Help, Ask Question on Exclusive lock, Get Answer, Expert's Help, Exclusive lock Discussions

Write discussion on Exclusive lock
Your posts are moderated
Related Questions
Which file organization provides very fast access to any arbitrary record of a file? Hashed file organization provides very fast access to any arbitrary record of a file.

What is Relational Algebra? Relational algebra is a Procedural query Language?

A database is a set of data. But, is the data kept in a database trustworthy? To answer that query we must first answer the question. What is integrity? Integrity simply means t

How is Oracle used in PL/SQL? Define the features of process and how they are defined? PL/SQL - PL/SQL is Oracle's procedural language (PL) superset of the Structured

Explain the terms primary key, candidate key, alternate key and secondary key. In the given table identify every key? STUDENT(SID,Regno, Name, City) Primary Key: The prim

Most computer systems authenticate users by asking them for the user name and password. However, the user names and passwords often can be guessed by hackers. Suggest an automated,

Object-oriented decompositions Object-oriented decompositions of systems better are able to cope with change. Each subsystem has a well-defined interface which communicates with

Explain the concept of QBE? Query-by-example represents a visual/graphical approach for accessing information in a database by the use of query templates called as skeleton tab

Express the following queries in SQL: (a) Write the SQL code that will create ALL the four tables given in the appendix. Your answer should not contain the primary key and

I need an ERD created for any original database(can be on anything). It needs to be 3NF. I then need all the CREATE STATEMENTS, INSERT STATEMENTS(anything you can think of as long