Dirty read problem, Unrepeatable read problem,Phantom problem

preview_player
Показать описание
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:
Both of the above mentioned platforms are COMPLETELY FREE, so feel free to Explore, Learn, Practice & Share!

Our Social Media Links:

Last but not the least, SUBSCRIBE our YouTube channel to stay updated about the regularly uploaded new videos.
Рекомендации по теме
Комментарии
Автор

Timestamps:
00:00 - Problem
00:33 - Dirty Read Problem
01:31 - unrepeatable read problem
02:15 - Phantom problem
03:30 - Problem Solution

muhammadalibhatti
Автор

Hello sir, I have doubt in Phantom : We are not committing any thing in phantom then how come two read operations give us different values

tiwariankit
Автор

sir i have a question if transition t1 fails at second read operation ie line number five so it cant roll back because trasition t2 has already commit which i have read that is the problem with dirty read so option d is correct dirty read and unrepeatable read problem

souvaidkhan
Автор

But We have a phantom problem here right?

kunpeng