Unrepeatable reads-problems of concurrent transactions, Database Management System

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.

 

Posted Date: 3/12/2013 1:50:06 AM | Location : United States







Related Discussions:- Unrepeatable reads-problems of concurrent transactions, Assignment Help, Ask Question on Unrepeatable reads-problems of concurrent transactions, Get Answer, Expert's Help, Unrepeatable reads-problems of concurrent transactions Discussions

Write discussion on Unrepeatable reads-problems of concurrent transactions
Your posts are moderated
Related Questions
i am not clear with the climetic condition of the north indian plain. can u plz explain it for me

Project Description: Oracle Certified Professional with 20 years of practice, Oracle version 6.0.34, 7.3, 8.0, 8i, 9i, 10G, 11G, 12C. Crossplatform migration, Informix, MSSql

Describe about Object oriented design Object oriented design is concerned with developing an object oriented model of a software system to implement known requirements. Many OO

Consider a systems development project with the following data Activity                                Duration (weeks)        Precedence Relationship 1. Software design

Question: (a) With the help of a diagram, explain the TOGAF framework for enterprise architectures. (b) Where would you position enterprise architectures in an enterpri

If R1 and R2 are two relations or functions, then the result of R3 = R1 × R2 is the combination of tuples that are in R1 and R2. The product is associative and commutative. Degr

What is Interaction Diagram An interaction diagram shows an interaction, comprises of a set of objects and their relationships including the messages that may be dispatched be

sql is relationally complete-justify

i have a homework assignment identical to one you have listed

write on the various type of relationalkey