Unrepeatable reads-problems of concurrent transactions, Database Management System

Assignment Help:

Unrepeatable reads: Assume T7 reads X twice during its implementation. If it did not update X itself it could be very disturbing to see a dissimilar value of X in its next read. But this could occur if, among the two read operations, another transaction modifies X.

 

T7

T8

Assumed value of

X=2000

T7

T8

READ X

 

2000

 

 

UPDATE X

 

3000

READ X

 

3000

 

 

Therefore, the inconsistent values are read and results of the transaction may be in fault.

 


Related Discussions:- Unrepeatable reads-problems of concurrent transactions

Define deadlock prevention, Define deadlock prevention. Deadlock preven...

Define deadlock prevention. Deadlock prevention is a set of methods for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pre

Compute the closure set, Compute the closure (F+) for the following set of ...

Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b

What are the various forms of data transparency, What are the various forms...

What are the various forms of data transparency? a) fragmentation transparency b) replication transparency c) location transparency

Explain transaction, What is transaction? Collections of operations tha...

What is transaction? Collections of operations that form a single logical unit of work are known as transactions.

Explain optimistic locking and pessimistic locking, Explain the difference ...

Explain the difference between optimistic locking and pessimistic locking. Optimistic locking supposes no transaction conflict will occur and deals with the consequences if it

Explain the concept of two-phase locking, Explain the Concept of Two-phase ...

Explain the Concept of Two-phase Locking It concerns the positions of locking and unlocking operations in each transaction.  In this protocol every transaction issue lock and u

View serialiabilty-labelled precedence graph, how to construct labelled pre...

how to construct labelled precedence graph for view serialiability.please explain insteps with one solved examples

Concurrency control, Give the two reasons for allowing concurrency

Give the two reasons for allowing concurrency

Joins, how can apply joins on table

how can apply joins on table

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