From e3a33a9a9f1a6afb80c9b83c1456c1a36fbcb70b Mon Sep 17 00:00:00 2001 From: Tom Lane Date: Wed, 8 Jun 2005 23:02:05 +0000 Subject: 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. --- src/backend/optimizer/plan/planmain.c | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) (limited to 'src/backend/optimizer/plan/planmain.c') diff --git a/src/backend/optimizer/plan/planmain.c b/src/backend/optimizer/plan/planmain.c index 1c87b24e4c6..50e1bc5ea8c 100644 --- a/src/backend/optimizer/plan/planmain.c +++ b/src/backend/optimizer/plan/planmain.c @@ -14,7 +14,7 @@ * * * IDENTIFICATION - * $PostgreSQL: pgsql/src/backend/optimizer/plan/planmain.c,v 1.83 2005/06/06 04:13:35 tgl Exp $ + * $PostgreSQL: pgsql/src/backend/optimizer/plan/planmain.c,v 1.84 2005/06/08 23:02:04 tgl Exp $ * *------------------------------------------------------------------------- */ @@ -116,6 +116,7 @@ query_planner(PlannerInfo *root, List *tlist, double tuple_fraction, root->base_rel_array = (RelOptInfo **) palloc0(root->base_rel_array_size * sizeof(RelOptInfo *)); root->join_rel_list = NIL; + root->join_rel_hash = NULL; root->equi_key_list = NIL; /* -- cgit v1.2.3