Re: Should HashSetOp go away
Tom Lane <tgl@sss.pgh.pa.us>
From: Tom Lane <tgl@sss.pgh.pa.us>
To: Jeff Janes <jeff.janes@gmail.com>
Cc: PostgreSQL Hackers <pgsql-hackers@lists.postgresql.org>
Date: 2025-10-26T18:00:17Z
Lists: pgsql-hackers
Commits
Same data as JSON:
GET /api/v1/messages/:b64id/commits
the thread's linked commits as JSON, with link sources.
API reference →
-
Change "long" numGroups fields to be Cardinality (i.e., double).
- 8f29467c57f4 19 (unreleased) landed
-
Improve planner's estimates of tuple hash table sizes.
- 1ea5bdb00bfb 19 (unreleased) landed
-
Use BumpContext contexts in TupleHashTables, and do some code cleanup.
- c106ef08071a 19 (unreleased) landed
-
Convert SetOp to read its inputs as outerPlan and innerPlan.
- 27627929528e 18.0 cited
-
Use more efficient hashtable for execGrouping.c to speed up hash aggregation.
- 5dfc198146b4 10.0 cited
Jeff Janes <jeff.janes@gmail.com> writes: > I noticed some changes in this code v18, so wanted to revisit the issue. > Under commit 27627929528e, it looks like it got 25% more memory efficient, > but it thinks it got 40% more efficient, so the memory use got better but > the estimation actually got worse. Hmm, so why not fix that estimation? > I was thinking of ways to improve the memory usage (or at least its > estimation) but decided maybe it would be better if HashSetOp went away > entirely. As far as I can tell HashSetOp has nothing to recommend it other > than the fact that it already exists. If we instead used an elaboration on > Hash Anti Join, then it would automatically get spilling to disk, parallel > operations, better estimation, and the benefits of whatever micro > optimizations people lavish on the highly used HashJoin machinery but not > the obscure, little-used HashSetOp. This seems like a pretty bad solution. It would imply exporting the complexities of duplicate-counting for EXCEPT ALL and INTERSECT ALL modes into the hash-join logic. We don't need that extra complexity there (it's more than enough of a mess already), and we don't need whatever performance hit ordinary hash joins would take. Also, I doubt the problem is confined to nodeSetOp. I think this is fundamentally a complaint about BuildTupleHashTable and friends being unable to spill to disk. Since we also use that logic for hashed aggregates, RecursiveUnion, and hashed SubPlans, getting rid of nodeSetOp isn't going to move the needle very far. regards, tom lane