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
Self-Join:   In a self join a table is joined with itself.  Let consider the following sample partial data of EMP table EMPNO ENAME MGRID

Given the following relations TRAIN (NAME, START, DEST) TICKET (PNRNO., START, DEST, FARE) PASSENGER (NAME, ADDRESS, PNRNO.) Write SQL expressions for the following queries: No

Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)

Consider the subsequent relations RENTER(rno, fname, lname, address, tel_no, pref_type, max_rent) VIEWING(rno, pno, date, comment) PROPERTY_FOR_RENT( pno, street, area ,city,

Question: (a) What is ODBC and what is its function? (b) What is Web application server, and how does it work from a database perspective? (c) What does e-commerce mean

What is the use of RAID? A variety of disk-organization methods, collectively called redundant arrays of independent disks are used to better the performance and reliability.

Explain Foreign Key? Foreign Key - Let there are two relations (tables) R and S. Any candidate key of the relation R that is referred within the relation S is known as the fo

Timestamps For Read operations: If TS (T) If TS (T) >= W-timestamp (Q), then the transaction T is trying to read a value of data item Q which has been written and committed

Describe multi key files

Optimistic Concurrency Control Is locking the only way to stop concurrency related problems? There exist some other ways too. One such way is known as an Optimistic Concurrency