09 - Concurrent Indexes (CMU Intro to Database Systems / Fall 2022)

Andy Pavlo (www.cs.cmu.edu...)
Slides: 15445.courses....
Notes 15445.courses....
15-445/645 Intro to Database Systems (Fall 2022)
Carnegie Mellon University
15445.courses....

[@charliepeng4773]

I'm a JavaScript programmer crying in toilet

[@rafaelmenna8384]

Have you ever used the web sql api?😢

[@alfinal5787]

Very interesting and properly explained.

[@mephistotel87]

There is another approach on latching B+Tree on 59 min. Of fast path you take read latches along the way of leaf node (on which you take W latch), but don't release these read latches for parent (of leaf node) and parent of parent (of leaf node). These read latches don't block neither read nor write operations (fast paths), Then if you see leaf node need needs split/merge you release read latch on parent, and take write latch on it. It's safe because we still holding read latch on it's parent (parent of parent), Thus no need to traverse tree from root with write latches,
It's kinda like improved version of optimistic version of algorithm, Of only if this doesn's work you take all write latches from the root (pessimistic version),

[@mephistotel87]

What about reordering of operations, so let's say to postpone insertions and allow deletion operation (from other query) for not doing split if inner node is full?