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

What does the cardinality ratio specify, What does the cardinality ratio sp...

What does the cardinality ratio specify? Mapping cardinalities or cardinality ratios state the number of entities to which another entity can be associated. Mapping cardinaliti

Database, real life situations where database management system are most su...

real life situations where database management system are most suitable

What are aggregate functions, What are aggregate functions? And list the ag...

What are aggregate functions? And list the aggregate functions supported by SQL? Aggregate functions are functions that take a collection of values as input and return a one va

B-tree, construct a b-tree for the following set of key values 2,3,5,7,11,1...

construct a b-tree for the following set of key values 2,3,5,7,11,17,19,23,29,31.assume that the tree is initial empty and the values are added in ascending order

File organisation and its types, File Organisation And Its Types  Just ...

File Organisation And Its Types  Just as arrays, trees, lists and other data structures are used to execute data Organisation in main memory, a number of planning's are used to

What are the three types of data sources, What are the three types of data ...

What are the three types of data sources used with ODBC? An ODBC file data source is a file that can be shared between database users. An ODBC system data source is one that is

Create database for car application, The Database MySQL scripts cars_f...

The Database MySQL scripts cars_for_sale.sql and car_details.sql containing the data to use for this task have been supplied. To complete this task, you need to first create

Define identify relationship, Define identify relationship? Identifyin...

Define identify relationship? Identifying relationship: An identifying relationship means in which the child table cannot be uniquely recognize without the parent. For exampl

List and describe the different types of indexes, Question 1 Indexes are o...

Question 1 Indexes are ocasionally defines on a single field of a file called an indexing field. List and describe the different types of indexes Question 2 Consider a book i

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