On 20.11.26 03:24, John Naylor wrote: > On Wed, Nov 18, 2026 at 4:11 AM Greg Burd <[email protected]> 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
