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	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

Method of analyzing association traversal, Analyzing Association Traversal ...

Analyzing Association Traversal Till now, we have supposed that associations are bi-directional. But in the case of traversal, it is in only one direction in any application,

BI, (a) Why did SAP introduce the extended star schema?

(a) Why did SAP introduce the extended star schema?

Define the terms- ddl and dml, Define the terms i) DDL ...

Define the terms i) DDL ii) DML DDL: Data base schema is specified by a set of definitions expressed by a special language known as a data def

What creates while a primary key is combined with a foreign, What it create...

What it creates while a primary key is combined with a foreign key? It creates Parent-Child relation ship between the tables that connect them while a primary key is combined w

Mixed fragmentation, Mixed fragmentation: Sometimes, horizontal fragmentati...

Mixed fragmentation: Sometimes, horizontal fragmentation or vertical fragmentation of a database schema by itself is insufficient to sufficiently distribute the data for some appli

Complexity- drawbacks of data distribution, Complexity : A distributed DBMS...

Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have

Dbms of company, what should be included in this???

what should be included in this???

Column constraints, Column Constraints: NOT NULL, UNIQUE, CHECK, PRIMARY K...

Column Constraints: NOT NULL, UNIQUE, CHECK, PRIMARY KEY, DEFAULT, REFERENCES, On delete Cascade : Using this key whenever a parent row is removed in a referenced

What is the use of union and intersection operation, What is the use of Uni...

What is the use of Union and intersection operation? Union: The result of this operation contains all tuples that are either in r1 or in r2 or in both r1 and r2.Duplicate tuple

Describe the storage structure of indexed sequential file, Describe the sto...

Describe the storage structure of indexed sequential files and their access method. Ans: Index offers a lookup capability to rapidly reach the vicinity of the desired record.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages