Tom, Merlin,
> It's not fundamentally different from single-column indexes. The only
> aspect of a btree index that requires any knowledge about the content of
> index entries is the "compare two index entries for lesser, equal, or
> greater" operation. For that, we just compare the first column
Josh Berkus writes:
> I've been poking around the indexing code, and I really don't understand the
> page structure and splittng/branching for multi-column BTree indexes.
It's not fundamentally different from single-column indexes. The only
aspect of a btree index that requires any knowledge ab
> Folks,
>
> I've been poking around the indexing code, and I really don't
understand
> the
> page structure and splittng/branching for multi-column BTree indexes.
> I've
> looked in a couple DB textbooks to get a theoretically underpinning of
the
> structure of multi-column indexes, but none of t
Folks,
I've been poking around the indexing code, and I really don't understand the
page structure and splittng/branching for multi-column BTree indexes.I've
looked in a couple DB textbooks to get a theoretically underpinning of the
structure of multi-column indexes, but none of the ones I'
