Branch data Line data Source code
1 : : /*------------------------------------------------------------------------
2 : : *
3 : : * geqo_eval.c
4 : : * Routines to evaluate query trees
5 : : *
6 : : * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
7 : : * Portions Copyright (c) 1994, Regents of the University of California
8 : : *
9 : : * src/backend/optimizer/geqo/geqo_eval.c
10 : : *
11 : : *-------------------------------------------------------------------------
12 : : */
13 : :
14 : : /*
15 : : * contributed by:
16 : : * =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
17 : : * * Martin Utesch * Institute of Automatic Control *
18 : : * = = University of Mining and Technology =
19 : : * * utesch@aut.tu-freiberg.de * Freiberg, Germany *
20 : : * =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
21 : : */
22 : :
23 : : #include "postgres.h"
24 : :
25 : : #include <float.h>
26 : : #include <limits.h>
27 : :
28 : : #include "optimizer/geqo.h"
29 : : #include "optimizer/joininfo.h"
30 : : #include "optimizer/pathnode.h"
31 : : #include "optimizer/paths.h"
32 : : #include "utils/memutils.h"
33 : :
34 : :
35 : : /* A "clump" of already-joined relations within gimme_tree */
36 : : typedef struct
37 : : {
38 : : RelOptInfo *joinrel; /* joinrel for the set of relations */
39 : : int size; /* number of input relations in clump */
40 : : } Clump;
41 : :
42 : : static List *merge_clump(PlannerInfo *root, List *clumps, Clump *new_clump,
43 : : int num_gene, bool force);
44 : : static bool desirable_join(PlannerInfo *root,
45 : : RelOptInfo *outer_rel, RelOptInfo *inner_rel);
46 : :
47 : :
48 : : /*
49 : : * geqo_eval
50 : : *
51 : : * Returns cost of a query tree as an individual of the population.
52 : : *
53 : : * If no legal join order can be extracted from the proposed tour,
54 : : * returns DBL_MAX.
55 : : */
56 : : Cost
57 : 3640 : geqo_eval(PlannerInfo *root, Gene *tour, int num_gene)
58 : : {
59 : : MemoryContext mycontext;
60 : : MemoryContext oldcxt;
61 : : RelOptInfo *joinrel;
62 : : Cost fitness;
63 : : int savelength;
64 : : struct HTAB *savehash;
65 : :
66 : : /*
67 : : * Create a private memory context that will hold all temp storage
68 : : * allocated inside gimme_tree().
69 : : *
70 : : * Since geqo_eval() will be called many times, we can't afford to let all
71 : : * that memory go unreclaimed until end of statement. Note we make the
72 : : * temp context a child of the planner's normal context, so that it will
73 : : * be freed even if we abort via ereport(ERROR).
74 : : */
75 : 3640 : mycontext = AllocSetContextCreate(CurrentMemoryContext,
76 : : "GEQO",
77 : : ALLOCSET_DEFAULT_SIZES);
78 : 3640 : oldcxt = MemoryContextSwitchTo(mycontext);
79 : :
80 : : /*
81 : : * gimme_tree will add entries to root->join_rel_list, which may or may
82 : : * not already contain some entries. The newly added entries will be
83 : : * recycled by the MemoryContextDelete below, so we must ensure that the
84 : : * list is restored to its former state before exiting. We can do this by
85 : : * truncating the list to its original length. NOTE this assumes that any
86 : : * added entries are appended at the end!
87 : : *
88 : : * We also must take care not to mess up the outer join_rel_hash, if there
89 : : * is one. We can do this by just temporarily setting the link to NULL.
90 : : * (If we are dealing with enough join rels, which we very likely are, a
91 : : * new hash table will get built and used locally.)
92 : : *
93 : : * join_rel_level[] shouldn't be in use, so just Assert it isn't.
94 : : */
95 : 3640 : savelength = list_length(root->join_rel_list);
96 : 3640 : savehash = root->join_rel_hash;
97 : : Assert(root->join_rel_level == NULL);
98 : :
99 : 3640 : root->join_rel_hash = NULL;
100 : :
101 : : /* construct the best path for the given combination of relations */
102 : 3640 : joinrel = gimme_tree(root, tour, num_gene);
103 : :
104 : : /*
105 : : * compute fitness, if we found a valid join
106 : : *
107 : : * XXX geqo does not currently support optimization for partial result
108 : : * retrieval, nor do we take any cognizance of possible use of
109 : : * parameterized paths --- how to fix?
110 : : */
111 [ + - ]: 3640 : if (joinrel)
112 : : {
113 : 3640 : Path *best_path = joinrel->cheapest_total_path;
114 : :
115 : 3640 : fitness = best_path->total_cost;
116 : : }
117 : : else
118 : 0 : fitness = DBL_MAX;
119 : :
120 : : /*
121 : : * Restore join_rel_list to its former state, and put back original
122 : : * hashtable if any.
123 : : */
124 : 3640 : root->join_rel_list = list_truncate(root->join_rel_list,
125 : : savelength);
126 : 3640 : root->join_rel_hash = savehash;
127 : :
128 : : /* release all the memory acquired within gimme_tree */
129 : 3640 : MemoryContextSwitchTo(oldcxt);
130 : 3640 : MemoryContextDelete(mycontext);
131 : :
132 : 3640 : return fitness;
133 : : }
134 : :
135 : : /*
136 : : * gimme_tree
137 : : * Form planner estimates for a join tree constructed in the specified
138 : : * order.
139 : : *
140 : : * 'tour' is the proposed join order, of length 'num_gene'
141 : : *
142 : : * Returns a new join relation whose cheapest path is the best plan for
143 : : * this join order. NB: will return NULL if join order is invalid and
144 : : * we can't modify it into a valid order.
145 : : *
146 : : * The original implementation of this routine always joined in the specified
147 : : * order, and so could only build left-sided plans (and right-sided and
148 : : * mixtures, as a byproduct of the fact that make_join_rel() is symmetric).
149 : : * It could never produce a "bushy" plan. This had a couple of big problems,
150 : : * of which the worst was that there are situations involving join order
151 : : * restrictions where the only valid plans are bushy.
152 : : *
153 : : * The present implementation takes the given tour as a guideline, but
154 : : * postpones joins that are illegal or seem unsuitable according to some
155 : : * heuristic rules. This allows correct bushy plans to be generated at need,
156 : : * and as a nice side-effect it seems to materially improve the quality of the
157 : : * generated plans. Note however that since it's just a heuristic, it can
158 : : * still fail in some cases. (In particular, we might clump together
159 : : * relations that actually mustn't be joined yet due to LATERAL restrictions;
160 : : * since there's no provision for un-clumping, this must lead to failure.)
161 : : */
162 : : RelOptInfo *
163 : 3675 : gimme_tree(PlannerInfo *root, Gene *tour, int num_gene)
164 : : {
165 : 3675 : GeqoPrivateData *private = GetGeqoPrivateData(root);
166 : : List *clumps;
167 : : int rel_count;
168 : :
169 : : /*
170 : : * Sometimes, a relation can't yet be joined to others due to heuristics
171 : : * or actual semantic restrictions. We maintain a list of "clumps" of
172 : : * successfully joined relations, with larger clumps at the front. Each
173 : : * new relation from the tour is added to the first clump it can be joined
174 : : * to; if there is none then it becomes a new clump of its own. When we
175 : : * enlarge an existing clump we check to see if it can now be merged with
176 : : * any other clumps. After the tour is all scanned, we forget about the
177 : : * heuristics and try to forcibly join any remaining clumps. If we are
178 : : * unable to merge all the clumps into one, fail.
179 : : */
180 : 3675 : clumps = NIL;
181 : :
182 [ + + ]: 12960 : for (rel_count = 0; rel_count < num_gene; rel_count++)
183 : : {
184 : : int cur_rel_index;
185 : : RelOptInfo *cur_rel;
186 : : Clump *cur_clump;
187 : :
188 : : /* Get the next input relation */
189 : 9285 : cur_rel_index = (int) tour[rel_count];
190 : 9285 : cur_rel = (RelOptInfo *) list_nth(private->initial_rels,
191 : : cur_rel_index - 1);
192 : :
193 : : /* Make it into a single-rel clump */
194 : 9285 : cur_clump = palloc_object(Clump);
195 : 9285 : cur_clump->joinrel = cur_rel;
196 : 9285 : cur_clump->size = 1;
197 : :
198 : : /* Merge it into the clumps list, using only desirable joins */
199 : 9285 : clumps = merge_clump(root, clumps, cur_clump, num_gene, false);
200 : : }
201 : :
202 [ - + ]: 3675 : if (list_length(clumps) > 1)
203 : : {
204 : : /* Force-join the remaining clumps in some legal order */
205 : : List *fclumps;
206 : : ListCell *lc;
207 : :
208 : 0 : fclumps = NIL;
209 [ # # # # : 0 : foreach(lc, clumps)
# # ]
210 : : {
211 : 0 : Clump *clump = (Clump *) lfirst(lc);
212 : :
213 : 0 : fclumps = merge_clump(root, fclumps, clump, num_gene, true);
214 : : }
215 : 0 : clumps = fclumps;
216 : : }
217 : :
218 : : /* Did we succeed in forming a single join relation? */
219 [ - + ]: 3675 : if (list_length(clumps) != 1)
220 : 0 : return NULL;
221 : :
222 : 3675 : return ((Clump *) linitial(clumps))->joinrel;
223 : : }
224 : :
225 : : /*
226 : : * Merge a "clump" into the list of existing clumps for gimme_tree.
227 : : *
228 : : * We try to merge the clump into some existing clump, and repeat if
229 : : * successful. When no more merging is possible, insert the clump
230 : : * into the list, preserving the list ordering rule (namely, that
231 : : * clumps of larger size appear earlier).
232 : : *
233 : : * If force is true, merge anywhere a join is legal, even if it causes
234 : : * a cartesian join to be performed. When force is false, do only
235 : : * "desirable" joins.
236 : : */
237 : : static List *
238 : 14895 : merge_clump(PlannerInfo *root, List *clumps, Clump *new_clump, int num_gene,
239 : : bool force)
240 : : {
241 : : ListCell *lc;
242 : : int pos;
243 : :
244 : : /* Look for a clump that new_clump can join to */
245 [ + + + + : 18175 : foreach(lc, clumps)
+ + ]
246 : : {
247 : 8890 : Clump *old_clump = (Clump *) lfirst(lc);
248 : :
249 [ + - + + ]: 17780 : if (force ||
250 : 8890 : desirable_join(root, old_clump->joinrel, new_clump->joinrel))
251 : : {
252 : : RelOptInfo *joinrel;
253 : :
254 : : /*
255 : : * Construct a RelOptInfo representing the join of these two input
256 : : * relations. Note that we expect the joinrel not to exist in
257 : : * root->join_rel_list yet, and so the paths constructed for it
258 : : * will only include the ones we want.
259 : : */
260 : 6990 : joinrel = make_join_rel(root,
261 : : old_clump->joinrel,
262 : : new_clump->joinrel);
263 : :
264 : : /* Keep searching if join order is not valid */
265 [ + + ]: 6990 : if (joinrel)
266 : : {
267 : 5610 : bool is_top_rel = bms_equal(joinrel->relids,
268 : 5610 : root->all_query_rels);
269 : :
270 : : /* Create paths for partitionwise joins. */
271 : 5610 : generate_partitionwise_join_paths(root, joinrel);
272 : :
273 : : /*
274 : : * Except for the topmost scan/join rel, consider gathering
275 : : * partial paths. We'll do the same for the topmost scan/join
276 : : * rel once we know the final targetlist (see
277 : : * grouping_planner).
278 : : */
279 [ + + ]: 5610 : if (!is_top_rel)
280 : 1935 : generate_useful_gather_paths(root, joinrel, false);
281 : :
282 : : /* Find and save the cheapest paths for this joinrel */
283 : 5610 : set_cheapest(joinrel);
284 : :
285 : : /*
286 : : * Except for the topmost scan/join rel, consider generating
287 : : * partial aggregation paths for the grouped relation on top
288 : : * of the paths of this rel. After that, we're done creating
289 : : * paths for the grouped relation, so run set_cheapest().
290 : : */
291 [ + + - + ]: 5610 : if (joinrel->grouped_rel != NULL && !is_top_rel)
292 : : {
293 : 0 : RelOptInfo *grouped_rel = joinrel->grouped_rel;
294 : :
295 : : Assert(IS_GROUPED_REL(grouped_rel));
296 : :
297 : 0 : generate_grouped_paths(root, grouped_rel, joinrel);
298 : 0 : set_cheapest(grouped_rel);
299 : : }
300 : :
301 : : /* Absorb new clump into old */
302 : 5610 : old_clump->joinrel = joinrel;
303 : 5610 : old_clump->size += new_clump->size;
304 : 5610 : pfree(new_clump);
305 : :
306 : : /* Remove old_clump from list */
307 : 5610 : clumps = foreach_delete_current(clumps, lc);
308 : :
309 : : /*
310 : : * Recursively try to merge the enlarged old_clump with
311 : : * others. When no further merge is possible, we'll reinsert
312 : : * it into the list.
313 : : */
314 : 5610 : return merge_clump(root, clumps, old_clump, num_gene, force);
315 : : }
316 : : }
317 : : }
318 : :
319 : : /*
320 : : * No merging is possible, so add new_clump as an independent clump, in
321 : : * proper order according to size. We can be fast for the common case
322 : : * where it has size 1 --- it should always go at the end.
323 : : */
324 [ + + + + ]: 9285 : if (clumps == NIL || new_clump->size == 1)
325 : 8560 : return lappend(clumps, new_clump);
326 : :
327 : : /* Else search for the place to insert it */
328 [ + + ]: 850 : for (pos = 0; pos < list_length(clumps); pos++)
329 : : {
330 : 725 : Clump *old_clump = (Clump *) list_nth(clumps, pos);
331 : :
332 [ + + ]: 725 : if (new_clump->size > old_clump->size)
333 : 600 : break; /* new_clump belongs before old_clump */
334 : : }
335 : 725 : clumps = list_insert_nth(clumps, pos, new_clump);
336 : :
337 : 725 : return clumps;
338 : : }
339 : :
340 : : /*
341 : : * Heuristics for gimme_tree: do we want to join these two relations?
342 : : */
343 : : static bool
344 : 8890 : desirable_join(PlannerInfo *root,
345 : : RelOptInfo *outer_rel, RelOptInfo *inner_rel)
346 : : {
347 : : /*
348 : : * Join if there is an applicable join clause, or if there is a join order
349 : : * restriction forcing these rels to be joined.
350 : : */
351 [ + + - + ]: 10790 : if (have_relevant_joinclause(root, outer_rel, inner_rel) ||
352 : 1900 : have_join_order_restriction(root, outer_rel, inner_rel))
353 : 6990 : return true;
354 : :
355 : : /* Otherwise postpone the join till later. */
356 : 1900 : return false;
357 : : }
|
