-
- Downloads
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.
Showing
- src/backend/nodes/bitmapset.c 26 additions, 1 deletionsrc/backend/nodes/bitmapset.c
- src/backend/optimizer/geqo/geqo_eval.c 21 additions, 9 deletionssrc/backend/optimizer/geqo/geqo_eval.c
- src/backend/optimizer/geqo/geqo_main.c 1 addition, 2 deletionssrc/backend/optimizer/geqo/geqo_main.c
- src/backend/optimizer/plan/planmain.c 2 additions, 1 deletionsrc/backend/optimizer/plan/planmain.c
- src/backend/optimizer/util/relnode.c 101 additions, 8 deletionssrc/backend/optimizer/util/relnode.c
- src/backend/utils/hash/hashfn.c 25 additions, 1 deletionsrc/backend/utils/hash/hashfn.c
- src/include/nodes/bitmapset.h 4 additions, 1 deletionsrc/include/nodes/bitmapset.h
- src/include/nodes/relation.h 11 additions, 1 deletionsrc/include/nodes/relation.h
- src/include/utils/hsearch.h 3 additions, 1 deletionsrc/include/utils/hsearch.h
Loading
Please register or sign in to comment