| From: | David Geier <geidav(dot)pg(at)gmail(dot)com> |
|---|---|
| To: | Tomás Senart <ts(at)perfloop(dot)ai>, pgsql-hackers(at)lists(dot)postgresql(dot)org |
| Cc: | John Naylor <johncnaylorls(at)gmail(dot)com> |
| Subject: | Re: [PATCH v1] Batch B-tree TIDs when building a bitmap |
| Date: | 2026-10-09 09:11:39 |
| Message-ID: | 2b93f66d-0f8c-49d8-a76d-9add6a07a3b5@gmail.com |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
> The same optimization can be applied, by the way, to at least the GIST,
> the GIN and the HASH index implementations. I'll do that the next days
> when I find some time.
Done for B-tree, hash, GiST, GIN, SP-GiST, and bloom indexes.
Attached patch passes tests.
Also created a commit fest entry:
https://commitfest.postgresql.org/patch/7422/
--
David Geier
| Attachment | Content-Type | Size |
|---|---|---|
| v2-0001-Batch-TIDBitmap-insertions-in-index-scans.patch | text/plain | 11.1 KB |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | lin teletele | 2026-10-09 09:16:42 | Re: [PATCH v1] Stale row estimates for transition tables |
| Previous Message | jian he | 2026-10-09 08:40:45 | use indnkeyatts not indnatts in loops that read rd_indcollation |