| From: | John Naylor <johncnaylorls(at)gmail(dot)com> |
|---|---|
| To: | Greg Burd <greg(at)burd(dot)me> |
| Cc: | David Geier <geidav(dot)pg(at)gmail(dot)com>, PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org> |
| Subject: | Re: Keep TIDBitmap pagetable memory across bitmap scans |
| Date: | 2026-11-20 02:24:33 |
| Message-ID: | CANWCAZbE_qRBo1GpmhdrjhV9za2wHxU1a=t+yJhEYbPzAPmBXA@mail.gmail.com |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Wed, Nov 18, 2026 at 4:11 AM Greg Burd <greg(at)burd(dot)me> wrote:
> So I think the right direction is the radix tree, plus something at the
> process level for the faults. 2 MB pages from a pool, or keeping memory
> in the allocator, both work for hash join and sort as well. Keeping the
> hash table's memory, as my 0002 does, fixes only one consumer of a
> structure that is better replaced. I'd rather put the effort into
> helping John's series along: the test module from my 0001 can serve as
> its test suite, and I can measure lossify once it's back.
>
> John, would that help?
I haven't been following this thread closely, but I'm planning to
return to David's parallel BIS patch as a prerequisite for changing
the data structure.
--
John Naylor
Amazon Web Services
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Chao Li | 2026-11-20 02:40:49 | Re: Table AM callback for logical decoding support (REPACK CONCURRENTLY) |
| Previous Message | Keyerror Smart | 2026-11-20 02:14:13 | Re: [PATCH] Consider window functions when reordering GROUP BY items |