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

Division operation, To do the division operation R1 ÷ R2, R2 should be a co...

To do the division operation R1 ÷ R2, R2 should be a correct subset of R1. In the following example R1 have attributes A and B and R2 have only attribute B so R2 is a correct subse

What is repository?, Problem 1 Why are the operational system keys not ...

Problem 1 Why are the operational system keys not recommended for forming data warehouse primary keys? Give any two examples 2 Explain the following performance tuning techn

What is serializability, What is serializability? Explain its types? Th...

What is serializability? Explain its types? The data base system must control concurrent implementation of transactions, to ensure that the data base state remains consistent.

Write the syntax of creating an index, Write the syntax of creating an INDE...

Write the syntax of creating an INDEX ? Syntax of Creating an Index: CREATE [BITMAP] [UNIQUE] INDEX ON ( [, ] . . .);

Process to find the non-concurrent objects, Process to find the non-concurr...

Process to find the non-concurrent objects Once we find out non-concurrent (mutually exclusive) objects, we can fold all objects together in one thread of process or control. O

Database ass1, #quCreate a database design specification (Enhanced Entity R...

#quCreate a database design specification (Enhanced Entity Relationship Diagram (EERD) and Relational Data Model (RDM)) from the given business description. The RDM must be in 3rd

find a non-redundant cover and canonical cove, Given the following set of ...

Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?

Mysql, he SQL query that will return the order number, quantity ordered, pr...

he SQL query that will return the order number, quantity ordered, price each and total cost of an order (quantity * price each) from the order details table. Label the calculated c

Explain the concept of deadlock, Explain the concept of deadlock Yes. I...

Explain the concept of deadlock Yes. It can direct to deadlock. Suppose that a batch of frames arrived correctly and were accepted. Then receiver will advance its window. Now s

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