Optimistic concurrency control, Database Management System

Assignment Help:

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.

 


Related Discussions:- Optimistic concurrency control

Distributed query and transaction processing, Distributed query and transac...

Distributed query and transaction processing a.  Construct a query around any one of the functional divisions you made in 4a such that if executed in the distributed design of 4

Explain normalization, What is Normalization? Database normalization is...

What is Normalization? Database normalization is a data design and organization method applied to data structures based on rules that help building relational databases. In rel

N-ary relationship, For every n-ary relationship type R where n>2, we make ...

For every n-ary relationship type R where n>2, we make a new table S to represent R. We contain as foreign key attributes in s the primary keys of the relations that show the parti

Define transitive dependencies, What do you understand by transitive depend...

What do you understand by transitive dependencies? Define with an example any two problems that can take place in the database if transitive dependencies are available in the datab

School portal design and development, Project Description: This is going...

Project Description: This is going to be a School portal to handle each activities in school such as, School fees payment, online registration and every other payment, course re

Explain foreign key, Explain Foreign Key? Foreign Key - Let there are...

Explain Foreign Key? Foreign Key - Let there are two relations (tables) R and S. Any candidate key of the relation R that is referred within the relation S is known as the fo

Abap/4 program, It is not possible to make an ABAP/4 program, which having ...

It is not possible to make an ABAP/4 program, which having only Subroutines. False. We can make ABAP/4 program, which having only Subroutines.

Define the term- actors and data stores, Define the term- Actors and Data...

Define the term- Actors and Data Stores Actors: An actor is the active object which drives data flow graph by producing or consuming values. Actors are attached to inputs a

Keys, it can be possible to create any table without primary key

it can be possible to create any table without primary key

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd