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 a relation schema, A Relation Schema represented by R(A1, A2, .....

A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples

Problem about data mining for business intelligence, Do the 11.1 11.1 Cre...

Do the 11.1 11.1 Credit Card Use. Consider the following hypothetical bank data on consumers’ use of credit card credit facilities in Table 11.3. Create a small worksheet in Exce

Unnormalize form, employee(empid,empname,dept,telno,mobno, add,sssno,tinno,...

employee(empid,empname,dept,telno,mobno, add,sssno,tinno,WEdates,WEcomp,WEadd,WEpos,WEres) this is a employee record which is need to be normalize.the WE means work experience

Process of adjustment of inheritance, Process of Adjustment of inheritance ...

Process of Adjustment of inheritance During object design, inheritance is readjusted by rearranging classes and operations, and abstracting common behaviour.

Define blocks, Define blocks? The database system resides eternally on ...

Define blocks? The database system resides eternally on non-volatile storage, and is into fixed-length storage units known as blocks.

Entity set that does not have sufficient attributes known as, An entity set...

An entity set that does not have sufficient attributes to form a primary key is called? An entity set that doesn't have sufficient attribute to form a primary key is known as w

Compare wait-die deadlock prevention with wait-wound scheme, Compare wait-d...

Compare wait-die deadlock prevention scheme with wait-wound scheme   Ans:  Wait-Die Scheme  a) Based upon a nonpreemptive technique.  b) If Pi requests a resource present

Foreign keys , Foreign Keys and NULL Let us take the relation:         ...

Foreign Keys and NULL Let us take the relation:                 DEPT DEPT ID DNAME BUDGET D1 M

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