Re: Remove extra Sort node above a btree-compatible Index Scan

Alexandra Wang <alexandra(dot)wang(dot)oss(at)gmail(dot)com> writes:
> I’ve attached a patch that removes this unnecessary Sort node for
> B-tree-compatible indexes.

This does not look right at all. You can't just ignore the opfamily
etc. while deciding whether two pathkeys represent the same sort
ordering, as you did in create_mergejoin_plan(). I don't like
pathkeys_have_same_sortop() either. The pathkey data structures
were designed to let pointer comparison be sufficient for deciding
whether pathkeys are equivalent: see the "canonical pathkey" stuff
in pathkeys.c. I think that this patch may be band-aiding over some
breakage of that concept, but you've not provided enough context to
figure out what the underlying problem is.

regards, tom lane