Dirty reads-problems of concurrent transactions, Database Management System

Assignment Help:

Dirty Reads: T10 reads a value which is updated by T9. This update has not been committed and T9 aborts.

T9

T10

Value of x old value =

200

T9

T10

UPDATE X

 

500

 

 

READ X

 

500

ROLLBACK

 

200

?

Here T10 reads a value that is updated by transaction T9 that has been aborted. Therefore T10 has read a value that would never exist in the database and hence the trouble. Here the difficulty is primarily of isolation of transaction.

 


Related Discussions:- Dirty reads-problems of concurrent transactions

Define the one-way associations, One-way Associations When an associat...

One-way Associations When an association is traversed only in the one direction, then it is implemented as a pointer i.e.an attribute which contains an object reference. If mu

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

Define what Immediate database modification technique uses, Define what Imm...

Define what Immediate database modification technique uses?  Ans: Both undo and redo.

What function divides one numeric expression, What function divides one num...

What function divides one numeric expression by another and returns the remainder? MOD function divides one numeric expression by another and returns the remainder.

What are the types of indices, Normal 0 false false false ...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Explain weak and strong entity type, Explain weak and strong entity type ? ...

Explain weak and strong entity type ? Weak and Strong entity type: An entity set which does not have a primary key is referred to as a weak entity set. The existence of a wea

Failure controlling methods, Failure Controlling Methods: Failures can be h...

Failure Controlling Methods: Failures can be handled using different recovery methods that are talk about later in the unit. But the first question is doing we really require recov

What is a database graph, What is a database graph? The partial orderin...

What is a database graph? The partial ordering implies that the set D may now be viewed as a directed acyclic graph, known as a database graph.

What are composite objects, What are composite objects? Objects that ha...

What are composite objects? Objects that have other objects are known as complex objects or composite objects.

Set difference, Set Difference If R1 and R2 are two union compatible re...

Set Difference If R1 and R2 are two union compatible relations or relations then result of R3 =R1- R2 is the relation that have only those tuples that are in R1 but not in R2.

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