Re: Memory-Bounded Hash Aggregation
Jeff Davis <pgsql@j-davis.com>
On Wed, 2020-02-05 at 11:56 -0800, Jeff Davis wrote: > Regarding the API, I'd like to change it, but I'm running into some > performance challenges when adding a layer of indirection. If I apply > the very simple attached patch, which simply makes a separate > allocation for the tapes array, it seems to slow down sort by ~5%. I tried a few different approaches to allow a flexible number of tapes without regressing normal Sort performance. I found some odd hacks, but I can't explain why they perform better than the more obvious approach. The LogicalTapeSetExtend() API is a natural evolution of what's already there, so I think I'll stick with that to keep the scope of Hash Aggregation under control. If we improve the API later I'm happy to adapt the HashAgg work to use it -- anything to take more code out of nodeAgg.c! Regards, Jeff Davis
Commits
-
Fix costing for disk-based hash aggregation.
- 7351bfeda33b 13.0 landed
-
Fixes for Disk-based Hash Aggregation.
- 64fe60227909 13.0 landed
-
Disk-based Hash Aggregation.
- 1f39bce02154 13.0 landed
-
Extend ExecBuildAggTrans() to support a NULL pointer check.
- c954d4904650 13.0 landed
-
Save calculated transitionSpace in Agg node.
- c11cb17dc55a 13.0 landed
-
Minor refactor of nodeAgg.c.
- 5b618e1f48ae 13.0 landed
-
Logical Tape Set: lazily allocate read buffer.
- 7fdd919ae755 13.0 landed
-
Introduce TupleHashTableHash() and LookupTupleHashEntryHash().
- 4eaea3db150a 13.0 landed
-
Logical Tape Set: use min heap for freelist.
- c02fdc922301 13.0 landed
-
Fix comments in execGrouping.c
- 30d47723fd15 13.0 landed
-
Avoid integer overflow while sifting-up a heap in tuplesort.c.
- 512f67c8d02c 10.0 cited
-
Make the overflow guards in ExecChooseHashTableSize be more protective.
- 8442317beb8f 9.0.0 cited
-
Improve performance of our private version of qsort. Per recent testing,
- a3f0b3d68f9a 8.2.0 cited