Insightful video. Have been trying to delete and write to an indexed column in the same transaction and running into deadlocks. Was thinking my WHERE clauses would prevent issues before learning more about index locks
This is very interesting-I came across a video introducing my blog post. Actually, the official MySQL B-tree implementation hasn’t been updated in a long time. In fact, the next post in my blog series discusses how, in PolarDB, we have modified MySQL’s B-tree to a structure similar to PostgreSQL’s Blink-tree. Additionally, there is a third article in the series, which builds upon this topic. Here’s a Chinese blog post explaining the implementation of PolarDB’s Blink-tree. Unfortunately, I haven’t had the time to translate it into English yet.
idk what it is but i always get HUGE lebanese vibes from you everytime i watch your videos, i'll be shocked if you are actually lebanese 😂😂, thanks for the video content you put out, i've learned alot and your courses actually made me competent so thanks 👍
Thanks @hnasr, read the original blog as well. Great read. Lecture from andy's course at CMU might be helpful, if someone wants to get more context on how concurrency is handled in B-Trees: ua-cam.com/video/lgUNTj0Q54M/v-deo.html
Can a deadlock happen? If a reader is coming from top to bottom; while there was a SMO downthere by a writer then the writer is trying to acquire X lock on parent node acquired by that reader?
Fundamentals of database engineering course databases.win
First from Morocco, I consider you as my mentor, thank you so much for your detailed explanations of complex topics
Thanks Mehdi
تحياتي لاهل المغرب ❤
Insightful video. Have been trying to delete and write to an indexed column in the same transaction and running into deadlocks. Was thinking my WHERE clauses would prevent issues before learning more about index locks
This is very interesting-I came across a video introducing my blog post. Actually, the official MySQL B-tree implementation hasn’t been updated in a long time. In fact, the next post in my blog series discusses how, in PolarDB, we have modified MySQL’s B-tree to a structure similar to PostgreSQL’s Blink-tree. Additionally, there is a third article in the series, which builds upon this topic. Here’s a Chinese blog post explaining the implementation of PolarDB’s Blink-tree. Unfortunately, I haven’t had the time to translate it into English yet.
hello, can you link the post explaining the PolarDB Blink-tree? thank you
مرحبا شرحك جدا راءع فعلا وانت تتحدث عن امور جدا مهمه لم يتحدث عنها احد الي القليل القليل جدا ❤❤❤ تحياتي من مصر
Thanks a lot! Started watching and taking notes :)
idk what it is but i always get HUGE lebanese vibes from you everytime i watch your videos, i'll be shocked if you are actually lebanese 😂😂, thanks for the video content you put out, i've learned alot and your courses actually made me competent so thanks 👍
He is from Bahrain 🇧🇭
28:00 دروس في البرمجة تلاقي, دروس في الفلسفة تلاقي
Q&A video
Thanks ❤
Thanks @hnasr, read the original blog as well. Great read.
Lecture from andy's course at CMU might be helpful, if someone wants to get more context on how concurrency is handled in B-Trees: ua-cam.com/video/lgUNTj0Q54M/v-deo.html
Can a deadlock happen? If a reader is coming from top to bottom; while there was a SMO downthere by a writer then the writer is trying to acquire X lock on parent node acquired by that reader?
From Bangladesh
Taiwan fans here