Re: Query-Planer from 6seconds TO DAYS

From: Böckler Andreas <andy(at)boeckler(dot)org>
To: pgsql-performance(at)postgresql(dot)org
Subject: Re: Query-Planer from 6seconds TO DAYS
Date: 2012-10-26 15:15:05
Message-ID: 4818E807-E940-44F2-B10E-75038A82945C@boeckler.org
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

Hi Ken,

Am 26.10.2012 um 16:55 schrieb ktm(at)rice(dot)edu:

> Hi Andy,
>
> You have the sequential_page_cost = 1 which is better than or equal to
> the random_page_cost in all of your examples.
> It sounds like you need
> a sequential_page_cost of 5, 10, 20 or more.

You're right it was sequential_page_cost = 1 because it's really irrelevant what I do here:
set random_page_cost=2;
set seq_page_cost=5;
'2012-05-01' AND '2012-08-30' -> NESTEDLOOP
'2012-04-01' AND '2012-08-30' -> SEQSCAN

a) there will be a point, where things will go bad
this is like patching up a roof 'till you find the next hole instead of making it right at the beginning of construction process
b) they high seq costs might be true for that table (partition at 40gb), but not for the rest of the database
Seqscan-Costs per table would be great.

Regards,

Andy

--
Andreas Böckler
andy(at)boeckler(dot)org

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Kevin Grittner 2012-10-26 15:30:05 Re: Query-Planer from 6seconds TO DAYS
Previous Message Kevin Grittner 2012-10-26 14:59:28 Re: Query-Planer from 6seconds TO DAYS