Re: speed up query with max() and odd estimates

From: "Steinar H(dot) Gunderson" <sgunderson(at)bigfoot(dot)com>
To: pgsql-performance(at)postgresql(dot)org
Subject: Re: speed up query with max() and odd estimates
Date: 2005-04-26 20:48:53
Message-ID: 20050426204853.GA29424@uio.no
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

On Tue, Apr 26, 2005 at 03:16:57PM -0500, Matthew Nuzum wrote:
> Seq Scan on usage_access (cost=0.00..1183396.40 rows=12713851
> width=116) (actual time=481796.22..481839.43 rows=3343 loops=1)

That's a gross misestimation -- four orders of magnitude off!

Have you considering doing this in two steps, first getting out whatever
comes from the subquery and then doing the query? Have you ANALYZEd recently?
Do you have an index on atime?

/* Steinar */
--
Homepage: http://www.sesse.net/

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Matthew Nuzum 2005-04-26 21:02:12 Re: speed up query with max() and odd estimates
Previous Message Josh Berkus 2005-04-26 20:45:53 Re: [HACKERS] Bad n_distinct estimation; hacks suggested?