Dirty read problem, Unrepeatable read problem,Phantom problem

Опубликовано: 21 Октябрь 2015
на канале: Edredo for Learners

20,860

131

Consider the following schedule:

T1 T2
R(A)
R(A)
W(A)
Commit
R(A)
W(A)
Commit
The above schedule suffers from

(A) Dirty read problem
(B) Unrepeatable read problem
(C) Phantom problem
(D) Both (A) and (B)

IMPORTANT LINKS:
1) Official Website: http://www.techtud.com/
2) Virtual GATE: http://virtualgate.in/login/index.php
Both of the above mentioned platforms are COMPLETELY FREE, so feel free to Explore, Learn, Practice & Share!

Our Social Media Links:
Facebook Page: / techtuduniversity
Facebook Group: / virtualgate
Google+ Page: https://plus.google.com/+techtud/posts

Last but not the least, SUBSCRIBE our YouTube channel to stay updated about the regularly uploaded new videos.