From: | Michael Lewis <mlewis(at)entrata(dot)com> |
---|---|
To: | Andrew Gierth <andrew(at)tao11(dot)riddles(dot)org(dot)uk> |
Cc: | Abi Noda <a(at)abinoda(dot)com>, pgsql-performance(at)lists(dot)postgresql(dot)org |
Subject: | Re: Why isn't an index scan being used? |
Date: | 2019-02-20 04:29:46 |
Message-ID: | CAHOFxGowsSLFNLAwpQ5gFPw4F1nT19gNLHRnav0fNL6sykCZbQ@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
On Tue, Feb 19, 2019, 8:00 PM Andrew Gierth <andrew(at)tao11(dot)riddles(dot)org(dot)uk
wrote:
> >>>>> "Abi" == Abi Noda <a(at)abinoda(dot)com> writes:
>
> Abi> However, when I index the closed column, a bitmap scan is used
> Abi> instead of an index scan, with slightly slower performance. Why
> Abi> isn't an index scan being used, given that the exact same number
> Abi> of rows are at play as in my query on the state column?
>
> Most likely difference is the correlation estimate for the conditions.
> The cost of an index scan includes a factor based on how well correlated
> the physical position of rows is with the index order, because this
> affects the number of random seeks in the scan. But for nulls this
> estimate cannot be performed, and bitmapscan is cheaper than plain
> indexscan on poorly correlated data.
>
Does this imply that the optimizer would always prefer the bitmapscan
rather than index scan even if random page cost = 1, aka sequential cost,
when the correlation is unknown like a null? Or only when it thinks random
access is more expensive by some significant factor?
> --
> Andrew (irc:RhodiumToad)
>
>
From | Date | Subject | |
---|---|---|---|
Next Message | Justin Pryzby | 2019-02-20 04:37:48 | Re: Why isn't an index scan being used? |
Previous Message | Andrew Gierth | 2019-02-20 03:00:23 | Re: Why isn't an index scan being used? |