Re: Why does query planner choose slower BitmapAnd ?

From: Seamus Abshere <seamus(at)abshere(dot)net>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Stephen Frost <sfrost(at)snowman(dot)net>
Cc: pgsql-general(at)postgresql(dot)org
Subject: Re: Why does query planner choose slower BitmapAnd ?
Date: 2016-02-22 17:18:12
Message-ID: 1456161492.1004686.528442746.62DB641D@webmail.messagingengine.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

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 btree indexes are much simpler and easier to make that estimate for...

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

--
Seamus Abshere, SCEA
+598 99 54 99 54
https://github.com/seamusabshere

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Tom Lane 2016-02-22 17:24:30 Re: Why does query planner choose slower BitmapAnd ?
Previous Message Tom Lane 2016-02-22 17:14:27 Re: Why does query planner choose slower BitmapAnd ?