Re: is it possible to make this faster?

From: Bruno Wolff III <bruno(at)wolff(dot)to>
To: Merlin Moncure <mmoncure(at)gmail(dot)com>
Cc: Postgresql Performance <pgsql-performance(at)postgresql(dot)org>
Subject: Re: is it possible to make this faster?
Date: 2006-05-25 20:47:46
Message-ID: 20060525204746.GA26341@wolff.to
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

On Thu, May 25, 2006 at 16:31:40 -0400,
Merlin Moncure <mmoncure(at)gmail(dot)com> wrote:
> On 5/25/06, Bruno Wolff III <bruno(at)wolff(dot)to> wrote:
> >On Thu, May 25, 2006 at 16:07:19 -0400,
> > Merlin Moncure <mmoncure(at)gmail(dot)com> wrote:
> >> been doing a lot of pgsql/mysql performance testing lately, and there
> >> is one query that mysql does much better than pgsql...and I see it a
> >> lot in normal development:
> >>
> >> select a,b,max(c) from t group by a,b;
> >>
>
> >SELECT DISTINCT ON (a, b) a, b, c FROM t ORDER BY a DESC, b DESC, c DESC;
>
> that is actually slower than group by in my case...am i missing
> something? (both essentially resolved to seq_scan)

If there aren't many c's for each (a,b), then a sort might be the best way to
do this. I don't remember if skip scanning ever got done, but if it did, it
would have been 8.1 or later.

In response to

Browse pgsql-performance by date

  From Date Subject
Next Message Tom Lane 2006-05-25 20:52:27 Re: is it possible to make this faster?
Previous Message Alan Hodgson 2006-05-25 20:36:30 Re: is it possible to make this faster?