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
Consider the relation schemas as follows. works (person name, company name, salary); lives (person name, street, city); located in(company name, city); managers (person name

entity relationship diagram about finance

What are the functions of an accumulator? The accumulator is the register associated with the ALU operations and sometimes I/O operations. It is an integral part of ALU. It hol

Problem: (a) Given the following relation: Stats(Name,Sex,Children, Occupation, Salary, Tax, Audits) Write SQL code to define the following security constraints: (i) User

What is a homogeneous distributed database? In homogeneous distributed databases, all sites have the same database management system software, are aware of one another, and agr

Give an example of Operations from the functions of a bank. For creation of a saving account, you can write: bank::: create -savings-account (customer)->account. For oper

What is the most significant feature that does not directly map into programming language structures? Why? Association, since there are complex types of association, like as qu

Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by

UNION If R1 and R2 are two union compatible relations then R3 = R1 ∪ R2 is the relation having tuples that are either in R1 or in R2 or in both. In case, R3 will have tuples

Explain the Attribute inheritance Ans: Throughout the rendering of the objects in a view, attribute sets of objects higher in the view hierarchy are inherited via objects below