Re: Comments for lossy ORDER BY are lacking - Mailing list pgsql-hackers

From Andres Freund
Subject Re: Comments for lossy ORDER BY are lacking
Date
Msg-id 20190419003700.7geq3yc6mtrft7n4@alap3.anarazel.de
Whole thread Raw
In response to Comments for lossy ORDER BY are lacking  (Andres Freund <andres@anarazel.de>)
List pgsql-hackers
Hi,

On 2019-04-18 17:30:20 -0700, Andres Freund wrote:
> For not the first time I was trying to remember why and when the whole
> nodeIndexscan.c:IndexNextWithReorder() business is needed. The comment
> about reordering
> 
>  *        IndexNextWithReorder
>  *
>  *        Like IndexNext, but this version can also re-check ORDER BY
>  *        expressions, and reorder the tuples as necessary.
> 
> or
> +   /* Initialize sort support, if we need to re-check ORDER BY exprs */
> 
> or
> 
> +   /*
> +    * If there are ORDER BY expressions, look up the sort operators for
> +    * their datatypes.
> +    */

Secondary point: has anybody actually checked whether the extra
reordering infrastructure is a measurable overhead? It's obviously fine
for index scans that need reordering (i.e. lossy ones), but currently
it's at least initialized for distance based order bys.  I guess that's
largely because currently opclasses don't signal the fact that they
might return loss amcanorderby results, but that seems like it could
have been fixed back then?

Greetings,

Andres Freund



pgsql-hackers by date:

Previous
From: Peter Geoghegan
Date:
Subject: Re: Pathological performance when inserting many NULLs into a unique index
Next
From: Michael Paquier
Date:
Subject: Re: finding changed blocks using WAL scanning