From: | David Brown <time(at)bigpond(dot)net(dot)au> |
---|---|
To: | Josh Berkus <pgsql-performance(at)postgresql(dot)org> |
Subject: | Re: multi-column index |
Date: | 2005-03-17 00:25:43 |
Message-ID: | 4238CE87.1040904@bigpond.net.au |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
Whoa Josh! I don't believe you're going to reduce the cost by 10 times
through a bit of tweaking - not without lowering the sequential scan
cost as well.
The only thing I can think of is perhaps his primary index drastically
needs repacking. Otherwise, isn't there a real anomaly here? Halving the
key width might account for some of it, but it's still miles out of court.
Actually, I'm surprised the planner came up with such a low cost for the
single column index, unless ... perhaps correlation statistics aren't
used when determining costs for multi-column indexes?
Josh Berkus wrote:
>Pretty simple, really. Look at the cost calculations for the index scan for
>the multi-column index. PostgreSQL believes that:
>The cost of a seq scan is 4788.14
>The cost of an 2-column index scan is 36720.39
>The cost of a 1-column index scan is 916.24
>
>Assuming that you ran each of these queries multiple times to eliminate
>caching as a factor, the issue is that the cost calculations are wrong. We
>give you a number of GUC variables to change that:
>effective_cache_size
>random_page_cost
>cpu_tuple_cost
>etc.
>
>See the RUNTIME-CONFIGURATION docs for more details.
>
From | Date | Subject | |
---|---|---|---|
Next Message | Greg Stark | 2005-03-17 02:29:13 | Re: Speeding up select distinct |
Previous Message | Tom Lane | 2005-03-16 20:42:18 | Re: cpu_tuple_cost |