Re: Why does it sort rows after a nested loop that uses already-sorted indexes? - Mailing list pgsql-general

From Tom Lane
Subject Re: Why does it sort rows after a nested loop that uses already-sorted indexes?
Date
Msg-id 1825378.1713452017@sss.pgh.pa.us
Whole thread Raw
In response to Why does it sort rows after a nested loop that uses already-sorted indexes?  (negora <public@negora.com>)
Responses Re: Why does it sort rows after a nested loop that uses already-sorted indexes?  (negora <public@negora.com>)
List pgsql-general
negora <public@negora.com> writes:
> As you can see, the planner does detect that the outer loop returns the 
> rows presorted by [sales_order.id]. However, it's unable to detect that 
> the rows returned by the inner loop are also sorted by [sales_order.id] 
> first, and then by [order_line.id].

That's a level of analysis that it doesn't do, and TBH I'm not even
entirely sure it's correct to assume that the output is sorted like
that.  At minimum you'd need an additional assumption that the
outer side's join key is unique, which is a factor that we don't
currently track when reasoning about ordering.

            regards, tom lane



pgsql-general by date:

Previous
From: negora
Date:
Subject: Why does it sort rows after a nested loop that uses already-sorted indexes?
Next
From: Michael Corey
Date:
Subject: Foreign Key error between two partitioned tables