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 form of the create view command, We define a view in SQL throug...

We define a view in SQL through using the create view command. To describe a view, we must provide the view a name and must state the query in which computers the view. The form of

Create database and define relationships between tables, Instructions: ...

Instructions: Follow the instructions below for completing this project: 1. Creating the Database: · Use the physical table descriptions given below to define and create each t

Graphical user interface tools, These are interactive interfaces, graphical...

These are interactive interfaces, graphical that hide the difficulty of the DBMS and query language behind an intuitive, simple to understand, and convenient interface. This permit

Explain nested relations, Explain nested relations? Nested relations ...

Explain nested relations? Nested relations The assumption of INF is a natural one in the bank examples we have considered. However, not all applications are best modelled

What is a hashing function, What is a hashing function?  What are the prope...

What is a hashing function?  What are the properties of a good hashing function?  Describe the folding technique for hashing functions.      Ans:  Hashing function is a method

Explain candidate key and super key, Explain Candidate Key and Super Key ...

Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher

Differences between structured data and unstructured data, Explain the diff...

Explain the differences between structured data and unstructured data. Structured data are facts concerning objects and events. The most significant structured data are numeric

Difference between clustered and a non-clustered index, What are the differ...

What are the difference between clustered and a non-clustered index? A clustered index is a special type of index that reorders the way records in the table are physically stor

Define deadlock prevention, Define Deadlock prevention These protocols...

Define Deadlock prevention These protocols make sure that the system will never enter a deadlock state. There are two methods to deadlock prevention. One approach makes sure t

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