Marginal hack to avoid spending a lot of time in find_join_rel during
Tom Lane <tgl@sss.pgh.pa.us>
Marginal hack to avoid spending a lot of time in find_join_rel during large planning problems: when the list of join rels gets too long, make an auxiliary hash table that hashes on the identifying Bitmapset.
Files
| Path | Change | +/− |
|---|---|---|
| src/backend/nodes/bitmapset.c | modified | +26 −1 |
| src/backend/optimizer/geqo/geqo_eval.c | modified | +21 −9 |
| src/backend/optimizer/geqo/geqo_main.c | modified | +1 −2 |
| src/backend/optimizer/plan/planmain.c | modified | +2 −1 |
| src/backend/optimizer/util/relnode.c | modified | +101 −8 |
| src/backend/utils/hash/hashfn.c | modified | +25 −1 |
| src/include/nodes/bitmapset.h | modified | +4 −1 |
| src/include/nodes/relation.h | modified | +11 −1 |
| src/include/utils/hsearch.h | modified | +3 −1 |