From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | "Bruno Almeida do Lago" <teolupus(at)gmail(dot)com> |
Cc: | pgsql-performance(at)postgresql(dot)org |
Subject: | Re: GROUP BY Vs. Sub SELECT |
Date: | 2006-04-23 23:34:24 |
Message-ID: | 18881.1145835264@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
"Bruno Almeida do Lago" <teolupus(at)gmail(dot)com> writes:
> I'm just getting familiar with EXPLAIN ANALYZE output, so I'd like to get
> some help to identify which one of the following queries would be better:
Well, you're breaking one of the first laws of PG performance analysis,
which is to not try to extrapolate the behavior on large tables from the
behavior on toy tables. You can't really see where the bottlenecks are
on a toy example, and what's more there's no reason to think that the
planner will use the same plan when presented with much larger tables.
So you need to load up a meaningful amount of data (don't forget to
ANALYZE afterward!) and then see what it does.
> I think 2nd would be better, since when database grow up the GROUP BY may
> become too costly. Is that right?
The two queries don't give the same answer, so asking which is faster
is a bit irrelevant. (When there's more than one group, wouldn't the
per-group MAXes be different?)
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Mark Kirkwood | 2006-04-24 01:29:17 | Re: Hardware: HP StorageWorks MSA 1500 |
Previous Message | Bruno Almeida do Lago | 2006-04-23 20:57:40 | GROUP BY Vs. Sub SELECT |