3 ms·
Missing b-link trees/concurrency/locking, but maybe that really is more than you want to know
by prpl 2y ago
Missing b-link trees/concurrency/locking, but maybe that really is more than you want to know
- brcmthrowaway 2y agoResource for that?
- apavlo 2y agoI teach any entire lecture on this topic: https://15445.courses.cs.cmu.edu/fall2024/schedule.html#sep-30-2024 https://15445.courses.cs.cmu.edu/fall2024/schedule.html#sep-...
- iambvk 2y agoI am working on implement on-disk B+Tree for the last few months. Man, keeping the on-disk state consistent with proper locking is a real challenge -- specially when we want to avoid IO-holding-mutex. And forward/backward iterators make me doubt the correctness. All this with just fixed size keys/values. I am yet to start on variable sized keys and values, but I already want to give up on my initial performance targets.