| From: | Peter Geoghegan <pg(at)heroku(dot)com> |
|---|---|
| To: | Andres Freund <andres(at)anarazel(dot)de> |
| Cc: | Pg Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Improving executor performance - tidbitmap |
| Date: | 2016-07-15 04:00:38 |
| Message-ID: | CAM3SWZTu3Y_FaXtzgD50RquHsO7=vRm15wFKD5r=RacyPTQaRg@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Thu, Jul 14, 2016 at 8:45 PM, Andres Freund <andres(at)anarazel(dot)de> wrote:
> Brin indexes IIRC always end up using tidbitmap.c, so the benefits
> should be there as well ;)
Right. Might the improvement be even more pronounced, though?
I'm not sure how a BRIN index with a suitable physical/logical
correlation performs compared to a bitmap index scan of a B-Tree (due
to a less selective bitmap index scan qual, as in your example), but
offhand I guess that could be faster in general, making the bottleneck
you're addressing relatively greater there.
--
Peter Geoghegan
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Fabien COELHO | 2016-07-15 05:13:33 | Re: pgbench - allow to store select results into variables |
| Previous Message | Andres Freund | 2016-07-15 03:53:07 | Re: Reviewing freeze map code |