Re: Sorting on longer key is faster ?

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: "jobapply" <jobapply(at)nextmail(dot)ru>
Cc: pgsql-performance(at)postgresql(dot)org
Subject: Re: Sorting on longer key is faster ?
Date: 2005-07-11 23:47:50
Message-ID: 12961.1121125670@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

"jobapply" <jobapply(at)nextmail(dot)ru> writes:
> The 2 queries are almost same, but ORDER BY x||t is FASTER than ORDER BY x..
> How can that be possible?

Hmm, how long are the x values? Is it possible many of them are
TOASTed?

regards, tom lane

In response to

Browse pgsql-performance by date

  From Date Subject
Next Message John A Meinel 2005-07-12 01:48:44 Re: Sorting on longer key is faster ?
Previous Message John A Meinel 2005-07-11 23:42:02 Re: Sorting on longer key is faster ?