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

Explain the two types of participation constraint., Explain the two types o...

Explain the two types of participation constraint. 1. Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i

E-R, Mention various steps required to draw an E-R Diagram. Draw an E-R Dia...

Mention various steps required to draw an E-R Diagram. Draw an E-R Diagram for Student Information System. Mention all suitable assumptions to justify your answer.

Explain query tree represent relational algebra expression, How does a quer...

How does a query tree represent a relational algebra expression?      Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is

Design a gennalization and specialization hierarchy for an a, Design a genn...

Design a gennalization and specialization hierarchy for an automobile sales company

Farm management system, draw er diagram using entities crop,employee,depart...

draw er diagram using entities crop,employee,department,plot,cultivation plan,machinery,seed,fertilizer

Define the five basic operators of relational algebra, Define the five basi...

Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both

What is bankers algorithm, What is banker's algorithm?  Banker's algori...

What is banker's algorithm?  Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty

Query evolution, what is query processing ,query optimization and performan...

what is query processing ,query optimization and performance turring?

Develop database academic assignment, Develop Database academic assignment ...

Develop Database academic assignment Project Description: For a provided set of instructions in a case study design Entity Relationship Diagram. - Entity Relationship Diag

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