Basic Timestamp Ordering Protocol | Concurrency Control

Поделиться
HTML-код
  • Опубликовано: 26 дек 2024

Комментарии • 37

  • @vaibhaviprajapati1375
    @vaibhaviprajapati1375 7 лет назад +7

    Explained so neatly. I watched 3 videos before watching this and though I was not able to understand but this video made me understand the topic logically which, I guess, I'll never forget. Thank you so much.

  • @isharaperera419
    @isharaperera419 3 года назад

    Nice explanation. Thanks for helping my last semester exam!

  • @chandramoulyv6788
    @chandramoulyv6788 7 месяцев назад

    good explanation sir. Very much helpful for us to understand!

  • @gymegastore
    @gymegastore 7 лет назад +1

    greetings from Colombia. Nice videos !!

  • @_sourav_
    @_sourav_ 5 лет назад +1

    Great explaination!!
    Pls upload more videos.. especially practice questions

  • @meghanamamidi3791
    @meghanamamidi3791 4 года назад

    Your explanation is great❤️

  • @srilathapavan6549
    @srilathapavan6549 Год назад

    At 13:45 I didn't understand the if condition, anybody pls gi e explanation that why the if condition is false

  • @shatadruroychowdhury6319
    @shatadruroychowdhury6319 7 лет назад +1

    How does a transaction T know that there is a Write-TS after T (read)? And what if there is a valid write, will it abort in all cases when there is a write after read?

  • @pratikshachauhan4152
    @pratikshachauhan4152 6 лет назад +2

    Firstly thanks! My question is what will happen if 2 or more transactions have same time stamp????

  • @taddelepetros8106
    @taddelepetros8106 5 лет назад

    woooow amazing explanation. it is completely clear.

  • @semicolonacademy9599
    @semicolonacademy9599 6 лет назад

    What a clear explanation ! Thanks a lot.

  • @Thepankaz1
    @Thepankaz1 2 года назад

    but if TS(Ti) = w TS(x) then overwiting is allowed its also mentioned in silbertz book, but I don't know why its allowed. arent we overwriting concurrent txns write which might lead to issue.

  • @mrunaldivecha4090
    @mrunaldivecha4090 8 лет назад

    That was truly amazing. I never understood it until I saw your videos.

  • @rohittayade4582
    @rohittayade4582 5 лет назад

    very well explained......thank you!

  • @yashadattsawant2380
    @yashadattsawant2380 7 лет назад

    that's very good , tricky explaination

  • @adityaashirbad6047
    @adityaashirbad6047 6 лет назад

    best explanation... thank you!

  • @rajarshibasu007
    @rajarshibasu007 6 лет назад

    Good explanation

  • @harshvyas7620
    @harshvyas7620 8 лет назад

    Nicely explained.

  • @vigneshkamath3287
    @vigneshkamath3287 8 лет назад

    What if transaction t0 having lesser time stamp fails then the read performed by t2 is a dirty read right

  • @jkrw3540
    @jkrw3540 6 лет назад

    Is timestamp of youngest transaction == timestamp of the transaction which completed the latest write or read ?

    • @lokeshkadiyala9862
      @lokeshkadiyala9862 6 лет назад

      yes

    • @jkrw3540
      @jkrw3540 6 лет назад

      @@lokeshkadiyala9862 No, it's not. It's that transaction which has the highest timestamp value.

  • @shreyaraut9270
    @shreyaraut9270 8 лет назад

    thanks..😃😃

  • @sakshidwivedi138
    @sakshidwivedi138 8 лет назад

    can u please explain validation protocol

  • @l3aIIin23
    @l3aIIin23 6 лет назад

    THANKS!!!

  • @rockmanxdi
    @rockmanxdi 6 лет назад

    is that an n or x

  • @nima07111
    @nima07111 7 лет назад

    Thanks for sharing but it's not complete. You forgot to teach read_in_transit and write_in_transit variables.

  • @sawantsaurav
    @sawantsaurav 6 лет назад

    reference book name?

  • @Rishi11
    @Rishi11 7 лет назад +1

    conservative timestamp?

    • @soorajnair
      @soorajnair 7 лет назад

      Rishi Kambil Exactly! I'm searching for the same bruh!🔥

  • @bbg2298
    @bbg2298 7 лет назад +10

    very confusing.. can not clear my concept...

  • @jkrw3540
    @jkrw3540 6 лет назад +1

    First you say youngest at 6:30 and then say latest at 8:11

  • @BiranchiNarayanNayak
    @BiranchiNarayanNayak 8 лет назад +1

    Nice explanation.

  • @kingkaranath9382
    @kingkaranath9382 5 лет назад

    Good explanation.