Re: Why is sorting on two columns so slower than sorting on one column?

From: Marti Raudsepp <marti(at)juffo(dot)org>
To: Jie Li <jay23jack(at)gmail(dot)com>
Cc: pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Why is sorting on two columns so slower than sorting on one column?
Date: 2010-12-23 14:17:51
Message-ID: AANLkTi=ceKpoPDcJGsE4WAkN4dzFqhOQ=zyuyo5eYL3O@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Thu, Dec 23, 2010 at 09:33, Jie Li <jay23jack(at)gmail(dot)com> wrote:
> While the first sorting takes
> about only 6 seconds, the second one takes over 30 seconds,  Is this too
> much than expected? Is there any possible optimization ?

If you're doing these queries often, you should:
CREATE INDEX ix_big_wf_age_id ON big_wf (age, id)

If that's still not fast enough, you can physically sort rows in the
table using the newly created index:
CLUSTER big_wf USING ix_big_wf_age_id;

Please post back your results. :)

Regards,
Marti

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Li Jie 2010-12-23 14:19:46 Re: Why is sorting on two columns so slower than sortingon one column?
Previous Message Jan Urbański 2010-12-23 14:15:08 pl/python custom datatype parsers