Register

Kerala PSC AP Exam

396 views
2 votes
2 votes
Amongst the ACID property of a transaction, the durability property requires that the changes made to the database by a success full transaction persist

A) except in case of an operating system crash

B) except in case of a disk crash

C) except in case of power failure

D) always, even if there is a failure of any kind
User Avatar

3 Answers

4 votes
4 votes
I think (D) for successful transaction
User Avatar
2 votes
2 votes

There is a minor difference between atomicity n durability.

Atomicity means recovery from any failure but it does not cover disk failure. But durability covers this aspect as well which is ensured using RAID implementation.

Hence option D should be correct.

User Avatar
0 votes
0 votes
Transaction should able to recover under any case of failure

"Evey updation must be persistent"

option : (D)
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Sankaranarayanan P.N asked Oct 27, 2016
287 views
Kerala PSC AP Exam
Consider a relation R with five attributes V,W,X,Y and Z. The following functional dependencies hold : $VY \rightarrow W, WX \rightarrow Z$ and $VY \rightarrow W, WX \rightarrow Z$ and ZY \rightarrow V$. Which of the following is a candidate key for R A) VXZ B) VXY C) VWXY D) VWXYZ
Consider a relation R with five attributes V,W,X,Y and Z. The following functional dependencies hold : $VY \rightarrow W, WX \rightarrow Z$ and $VY \rightarrow W, WX \rig...
User Avatar
2 votes
2 votes
1 answer
2
Sankaranarayanan P.N asked Oct 27, 2016
702 views
Kerala PSC AP Exam
A B-tree used as an index for a large database table has four levels including root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in this process are A) 5 B) 4 C) 3 D) 2
A B-tree used as an index for a large database table has four levels including root node. If a new key is inserted in this index, then the maximum number of nodes that co...
User Avatar
1 votes
1 votes
2 answers
3
Sankaranarayanan P.N asked Oct 27, 2016
1,242 views
Kerala PSC AP Exam
A table has fields F1, F2, F3, F4, F5 with the following functional dependencies $F1 \rightarrow $F1 \rightarrow F3, F2 \rightarrow F4, (F1,F2) \rightarrow F5$F3$ in terms of normalization this table is in A) 1NF B) 3NF C) 2 NF D) None of these
A table has fields F1, F2, F3, F4, F5 with the following functional dependencies $F1 \rightarrow $F1 \rightarrow F3, F2 \rightarrow F4, (F1,F2) \rightarrow F5$F3$ in ter...
User Avatar
Link Copied!