DBMS : View Serializable Schedule

A schedule is said to be View Serializable iff it is view equivalent to any of the possible serial schedule. where View equivalence can be defined as :
2 Schedules are said to be View Equivalent iff following conditions are met :
1. Initial Read
2. W-R Conflict
3. Final Write

[dhritimanhazarika]

Feels like I am shaping up really well for my exams ! Didn't find a better explanation than this, on this topic anywhere .. Not in College classes ( that was b grade teaching ), not in any PDF's and not in youtube too ! Can't thank you enough Sir . Awesome expertise and awesome teaching !

[zeherimba]

sir, you're a God for us. You've no idea how much you have helped! These 10mins videos before an exam help a lot more than the lectures I was for 1hour. subscribed :) 

[hariskumarbalasingam]

This explanation was very helpful to understand some of the complicated concepts in DBMS easily
Thanks a lot sir!!

[aliyazici]

Books by (1) Elmasri, and (2), Connolly are useful texts for introductory as well as advanced concepts.

[marsbars]

Other than listening to the spawn of Satan in my ear for 10 continuous minutes, Thankyou for the informative video!

[MohanbabuLankipalli]

at 2:18 i think .. # of possible serial schedules are N!

[arpitasthana]

I think transaction order must be same in initial read according to view equivalence, but here in s1->t3 first read element x equal to s2->t2 first read element x, so s1 & s2 not satisfy the property of view equivalence

[earthling_parth]

Excellent explanation ! thank you so much

[Animal_Antics_Arena]

Thank you so much. it is very clear example.

[gandhaleemanohar]

I need help with dirty page table, Write-ahead log protocol, check points in dbms

[nithilavithanage]

IS T2  T1  T3 serialize shedule satsify the Initial read condition?

[achyuttripathi]

how to check whether the given schedule is a view serializable schedule, if the schedule is not conflict serializable and contains blind write?

[ujwalsasikumar]

Sir, the video was too helpful but on the last problem it satisfies conflit serializable but when checking on view serializablity and on comparisons it does not satisfy the transaction T3 and T2 same order write -read conflict condition .
could u respond on how it is view serialazable as ur answer is both ? ?

[yashwantsinghkyys]

If I consider T3-T2-T1 for serial then initial reads doesn't satisfy.

[ujjaldas]

Here in the initial read, for 1st table nodes are T3 and T2 whereas for 2nd table nodes are T2 and T3 . Does order matters in view serializability ?

[JoydeepRoyEr]

The last problem solution should not be view serializable. Consider orders T1, T3, T2 and T3, T1, T2.. Initial Read condition does not hold for variable X.

[_sourav_]

Number of serial schedules possible are n! and not 2^n.
Pls update it

[niteshkumar-spni]

sir, if u have lectures on theory of computation pls post the link ...

[aliyazici]

view equivalence is given as view serializable! Concepts are not clearly explained, I'm afraid.

[SriHarshaChennavajjala]

How is it possible for the final problem to be a view serializable? I tried it with serial schedule T2, T3, T1. It doesn't satisfy the W-R conflict