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

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

What is known as fudge factor, What is known as fudge factor? The numbe...

What is known as fudge factor? The number of partitions is enhanced by a small value called the fudge factor, which is usually 20 percent of the number of hash partitions compu

Determine the method of choosing algorithms, Determine the method of Choosi...

Determine the method of Choosing Algorithms In general, most of operations are easy and have a satisfactory algorithm since description of what is to be done also shows how i

Create table employee and enter employee data in sql, Create table employee...

Create table employee and enter employee data in SQL? Consider the following relational schemas: EMPLOYEE (EMPLOYEE_NAME, STREET, CITY) WORKS (EMPLOYEE_NAME, COMPANYNAME, SAL

Project operation, The PROJECT operation The project operation is used t...

The PROJECT operation The project operation is used to choose the records with specified attributes as discarding the others based on some related criteria. This is denotes as ∏

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

Erd, er diagram on cosmetics.

er diagram on cosmetics.

How many types of locks are there, Depending upon the rules we have found, ...

Depending upon the rules we have found, we can classify the locks into two types. Shared Lock: A transaction might be acquiring shared lock on a data item in order to read it

Describe query evaluation engine, Describe Query evaluation engine? Que...

Describe Query evaluation engine? Query Evaluation engine: Vehicle executes low-level instructions obtained through the DML compiler. The Storage Manager Components gives in

Describe the grant function and explain security, Describe the GRANT functi...

Describe the GRANT function and explain, how it associates to security. What kind of privileges may be granted? How are they revoked? Ans: Since more than one user can aacce

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