Optimistic concurrency control, Database Management System

Optimistic Concurrency Control

Is locking the only way to stop concurrency related problems? There exist some other ways too. One such way is known as an Optimistic Concurrency control.

The basic logic in optimistic concurrency control is to permit the concurrent transactions to update the data items supposing that the concurrency related trouble will not occur. Though, we require to reconfirm our view in the validation phase. Thus, the optimistic concurrency control algorithm has the following phases:

a)   READ Phase: In a read phase, transaction T reads the data items from the database into its private workspace. All the updates of the transaction can only alter the local copies of the data in the private workspace.

b)   VALIDATE Phase: Checking is performed to verify whether the read values have changed during the time transaction was updating the local values. This is performed by evaluating the current database values to the values that were read in the private workspace. In case, the values have altered the local copies are thrown away and the transaction aborts.

c)   WRITE Phase: In a write phase, if validation phase is successful the transaction is committed and updates are applied to the database, otherwise the transaction is rolled back.


Posted Date: 3/12/2013 3:12:05 AM | Location : United States

Related Discussions:- Optimistic concurrency control, Assignment Help, Ask Question on Optimistic concurrency control, Get Answer, Expert's Help, Optimistic concurrency control Discussions

Write discussion on Optimistic concurrency control
Your posts are moderated
Related Questions
A well-maintained relational DBMS has a high level of data integrity. What features of a relational DBMS contribute towards this level of integrity? Relational DBMS gives high

I have to create a database about anything of my choice. It has to contain 4 queries, and 4 forms. It can be anything as simple as a shoe inventory with numbers - is this a service

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 dat

Explain Deadlock detection and recovery Deadlock Detection - A deadlock is said to take place when there is a circular chain of transaction, every waiting for the release of a

Explain briefly concurrent task by taking an example. Concurrent Task- The concurrent occurrence of more than one event is called concurrent task. Operating systems can handl

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a

Project Description: Looking to prepare automated trading engine for alternate cyprto currencies starting with Cryptsy, finally integrating into other exchanges. Need to work wi

What is hash file organization? What are the causes of bucket overflow within a hash file organization? What can be completed to decrease the occurrence of bucket overflow?

Representing complex relationship among data A database may contain varieties of data interrelated to each other in numerous ways. A DBMS must have the capability to represent