Re: Why does query planner choose slower BitmapAnd ? - Mailing list pgsql-general

From Tom Lane
Subject Re: Why does query planner choose slower BitmapAnd ?
Date
Msg-id 25689.1456161928@sss.pgh.pa.us
Whole thread Raw
In response to Re: Why does query planner choose slower BitmapAnd ?  (Seamus Abshere <seamus@abshere.net>)
List pgsql-general
Seamus Abshere <seamus@abshere.net> writes:
> On Mon, Feb 22, 2016, at 02:14 PM, Tom Lane wrote:
>> IOW, almost certainly we *don't* realize that the query will involve scanning through gigabytes of index pages.  But
btreeindexes are much simpler and easier to make that estimate for... 

> Isn't this the crux of my issue, at least?

Not unless you are using a GIST index for booleans, which I sure hope you
ain't.

            regards, tom lane


pgsql-general by date:

Previous
From: Tom Lane
Date:
Subject: Re: Why does query planner choose slower BitmapAnd ?
Next
From: Jeff Janes
Date:
Subject: Re: Why does query planner choose slower BitmapAnd ?