3 ms·
It’s way easier if you think of the indexes as tuple keys in a binary tree. Because they’re tuple keys in a b-tree. That also explains how ranges work efficien
by masklinn 1y ago
It’s way easier if you think of the indexes as tuple keys in a binary tree.
Because they’re tuple keys in a b-tree. That also explains how ranges work efficiently.
- jasonwatkinspdx 1y agoYeah, if you're going to work with databases regularly I think it's worth learning how b-trees work. It'll make a lot of things much more intuitive. If you wanna get a very complete grounding in how the big rdbmses work, Andy Pavlo's lectures and class notes are fantastic.
- runlaszlorun 1y agoI definitely second Andy Pavlo's lectures.