Types of Locks

There are two necessary types of locks:

• Binary lock: This locking mechanism has two states for to a data item: locked or unlocked
• Multiple-mode locks: In this locking type every data item can be in 3 states read locked or shared locked, write locked or exclusive locked or unlocked.

Let us first take an instance for binary locking and describes how it solves the concurrency related troubles. Let us reconsider the transactions T1 and T2 for this purpose; though we will add to needed binary locks to them.

Schedule T1 T2 Lock X Lock X   Read X Read X   Subtract 100 Subtract 100   Write X Write X   Unlock X Unlock X   Lock X   Lock X Lock Y   Lock Y Read X   Read X Read Y   Read Y Display X+Y   Display X+Y Unlock X   Unlock X Unlock Y   Unlock Y Lock Y Lock Y   Read Y Read Y   Add 100 Add 100   Write Y Write Y   Unlock Y Unlock Y

 

                                                         Figure: An incorrect locking implementation

Does the locking as completed above solve the problem of concurrent transactions? No the similar problems still remains. Try working with the old value. Therefore, locking should be completed with some logic in order to make sure that locking results in no concurrency related problem. One such answer is given below:

Schedule	T1	T2
Lock X	Lock X
Lock Y	Lock Y
Read X	Read X
Subtract 100	Subtract 100
Write X	Write X
Lock X (issued by T2)	Lock X: denied as T1 holds the lock. The transaction T2 Waits and T1 continues.
Read Y	Read Y
Add 100	Add 100
Write Y	Write Y
Unlock X	Unlock X
	The lock request of T2 on X can now be granted it can resumes by locking X
Unlock Y	Unlock Y
Lock Y		Lock Y
Read X		Read X
Read Y		Read Y
Display X+Y		Display X+Y
Unlock X		Unlock X
Unlock Y		Unlock Y

                                                              Figure: A correct but restrictive locking implementation

Therefore, the locking as above when you get all the locks at the starting of the transaction and release them at the end ensures that transactions are implemented with no concurrency related problems. Though, such a scheme limits the concurrency. We will talk about a two-phase locking method in the next subsection that gives sufficient concurrency. Though, let us first discuss multiple mode locks.

Posted Date: 3/12/2013 2:36:18 AM | Location : United States

Ask an Expert

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

Write discussion on Types of locks
Your posts are moderated

Write your message here..

Related Questions

A distributed transaction, A Distributed Transaction Let us demonstrate... A Distributed Transaction Let us demonstrate the concept of a distributed transaction by considering a banking system having of three branches located in 3 different cities. Ev

Determine the minimal set of functional dependencies, Determine the minimal... Determine the minimal set of functional dependencies for the following data. This table is part of the OHSU database of extracurricular activities and tracks the DMICE band's co

What are domain constraints, What are domain constraints?  A  domain is... What are domain constraints?  A  domain is  a  set  of  values  that  might  be  assigned to an attribute  .all  values that appear in a  column of a relation must be taken fro

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

Explain the strategy of database planning, Explain the Strategy of Databas... Explain the Strategy of Database Planning ?

Dirty reads-problems of concurrent transactions, Dirty Reads: T10 reads a ... Dirty Reads: T10 reads a value which is updated by T9. This update has not been committed and T9 aborts. T9 T10 Value of x old value = 200

Explain generalization and aggregation in e_r diagram, Explain the concept ... Explain the concept of generalization and aggregation in E_R diagrams. Give one example for each one of them? Generalization: Consider extending the entity set account throug

Compare wait-die deadlock prevention with wait-wound scheme, Compare wait-d... Compare wait-die deadlock prevention scheme with wait-wound scheme   Ans:  Wait-Die Scheme  a) Based upon a nonpreemptive technique.  b) If Pi requests a resource present

List out user authorization to modify the database schema, List out various... List out various user authorization to modify the database schema. a)  Index authorization b)  Resource authorization c)  Alteration authorization d)  Drop authorizat

What are the features of embedded sql explain, What are the features of emb... What are the features of embedded SQL? Explain. Embedded SQL - SQL could be implemented within two ways. It can be used interactively or embedded in a host language or throu