"Bruno BAGUETTE" <pgsql-ml(at)baguette(dot)net> writes:
> Do you see a way to get better performances with this query which takes
> currently 655.07 msec to be done.
> levure=> explain analyze SELECT distinct lower(substr(l_name, 1, 1)) AS
> initiale FROM people
> levure-> UNION
> levure-> SELECT distinct lower(substr(org_name, 1, 1)) AS initiale FROM
> levure-> ORDER BY initiale;
This is inherently a bit inefficient since the UNION implies a DISTINCT
step, thus partially repeating the DISTINCT work done inside each SELECT.
It would likely be a tad faster to drop the DISTINCTs from the
subselects and rely on UNION to do the filtering. However, you're still
gonna have a big SORT/UNIQUE step.
As of PG 7.4 you could probably get a performance win by converting the
thing to use GROUP BY instead of DISTINCT or UNION:
select initiale from (
select lower(substr(l_name,1,1)) as initiale from people
select lower(substr(org_name,1,1)) as initiale from organizations
group by initiale order by initiale;
This should use a HashAggregate to do the unique-ification. I think
that will be faster than Sort/Unique.
regards, tom lane
In response to
pgsql-performance by date
|Next:||From: Stephan Szabo||Date: 2004-02-06 15:52:24|
|Subject: Re: Increase performance of a UNION query that thakes|
|Previous:||From: Tom Lane||Date: 2004-02-06 14:55:28|
|Subject: Re: Seq scan on zero-parameters function |