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.
Because they’re tuple keys in a b-tree. That also explains how ranges work efficiently.
If you wanna get a very complete grounding in how the big rdbmses work, Andy Pavlo's lectures and class notes are fantastic.