| From: | David Geier <geidav(dot)pg(at)gmail(dot)com> |
|---|---|
| To: | John Naylor <johncnaylorls(at)gmail(dot)com>, Greg Burd <greg(at)burd(dot)me> |
| Cc: | PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org> |
| Subject: | Re: Keep TIDBitmap pagetable memory across bitmap scans |
| Date: | 2026-11-20 14:07:39 |
| Message-ID: | 15046ce2-b1e1-44fd-8f08-ce568fa51daa@gmail.com |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 20.11.26 03:24, John Naylor wrote:
> 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.
That sounds great.
--
David Geier
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Melih Mutlu | 2026-11-20 14:13:13 | Re: Call CalculateShmemSize() only once |
| Previous Message | David Geier | 2026-11-20 14:06:51 | Re: Keep TIDBitmap pagetable memory across bitmap scans |