21,255 views
77 77 votes

Which of the following scenarios may lead to an irrecoverable error in a database system?

  1. A transaction writes a data item after it is read by an uncommitted transaction
  2. A transaction reads a data item after it is read by an uncommitted transaction
  3. A transaction reads a data item after it is written by a committed transaction
  4. A transaction reads a data item after it is written by an uncommitted transaction

7 Answers

Best answer
63 63 votes
  1. Here if transaction writing data commits , then transaction which read the data might get phantom tuple/ Unrepeatable error. Though there is no irrecoverable error possible even in this option.
  2. This is non issue. Both transaction reading data.
  3. This is non issue.
  4. This is dirty read. In case if transaction reading uncommitted data commits, irrecoverable error occurs of uncommitted transaction fails. So (D) is answer
edited by
17 17 votes

 

I hope now it is clear which is the only case where IRRECOVERABILITY ARISES.

That is only when a particular transaction reads from a uncommited Transacation and , commits before the commit of the transaction whose data it was reading.

edited by
8 8 votes
D. If Data is uncommitted , then transactions reads a data after write always give error.
4 4 votes
D

Option C is a normal operation. Option B is also fine as no write operation is involved. Option A can be recovered, but option D can't be.
1 1 vote

A transaction is reading a data item after it is written by an uncommitted transaction, the schedule will be irrecoverable.

This is irrecoverable Schedule because T2 reads a updated value before the commit operation of T1.

Answer:
Position:
Show:

Related questions

32 32 votes
3 answers 3 answers
15.2k
15.2k views
gatecse asked Sep 21, 2014
15,212 views
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is :$f(b-a)$$f(b) - f(a)$$\int\limits_a^b f(x) dx...
92 92 votes
4 answers 4 answers
30.9k
30.9k views
Kathleen asked Sep 17, 2014
30,883 views
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements...
31 31 votes
3 answers 3 answers
29.3k
29.3k views
Kathleen asked Sep 16, 2014
29,333 views
Suppose the numbers $7, 5, 1, 8, 3, 6, 0, 9, 4, 2$ are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering o...
102 102 votes
11 answers 11 answers
48.1k
48.1k views
Kathleen asked Sep 17, 2014
48,107 views
The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network?$172.57.88.62$ and $172.56....