"Modern B-Tree techniques" by Dmitrii Dolgov (Strange Loop 2022)

[@pouet4608]

4:00 optimise for read, write, mem consumption, chose 2. 5:00 b tree : read and mem. 6:53 1 index per leaf

[@dweb]

Brilliant.

[@PaulaBean]

Brillant!

[@TheNeoanomally]

Amazing presentation 🎉

[@shbakram]

Was wondering on the last bit about data approximation, are there any references to that subject?

[@danielyaacovbilar3537]

B"H" I asked Dmitrii. Here are the references for data approximation he talked about Galakatos A., Markovitch M., Binnig C., Fonseca R., Kraska T. (2019). FITing-Tree: A Data-aware Index Structure. 2019 International Conference on Management of Data (SIGMOD ‘19). doi:10.1145/3299869.3319860

[@alxsmac733]

Yes please.

[@NoNameAtAll2]

UB-Tree xD