1 /*-------------------------------------------------------------------------
4 * Definitions for planner's internal data structures.
7 * Portions Copyright (c) 1996-2007, PostgreSQL Global Development Group
8 * Portions Copyright (c) 1994, Regents of the University of California
10 * $PostgreSQL: pgsql/src/include/nodes/relation.h,v 1.146 2007/09/20 17:56:32 tgl Exp $
12 *-------------------------------------------------------------------------
17 #include "access/sdir.h"
18 #include "nodes/bitmapset.h"
19 #include "nodes/params.h"
20 #include "nodes/parsenodes.h"
21 #include "storage/block.h"
26 * Set of relation identifiers (indexes into the rangetable).
28 typedef Bitmapset *Relids;
31 * When looking for a "cheapest path", this enum specifies whether we want
32 * cheapest startup cost or cheapest total cost.
34 typedef enum CostSelector
36 STARTUP_COST, TOTAL_COST
40 * The cost estimate produced by cost_qual_eval() includes both a one-time
41 * (startup) cost, and a per-tuple cost.
43 typedef struct QualCost
45 Cost startup; /* one-time cost */
46 Cost per_tuple; /* per-evaluation cost */
52 * Global information for planning/optimization
54 * PlannerGlobal holds state for an entire planner invocation; this state
55 * is shared across all levels of sub-Queries that exist in the command being
59 typedef struct PlannerGlobal
63 ParamListInfo boundParams; /* Param values provided to planner() */
65 List *paramlist; /* to keep track of cross-level Params */
67 List *subplans; /* Plans for SubPlan nodes */
69 List *subrtables; /* Rangetables for SubPlan nodes */
71 Bitmapset *rewindPlanIDs; /* indices of subplans that require REWIND */
73 List *finalrtable; /* "flat" rangetable for executor */
75 bool transientPlan; /* redo plan when TransactionXmin changes? */
78 /* macro for fetching the Plan associated with a SubPlan node */
79 #define planner_subplan_get_plan(root, subplan) \
80 ((Plan *) list_nth((root)->glob->subplans, (subplan)->plan_id - 1))
85 * Per-query information for planning/optimization
87 * This struct is conventionally called "root" in all the planner routines.
88 * It holds links to all of the planner's working state, in addition to the
89 * original Query. Note that at present the planner extensively modifies
90 * the passed-in Query data structure; someday that should stop.
93 typedef struct PlannerInfo
97 Query *parse; /* the Query being planned */
99 PlannerGlobal *glob; /* global info for current planner run */
101 Index query_level; /* 1 at the outermost Query */
104 * simple_rel_array holds pointers to "base rels" and "other rels" (see
105 * comments for RelOptInfo for more info). It is indexed by rangetable
106 * index (so entry 0 is always wasted). Entries can be NULL when an RTE
107 * does not correspond to a base relation, such as a join RTE or an
108 * unreferenced view RTE; or if the RelOptInfo hasn't been made yet.
110 struct RelOptInfo **simple_rel_array; /* All 1-rel RelOptInfos */
111 int simple_rel_array_size; /* allocated size of array */
114 * simple_rte_array is the same length as simple_rel_array and holds
115 * pointers to the associated rangetable entries. This lets us avoid
116 * rt_fetch(), which can be a bit slow once large inheritance sets have
119 RangeTblEntry **simple_rte_array; /* rangetable as an array */
122 * join_rel_list is a list of all join-relation RelOptInfos we have
123 * considered in this planning run. For small problems we just scan the
124 * list to do lookups, but when there are many join relations we build a
125 * hash table for faster lookups. The hash table is present and valid
126 * when join_rel_hash is not NULL. Note that we still maintain the list
127 * even when using the hash table for lookups; this simplifies life for
130 List *join_rel_list; /* list of join-relation RelOptInfos */
131 struct HTAB *join_rel_hash; /* optional hashtable for join relations */
133 List *resultRelations; /* integer list of RT indexes, or NIL */
135 List *returningLists; /* list of lists of TargetEntry, or NIL */
137 List *init_plans; /* init subplans for query */
139 List *eq_classes; /* list of active EquivalenceClasses */
141 List *canon_pathkeys; /* list of "canonical" PathKeys */
143 List *left_join_clauses; /* list of RestrictInfos for
144 * mergejoinable outer join clauses
145 * w/nonnullable var on left */
147 List *right_join_clauses; /* list of RestrictInfos for
148 * mergejoinable outer join clauses
149 * w/nonnullable var on right */
151 List *full_join_clauses; /* list of RestrictInfos for
152 * mergejoinable full join clauses */
154 List *oj_info_list; /* list of OuterJoinInfos */
156 List *in_info_list; /* list of InClauseInfos */
158 List *append_rel_list; /* list of AppendRelInfos */
160 List *query_pathkeys; /* desired pathkeys for query_planner(), and
161 * actual pathkeys afterwards */
163 List *group_pathkeys; /* groupClause pathkeys, if any */
164 List *sort_pathkeys; /* sortClause pathkeys, if any */
166 MemoryContext planner_cxt; /* context holding PlannerInfo */
168 double total_table_pages; /* # of pages in all tables of query */
170 double tuple_fraction; /* tuple_fraction passed to query_planner */
172 bool hasJoinRTEs; /* true if any RTEs are RTE_JOIN kind */
173 bool hasOuterJoins; /* true if any RTEs are outer joins */
174 bool hasHavingQual; /* true if havingQual was non-null */
175 bool hasPseudoConstantQuals; /* true if any RestrictInfo has
176 * pseudoconstant = true */
181 * In places where it's known that simple_rte_array[] must have been prepared
182 * already, we just index into it to fetch RTEs. In code that might be
183 * executed before or after entering query_planner(), use this macro.
185 #define planner_rt_fetch(rti, root) \
186 ((root)->simple_rte_array ? (root)->simple_rte_array[rti] : \
187 rt_fetch(rti, (root)->parse->rtable))
192 * Per-relation information for planning/optimization
194 * For planning purposes, a "base rel" is either a plain relation (a table)
195 * or the output of a sub-SELECT or function that appears in the range table.
196 * In either case it is uniquely identified by an RT index. A "joinrel"
197 * is the joining of two or more base rels. A joinrel is identified by
198 * the set of RT indexes for its component baserels. We create RelOptInfo
199 * nodes for each baserel and joinrel, and store them in the PlannerInfo's
200 * simple_rel_array and join_rel_list respectively.
202 * Note that there is only one joinrel for any given set of component
203 * baserels, no matter what order we assemble them in; so an unordered
204 * set is the right datatype to identify it with.
206 * We also have "other rels", which are like base rels in that they refer to
207 * single RT indexes; but they are not part of the join tree, and are given
208 * a different RelOptKind to identify them.
210 * Currently the only kind of otherrels are those made for member relations
211 * of an "append relation", that is an inheritance set or UNION ALL subquery.
212 * An append relation has a parent RTE that is a base rel, which represents
213 * the entire append relation. The member RTEs are otherrels. The parent
214 * is present in the query join tree but the members are not. The member
215 * RTEs and otherrels are used to plan the scans of the individual tables or
216 * subqueries of the append set; then the parent baserel is given an Append
217 * plan comprising the best plans for the individual member rels. (See
218 * comments for AppendRelInfo for more information.)
220 * At one time we also made otherrels to represent join RTEs, for use in
221 * handling join alias Vars. Currently this is not needed because all join
222 * alias Vars are expanded to non-aliased form during preprocess_expression.
224 * Parts of this data structure are specific to various scan and join
225 * mechanisms. It didn't seem worth creating new node types for them.
227 * relids - Set of base-relation identifiers; it is a base relation
228 * if there is just one, a join relation if more than one
229 * rows - estimated number of tuples in the relation after restriction
230 * clauses have been applied (ie, output rows of a plan for it)
231 * width - avg. number of bytes per tuple in the relation after the
232 * appropriate projections have been done (ie, output width)
233 * reltargetlist - List of Var nodes for the attributes we need to
234 * output from this relation (in no particular order)
235 * NOTE: in a child relation, may contain RowExprs
236 * pathlist - List of Path nodes, one for each potentially useful
237 * method of generating the relation
238 * cheapest_startup_path - the pathlist member with lowest startup cost
239 * (regardless of its ordering)
240 * cheapest_total_path - the pathlist member with lowest total cost
241 * (regardless of its ordering)
242 * cheapest_unique_path - for caching cheapest path to produce unique
243 * (no duplicates) output from relation
245 * If the relation is a base relation it will have these fields set:
247 * relid - RTE index (this is redundant with the relids field, but
248 * is provided for convenience of access)
249 * rtekind - distinguishes plain relation, subquery, or function RTE
250 * min_attr, max_attr - range of valid AttrNumbers for rel
251 * attr_needed - array of bitmapsets indicating the highest joinrel
252 * in which each attribute is needed; if bit 0 is set then
253 * the attribute is needed as part of final targetlist
254 * attr_widths - cache space for per-attribute width estimates;
255 * zero means not computed yet
256 * indexlist - list of IndexOptInfo nodes for relation's indexes
257 * (always NIL if it's not a table)
258 * pages - number of disk pages in relation (zero if not a table)
259 * tuples - number of tuples in relation (not considering restrictions)
260 * subplan - plan for subquery (NULL if it's not a subquery)
261 * subrtable - rangetable for subquery (NIL if it's not a subquery)
263 * Note: for a subquery, tuples and subplan are not set immediately
264 * upon creation of the RelOptInfo object; they are filled in when
265 * set_base_rel_pathlist processes the object.
267 * For otherrels that are appendrel members, these fields are filled
268 * in just as for a baserel.
270 * The presence of the remaining fields depends on the restrictions
271 * and joins that the relation participates in:
273 * baserestrictinfo - List of RestrictInfo nodes, containing info about
274 * each non-join qualification clause in which this relation
275 * participates (only used for base rels)
276 * baserestrictcost - Estimated cost of evaluating the baserestrictinfo
277 * clauses at a single tuple (only used for base rels)
278 * joininfo - List of RestrictInfo nodes, containing info about each
279 * join clause in which this relation participates (but
280 * note this excludes clauses that might be derivable from
281 * EquivalenceClasses)
282 * has_eclass_joins - flag that EquivalenceClass joins are possible
283 * index_outer_relids - only used for base rels; set of outer relids
284 * that participate in indexable joinclauses for this rel
285 * index_inner_paths - only used for base rels; list of InnerIndexscanInfo
286 * nodes showing best indexpaths for various subsets of
287 * index_outer_relids.
289 * Note: Keeping a restrictinfo list in the RelOptInfo is useful only for
290 * base rels, because for a join rel the set of clauses that are treated as
291 * restrict clauses varies depending on which sub-relations we choose to join.
292 * (For example, in a 3-base-rel join, a clause relating rels 1 and 2 must be
293 * treated as a restrictclause if we join {1} and {2 3} to make {1 2 3}; but
294 * if we join {1 2} and {3} then that clause will be a restrictclause in {1 2}
295 * and should not be processed again at the level of {1 2 3}.) Therefore,
296 * the restrictinfo list in the join case appears in individual JoinPaths
297 * (field joinrestrictinfo), not in the parent relation. But it's OK for
298 * the RelOptInfo to store the joininfo list, because that is the same
299 * for a given rel no matter how we form it.
301 * We store baserestrictcost in the RelOptInfo (for base relations) because
302 * we know we will need it at least once (to price the sequential scan)
303 * and may need it multiple times to price index scans.
306 typedef enum RelOptKind
310 RELOPT_OTHER_MEMBER_REL
313 typedef struct RelOptInfo
317 RelOptKind reloptkind;
319 /* all relations included in this RelOptInfo */
320 Relids relids; /* set of base relids (rangetable indexes) */
322 /* size estimates generated by planner */
323 double rows; /* estimated number of result tuples */
324 int width; /* estimated avg width of result tuples */
326 /* materialization information */
327 List *reltargetlist; /* needed Vars */
328 List *pathlist; /* Path structures */
329 struct Path *cheapest_startup_path;
330 struct Path *cheapest_total_path;
331 struct Path *cheapest_unique_path;
333 /* information about a base rel (not set for join rels!) */
335 RTEKind rtekind; /* RELATION, SUBQUERY, or FUNCTION */
336 AttrNumber min_attr; /* smallest attrno of rel (often <0) */
337 AttrNumber max_attr; /* largest attrno of rel */
338 Relids *attr_needed; /* array indexed [min_attr .. max_attr] */
339 int32 *attr_widths; /* array indexed [min_attr .. max_attr] */
343 struct Plan *subplan; /* if subquery */
344 List *subrtable; /* if subquery */
346 /* used by various scans and joins: */
347 List *baserestrictinfo; /* RestrictInfo structures (if base
349 QualCost baserestrictcost; /* cost of evaluating the above */
350 List *joininfo; /* RestrictInfo structures for join clauses
351 * involving this rel */
352 bool has_eclass_joins; /* T means joininfo is incomplete */
354 /* cached info about inner indexscan paths for relation: */
355 Relids index_outer_relids; /* other relids in indexable join
357 List *index_inner_paths; /* InnerIndexscanInfo nodes */
360 * Inner indexscans are not in the main pathlist because they are not
361 * usable except in specific join contexts. We use the index_inner_paths
362 * list just to avoid recomputing the best inner indexscan repeatedly for
363 * similar outer relations. See comments for InnerIndexscanInfo.
369 * Per-index information for planning/optimization
371 * Prior to Postgres 7.0, RelOptInfo was used to describe both relations
372 * and indexes, but that created confusion without actually doing anything
373 * useful. So now we have a separate IndexOptInfo struct for indexes.
375 * opfamily[], indexkeys[], opcintype[], fwdsortop[], revsortop[],
376 * and nulls_first[] each have ncolumns entries.
377 * Note: for historical reasons, the opfamily array has an extra entry
378 * that is always zero. Some code scans until it sees a zero entry,
379 * rather than looking at ncolumns.
381 * Zeroes in the indexkeys[] array indicate index columns that are
382 * expressions; there is one element in indexprs for each such column.
384 * For an unordered index, the sortop arrays contains zeroes. Note that
385 * fwdsortop[] and nulls_first[] describe the sort ordering of a forward
386 * indexscan; we can also consider a backward indexscan, which will
387 * generate sort order described by revsortop/!nulls_first.
389 * The indexprs and indpred expressions have been run through
390 * prepqual.c and eval_const_expressions() for ease of matching to
391 * WHERE clauses. indpred is in implicit-AND form.
393 typedef struct IndexOptInfo
397 Oid indexoid; /* OID of the index relation */
398 RelOptInfo *rel; /* back-link to index's table */
400 /* statistics from pg_class */
401 BlockNumber pages; /* number of disk pages in index */
402 double tuples; /* number of index tuples in index */
404 /* index descriptor information */
405 int ncolumns; /* number of columns in index */
406 Oid *opfamily; /* OIDs of operator families for columns */
407 int *indexkeys; /* column numbers of index's keys, or 0 */
408 Oid *opcintype; /* OIDs of opclass declared input data types */
409 Oid *fwdsortop; /* OIDs of sort operators for each column */
410 Oid *revsortop; /* OIDs of sort operators for backward scan */
411 bool *nulls_first; /* do NULLs come first in the sort order? */
412 Oid relam; /* OID of the access method (in pg_am) */
414 RegProcedure amcostestimate; /* OID of the access method's cost fcn */
416 List *indexprs; /* expressions for non-simple index columns */
417 List *indpred; /* predicate if a partial index, else NIL */
419 bool predOK; /* true if predicate matches query */
420 bool unique; /* true if a unique index */
421 bool amoptionalkey; /* can query omit key for the first column? */
422 bool amsearchnulls; /* can AM search for NULL index entries? */
429 * Whenever we can determine that a mergejoinable equality clause A = B is
430 * not delayed by any outer join, we create an EquivalenceClass containing
431 * the expressions A and B to record this knowledge. If we later find another
432 * equivalence B = C, we add C to the existing EquivalenceClass; this may
433 * require merging two existing EquivalenceClasses. At the end of the qual
434 * distribution process, we have sets of values that are known all transitively
435 * equal to each other, where "equal" is according to the rules of the btree
436 * operator family(s) shown in ec_opfamilies. (We restrict an EC to contain
437 * only equalities whose operators belong to the same set of opfamilies. This
438 * could probably be relaxed, but for now it's not worth the trouble, since
439 * nearly all equality operators belong to only one btree opclass anyway.)
441 * We also use EquivalenceClasses as the base structure for PathKeys, letting
442 * us represent knowledge about different sort orderings being equivalent.
443 * Since every PathKey must reference an EquivalenceClass, we will end up
444 * with single-member EquivalenceClasses whenever a sort key expression has
445 * not been equivalenced to anything else. It is also possible that such an
446 * EquivalenceClass will contain a volatile expression ("ORDER BY random()"),
447 * which is a case that can't arise otherwise since clauses containing
448 * volatile functions are never considered mergejoinable. We mark such
449 * EquivalenceClasses specially to prevent them from being merged with
450 * ordinary EquivalenceClasses.
452 * We allow equality clauses appearing below the nullable side of an outer join
453 * to form EquivalenceClasses, but these have a slightly different meaning:
454 * the included values might be all NULL rather than all the same non-null
455 * values. See src/backend/optimizer/README for more on that point.
457 * NB: if ec_merged isn't NULL, this class has been merged into another, and
458 * should be ignored in favor of using the pointed-to class.
460 typedef struct EquivalenceClass
464 List *ec_opfamilies; /* btree operator family OIDs */
465 List *ec_members; /* list of EquivalenceMembers */
466 List *ec_sources; /* list of generating RestrictInfos */
467 List *ec_derives; /* list of derived RestrictInfos */
468 Relids ec_relids; /* all relids appearing in ec_members */
469 bool ec_has_const; /* any pseudoconstants in ec_members? */
470 bool ec_has_volatile; /* the (sole) member is a volatile expr */
471 bool ec_below_outer_join; /* equivalence applies below an OJ */
472 bool ec_broken; /* failed to generate needed clauses? */
473 struct EquivalenceClass *ec_merged; /* set if merged into another EC */
477 * EquivalenceMember - one member expression of an EquivalenceClass
479 * em_is_child signifies that this element was built by transposing a member
480 * for an inheritance parent relation to represent the corresponding expression
481 * on an inheritance child. The element should be ignored for all purposes
482 * except constructing inner-indexscan paths for the child relation. (Other
483 * types of join are driven from transposed joininfo-list entries.) Note
484 * that the EC's ec_relids field does NOT include the child relation.
486 * em_datatype is usually the same as exprType(em_expr), but can be
487 * different when dealing with a binary-compatible opfamily; in particular
488 * anyarray_ops would never work without this. Use em_datatype when
489 * looking up a specific btree operator to work with this expression.
491 typedef struct EquivalenceMember
495 Expr *em_expr; /* the expression represented */
496 Relids em_relids; /* all relids appearing in em_expr */
497 bool em_is_const; /* expression is pseudoconstant? */
498 bool em_is_child; /* derived version for a child relation? */
499 Oid em_datatype; /* the "nominal type" used by the opfamily */
505 * The sort ordering of a path is represented by a list of PathKey nodes.
506 * An empty list implies no known ordering. Otherwise the first item
507 * represents the primary sort key, the second the first secondary sort key,
508 * etc. The value being sorted is represented by linking to an
509 * EquivalenceClass containing that value and including pk_opfamily among its
510 * ec_opfamilies. This is a convenient method because it makes it trivial
511 * to detect equivalent and closely-related orderings. (See optimizer/README
512 * for more information.)
514 * Note: pk_strategy is either BTLessStrategyNumber (for ASC) or
515 * BTGreaterStrategyNumber (for DESC). We assume that all ordering-capable
516 * index types will use btree-compatible strategy numbers.
519 typedef struct PathKey
523 EquivalenceClass *pk_eclass; /* the value that is ordered */
524 Oid pk_opfamily; /* btree opfamily defining the ordering */
525 int pk_strategy; /* sort direction (ASC or DESC) */
526 bool pk_nulls_first; /* do NULLs come before normal values? */
530 * Type "Path" is used as-is for sequential-scan paths. For other
531 * path types it is the first component of a larger struct.
533 * Note: "pathtype" is the NodeTag of the Plan node we could build from this
534 * Path. It is partially redundant with the Path's NodeTag, but allows us
535 * to use the same Path type for multiple Plan types where there is no need
536 * to distinguish the Plan type during path processing.
543 NodeTag pathtype; /* tag identifying scan/join method */
545 RelOptInfo *parent; /* the relation this path can build */
547 /* estimated execution costs for path (see costsize.c for more info) */
548 Cost startup_cost; /* cost expended before fetching any tuples */
549 Cost total_cost; /* total cost (assuming all tuples fetched) */
551 List *pathkeys; /* sort ordering of path's output */
552 /* pathkeys is a List of PathKey nodes; see above */
556 * IndexPath represents an index scan over a single index.
558 * 'indexinfo' is the index to be scanned.
560 * 'indexclauses' is a list of index qualification clauses, with implicit
561 * AND semantics across the list. Each clause is a RestrictInfo node from
562 * the query's WHERE or JOIN conditions.
564 * 'indexquals' has the same structure as 'indexclauses', but it contains
565 * the actual indexqual conditions that can be used with the index.
566 * In simple cases this is identical to 'indexclauses', but when special
567 * indexable operators appear in 'indexclauses', they are replaced by the
568 * derived indexscannable conditions in 'indexquals'.
570 * 'isjoininner' is TRUE if the path is a nestloop inner scan (that is,
571 * some of the index conditions are join rather than restriction clauses).
572 * Note that the path costs will be calculated differently from a plain
573 * indexscan in this case, and in addition there's a special 'rows' value
574 * different from the parent RelOptInfo's (see below).
576 * 'indexscandir' is one of:
577 * ForwardScanDirection: forward scan of an ordered index
578 * BackwardScanDirection: backward scan of an ordered index
579 * NoMovementScanDirection: scan of an unordered index, or don't care
580 * (The executor doesn't care whether it gets ForwardScanDirection or
581 * NoMovementScanDirection for an indexscan, but the planner wants to
582 * distinguish ordered from unordered indexes for building pathkeys.)
584 * 'indextotalcost' and 'indexselectivity' are saved in the IndexPath so that
585 * we need not recompute them when considering using the same index in a
586 * bitmap index/heap scan (see BitmapHeapPath). The costs of the IndexPath
587 * itself represent the costs of an IndexScan plan type.
589 * 'rows' is the estimated result tuple count for the indexscan. This
590 * is the same as path.parent->rows for a simple indexscan, but it is
591 * different for a nestloop inner scan, because the additional indexquals
592 * coming from join clauses make the scan more selective than the parent
593 * rel's restrict clauses alone would do.
596 typedef struct IndexPath
599 IndexOptInfo *indexinfo;
603 ScanDirection indexscandir;
605 Selectivity indexselectivity;
606 double rows; /* estimated number of result tuples */
610 * BitmapHeapPath represents one or more indexscans that generate TID bitmaps
611 * instead of directly accessing the heap, followed by AND/OR combinations
612 * to produce a single bitmap, followed by a heap scan that uses the bitmap.
613 * Note that the output is always considered unordered, since it will come
614 * out in physical heap order no matter what the underlying indexes did.
616 * The individual indexscans are represented by IndexPath nodes, and any
617 * logic on top of them is represented by a tree of BitmapAndPath and
618 * BitmapOrPath nodes. Notice that we can use the same IndexPath node both
619 * to represent a regular IndexScan plan, and as the child of a BitmapHeapPath
620 * that represents scanning the same index using a BitmapIndexScan. The
621 * startup_cost and total_cost figures of an IndexPath always represent the
622 * costs to use it as a regular IndexScan. The costs of a BitmapIndexScan
623 * can be computed using the IndexPath's indextotalcost and indexselectivity.
625 * BitmapHeapPaths can be nestloop inner indexscans. The isjoininner and
626 * rows fields serve the same purpose as for plain IndexPaths.
628 typedef struct BitmapHeapPath
631 Path *bitmapqual; /* IndexPath, BitmapAndPath, BitmapOrPath */
632 bool isjoininner; /* T if it's a nestloop inner scan */
633 double rows; /* estimated number of result tuples */
637 * BitmapAndPath represents a BitmapAnd plan node; it can only appear as
638 * part of the substructure of a BitmapHeapPath. The Path structure is
639 * a bit more heavyweight than we really need for this, but for simplicity
640 * we make it a derivative of Path anyway.
642 typedef struct BitmapAndPath
645 List *bitmapquals; /* IndexPaths and BitmapOrPaths */
646 Selectivity bitmapselectivity;
650 * BitmapOrPath represents a BitmapOr plan node; it can only appear as
651 * part of the substructure of a BitmapHeapPath. The Path structure is
652 * a bit more heavyweight than we really need for this, but for simplicity
653 * we make it a derivative of Path anyway.
655 typedef struct BitmapOrPath
658 List *bitmapquals; /* IndexPaths and BitmapAndPaths */
659 Selectivity bitmapselectivity;
663 * TidPath represents a scan by TID
665 * tidquals is an implicitly OR'ed list of qual expressions of the form
666 * "CTID = pseudoconstant" or "CTID = ANY(pseudoconstant_array)".
667 * Note they are bare expressions, not RestrictInfos.
669 typedef struct TidPath
672 List *tidquals; /* qual(s) involving CTID = something */
676 * AppendPath represents an Append plan, ie, successive execution of
677 * several member plans.
679 * Note: it is possible for "subpaths" to contain only one, or even no,
680 * elements. These cases are optimized during create_append_plan.
682 typedef struct AppendPath
685 List *subpaths; /* list of component Paths */
689 * ResultPath represents use of a Result plan node to compute a variable-free
690 * targetlist with no underlying tables (a "SELECT expressions" query).
691 * The query could have a WHERE clause, too, represented by "quals".
693 * Note that quals is a list of bare clauses, not RestrictInfos.
695 typedef struct ResultPath
702 * MaterialPath represents use of a Material plan node, i.e., caching of
703 * the output of its subpath. This is used when the subpath is expensive
704 * and needs to be scanned repeatedly, or when we need mark/restore ability
705 * and the subpath doesn't have it.
707 typedef struct MaterialPath
714 * UniquePath represents elimination of distinct rows from the output of
717 * This is unlike the other Path nodes in that it can actually generate
718 * different plans: either hash-based or sort-based implementation, or a
719 * no-op if the input path can be proven distinct already. The decision
720 * is sufficiently localized that it's not worth having separate Path node
721 * types. (Note: in the no-op case, we could eliminate the UniquePath node
722 * entirely and just return the subpath; but it's convenient to have a
723 * UniquePath in the path tree to signal upper-level routines that the input
724 * is known distinct.)
728 UNIQUE_PATH_NOOP, /* input is known unique already */
729 UNIQUE_PATH_HASH, /* use hashing */
730 UNIQUE_PATH_SORT /* use sorting */
733 typedef struct UniquePath
737 UniquePathMethod umethod;
738 double rows; /* estimated number of result tuples */
742 * All join-type paths share these fields.
745 typedef struct JoinPath
751 Path *outerjoinpath; /* path for the outer side of the join */
752 Path *innerjoinpath; /* path for the inner side of the join */
754 List *joinrestrictinfo; /* RestrictInfos to apply to join */
757 * See the notes for RelOptInfo to understand why joinrestrictinfo is
758 * needed in JoinPath, and can't be merged into the parent RelOptInfo.
763 * A nested-loop path needs no special fields.
766 typedef JoinPath NestPath;
769 * A mergejoin path has these fields.
771 * path_mergeclauses lists the clauses (in the form of RestrictInfos)
772 * that will be used in the merge.
774 * Note that the mergeclauses are a subset of the parent relation's
775 * restriction-clause list. Any join clauses that are not mergejoinable
776 * appear only in the parent's restrict list, and must be checked by a
777 * qpqual at execution time.
779 * outersortkeys (resp. innersortkeys) is NIL if the outer path
780 * (resp. inner path) is already ordered appropriately for the
781 * mergejoin. If it is not NIL then it is a PathKeys list describing
782 * the ordering that must be created by an explicit sort step.
785 typedef struct MergePath
788 List *path_mergeclauses; /* join clauses to be used for merge */
789 List *outersortkeys; /* keys for explicit sort, if any */
790 List *innersortkeys; /* keys for explicit sort, if any */
794 * A hashjoin path has these fields.
796 * The remarks above for mergeclauses apply for hashclauses as well.
798 * Hashjoin does not care what order its inputs appear in, so we have
799 * no need for sortkeys.
802 typedef struct HashPath
805 List *path_hashclauses; /* join clauses used for hashing */
809 * Restriction clause info.
811 * We create one of these for each AND sub-clause of a restriction condition
812 * (WHERE or JOIN/ON clause). Since the restriction clauses are logically
813 * ANDed, we can use any one of them or any subset of them to filter out
814 * tuples, without having to evaluate the rest. The RestrictInfo node itself
815 * stores data used by the optimizer while choosing the best query plan.
817 * If a restriction clause references a single base relation, it will appear
818 * in the baserestrictinfo list of the RelOptInfo for that base rel.
820 * If a restriction clause references more than one base rel, it will
821 * appear in the joininfo list of every RelOptInfo that describes a strict
822 * subset of the base rels mentioned in the clause. The joininfo lists are
823 * used to drive join tree building by selecting plausible join candidates.
824 * The clause cannot actually be applied until we have built a join rel
825 * containing all the base rels it references, however.
827 * When we construct a join rel that includes all the base rels referenced
828 * in a multi-relation restriction clause, we place that clause into the
829 * joinrestrictinfo lists of paths for the join rel, if neither left nor
830 * right sub-path includes all base rels referenced in the clause. The clause
831 * will be applied at that join level, and will not propagate any further up
832 * the join tree. (Note: the "predicate migration" code was once intended to
833 * push restriction clauses up and down the plan tree based on evaluation
834 * costs, but it's dead code and is unlikely to be resurrected in the
835 * foreseeable future.)
837 * Note that in the presence of more than two rels, a multi-rel restriction
838 * might reach different heights in the join tree depending on the join
839 * sequence we use. So, these clauses cannot be associated directly with
840 * the join RelOptInfo, but must be kept track of on a per-join-path basis.
842 * RestrictInfos that represent equivalence conditions (i.e., mergejoinable
843 * equalities that are not outerjoin-delayed) are handled a bit differently.
844 * Initially we attach them to the EquivalenceClasses that are derived from
845 * them. When we construct a scan or join path, we look through all the
846 * EquivalenceClasses and generate derived RestrictInfos representing the
847 * minimal set of conditions that need to be checked for this particular scan
848 * or join to enforce that all members of each EquivalenceClass are in fact
849 * equal in all rows emitted by the scan or join.
851 * When dealing with outer joins we have to be very careful about pushing qual
852 * clauses up and down the tree. An outer join's own JOIN/ON conditions must
853 * be evaluated exactly at that join node, and any quals appearing in WHERE or
854 * in a JOIN above the outer join cannot be pushed down below the outer join.
855 * Otherwise the outer join will produce wrong results because it will see the
856 * wrong sets of input rows. All quals are stored as RestrictInfo nodes
857 * during planning, but there's a flag to indicate whether a qual has been
858 * pushed down to a lower level than its original syntactic placement in the
859 * join tree would suggest. If an outer join prevents us from pushing a qual
860 * down to its "natural" semantic level (the level associated with just the
861 * base rels used in the qual) then we mark the qual with a "required_relids"
862 * value including more than just the base rels it actually uses. By
863 * pretending that the qual references all the rels appearing in the outer
864 * join, we prevent it from being evaluated below the outer join's joinrel.
865 * When we do form the outer join's joinrel, we still need to distinguish
866 * those quals that are actually in that join's JOIN/ON condition from those
867 * that appeared elsewhere in the tree and were pushed down to the join rel
868 * because they used no other rels. That's what the is_pushed_down flag is
869 * for; it tells us that a qual is not an OUTER JOIN qual for the set of base
870 * rels listed in required_relids. A clause that originally came from WHERE
871 * or an INNER JOIN condition will *always* have its is_pushed_down flag set.
872 * It's possible for an OUTER JOIN clause to be marked is_pushed_down too,
873 * if we decide that it can be pushed down into the nullable side of the join.
874 * In that case it acts as a plain filter qual for wherever it gets evaluated.
876 * When application of a qual must be delayed by outer join, we also mark it
877 * with outerjoin_delayed = true. This isn't redundant with required_relids
878 * because that might equal clause_relids whether or not it's an outer-join
881 * In general, the referenced clause might be arbitrarily complex. The
882 * kinds of clauses we can handle as indexscan quals, mergejoin clauses,
883 * or hashjoin clauses are limited (e.g., no volatile functions). The code
884 * for each kind of path is responsible for identifying the restrict clauses
885 * it can use and ignoring the rest. Clauses not implemented by an indexscan,
886 * mergejoin, or hashjoin will be placed in the plan qual or joinqual field
887 * of the finished Plan node, where they will be enforced by general-purpose
888 * qual-expression-evaluation code. (But we are still entitled to count
889 * their selectivity when estimating the result tuple count, if we
890 * can guess what it is...)
892 * When the referenced clause is an OR clause, we generate a modified copy
893 * in which additional RestrictInfo nodes are inserted below the top-level
894 * OR/AND structure. This is a convenience for OR indexscan processing:
895 * indexquals taken from either the top level or an OR subclause will have
896 * associated RestrictInfo nodes.
898 * The can_join flag is set true if the clause looks potentially useful as
899 * a merge or hash join clause, that is if it is a binary opclause with
900 * nonoverlapping sets of relids referenced in the left and right sides.
901 * (Whether the operator is actually merge or hash joinable isn't checked,
904 * The pseudoconstant flag is set true if the clause contains no Vars of
905 * the current query level and no volatile functions. Such a clause can be
906 * pulled out and used as a one-time qual in a gating Result node. We keep
907 * pseudoconstant clauses in the same lists as other RestrictInfos so that
908 * the regular clause-pushing machinery can assign them to the correct join
909 * level, but they need to be treated specially for cost and selectivity
910 * estimates. Note that a pseudoconstant clause can never be an indexqual
911 * or merge or hash join clause, so it's of no interest to large parts of
914 * When join clauses are generated from EquivalenceClasses, there may be
915 * several equally valid ways to enforce join equivalence, of which we need
916 * apply only one. We mark clauses of this kind by setting parent_ec to
917 * point to the generating EquivalenceClass. Multiple clauses with the same
918 * parent_ec in the same join are redundant.
921 typedef struct RestrictInfo
925 Expr *clause; /* the represented clause of WHERE or JOIN */
927 bool is_pushed_down; /* TRUE if clause was pushed down in level */
929 bool outerjoin_delayed; /* TRUE if delayed by outer join */
931 bool can_join; /* see comment above */
933 bool pseudoconstant; /* see comment above */
935 /* The set of relids (varnos) actually referenced in the clause: */
936 Relids clause_relids;
938 /* The set of relids required to evaluate the clause: */
939 Relids required_relids;
941 /* These fields are set for any binary opclause: */
942 Relids left_relids; /* relids in left side of clause */
943 Relids right_relids; /* relids in right side of clause */
945 /* This field is NULL unless clause is an OR clause: */
946 Expr *orclause; /* modified clause with RestrictInfos */
948 /* This field is NULL unless clause is potentially redundant: */
949 EquivalenceClass *parent_ec; /* generating EquivalenceClass */
951 /* cache space for cost and selectivity */
952 QualCost eval_cost; /* eval cost of clause; -1 if not yet set */
953 Selectivity this_selec; /* selectivity; -1 if not yet set */
955 /* valid if clause is mergejoinable, else NIL */
956 List *mergeopfamilies; /* opfamilies containing clause operator */
958 /* cache space for mergeclause processing; NULL if not yet set */
959 EquivalenceClass *left_ec; /* EquivalenceClass containing lefthand */
960 EquivalenceClass *right_ec; /* EquivalenceClass containing righthand */
961 EquivalenceMember *left_em; /* EquivalenceMember for lefthand */
962 EquivalenceMember *right_em; /* EquivalenceMember for righthand */
963 List *scansel_cache; /* list of MergeScanSelCache structs */
965 /* transient workspace for use while considering a specific join path */
966 bool outer_is_left; /* T = outer var on left, F = on right */
968 /* valid if clause is hashjoinable, else InvalidOid: */
969 Oid hashjoinoperator; /* copy of clause operator */
971 /* cache space for hashclause processing; -1 if not yet set */
972 Selectivity left_bucketsize; /* avg bucketsize of left side */
973 Selectivity right_bucketsize; /* avg bucketsize of right side */
977 * Since mergejoinscansel() is a relatively expensive function, and would
978 * otherwise be invoked many times while planning a large join tree,
979 * we go out of our way to cache its results. Each mergejoinable
980 * RestrictInfo carries a list of the specific sort orderings that have
981 * been considered for use with it, and the resulting selectivities.
983 typedef struct MergeScanSelCache
985 /* Ordering details (cache lookup key) */
986 Oid opfamily; /* btree opfamily defining the ordering */
987 int strategy; /* sort direction (ASC or DESC) */
988 bool nulls_first; /* do NULLs come before normal values? */
990 Selectivity leftscansel; /* scan fraction for clause left side */
991 Selectivity rightscansel; /* scan fraction for clause right side */
995 * Inner indexscan info.
997 * An inner indexscan is one that uses one or more joinclauses as index
998 * conditions (perhaps in addition to plain restriction clauses). So it
999 * can only be used as the inner path of a nestloop join where the outer
1000 * relation includes all other relids appearing in those joinclauses.
1001 * The set of usable joinclauses, and thus the best inner indexscan,
1002 * thus varies depending on which outer relation we consider; so we have
1003 * to recompute the best such paths for every join. To avoid lots of
1004 * redundant computation, we cache the results of such searches. For
1005 * each relation we compute the set of possible otherrelids (all relids
1006 * appearing in joinquals that could become indexquals for this table).
1007 * Two outer relations whose relids have the same intersection with this
1008 * set will have the same set of available joinclauses and thus the same
1009 * best inner indexscans for the inner relation. By taking the intersection
1010 * before scanning the cache, we avoid recomputing when considering
1011 * join rels that differ only by the inclusion of irrelevant other rels.
1013 * The search key also includes a bool showing whether the join being
1014 * considered is an outer join. Since we constrain the join order for
1015 * outer joins, I believe that this bool can only have one possible value
1016 * for any particular lookup key; but store it anyway to avoid confusion.
1019 typedef struct InnerIndexscanInfo
1022 /* The lookup key: */
1023 Relids other_relids; /* a set of relevant other relids */
1024 bool isouterjoin; /* true if join is outer */
1025 /* Best paths for this lookup key (NULL if no available indexscans): */
1026 Path *cheapest_startup_innerpath; /* cheapest startup cost */
1027 Path *cheapest_total_innerpath; /* cheapest total cost */
1028 } InnerIndexscanInfo;
1033 * One-sided outer joins constrain the order of joining partially but not
1034 * completely. We flatten such joins into the planner's top-level list of
1035 * relations to join, but record information about each outer join in an
1036 * OuterJoinInfo struct. These structs are kept in the PlannerInfo node's
1039 * min_lefthand and min_righthand are the sets of base relids that must be
1040 * available on each side when performing the outer join. lhs_strict is
1041 * true if the outer join's condition cannot succeed when the LHS variables
1042 * are all NULL (this means that the outer join can commute with upper-level
1043 * outer joins even if it appears in their RHS). We don't bother to set
1044 * lhs_strict for FULL JOINs, however.
1046 * It is not valid for either min_lefthand or min_righthand to be empty sets;
1047 * if they were, this would break the logic that enforces join order.
1049 * syn_lefthand and syn_righthand are the sets of base relids that are
1050 * syntactically below this outer join. (These are needed to help compute
1051 * min_lefthand and min_righthand for higher joins, but are not used
1054 * delay_upper_joins is set TRUE if we detect a pushed-down clause that has
1055 * to be evaluated after this join is formed (because it references the RHS).
1056 * Any outer joins that have such a clause and this join in their RHS cannot
1057 * commute with this join, because that would leave noplace to check the
1058 * pushed-down clause. (We don't track this for FULL JOINs, either.)
1060 * Note: OuterJoinInfo directly represents only LEFT JOIN and FULL JOIN;
1061 * RIGHT JOIN is handled by switching the inputs to make it a LEFT JOIN.
1062 * We make an OuterJoinInfo for FULL JOINs even though there is no flexibility
1063 * of planning for them, because this simplifies make_join_rel()'s API.
1066 typedef struct OuterJoinInfo
1069 Relids min_lefthand; /* base relids in minimum LHS for join */
1070 Relids min_righthand; /* base relids in minimum RHS for join */
1071 Relids syn_lefthand; /* base relids syntactically within LHS */
1072 Relids syn_righthand; /* base relids syntactically within RHS */
1073 bool is_full_join; /* it's a FULL OUTER JOIN */
1074 bool lhs_strict; /* joinclause is strict for some LHS rel */
1075 bool delay_upper_joins; /* can't commute with upper RHS */
1081 * When we convert top-level IN quals into join operations, we must restrict
1082 * the order of joining and use special join methods at some join points.
1083 * We record information about each such IN clause in an InClauseInfo struct.
1084 * These structs are kept in the PlannerInfo node's in_info_list.
1086 * Note: sub_targetlist is just a list of Vars or expressions; it does not
1087 * contain TargetEntry nodes.
1090 typedef struct InClauseInfo
1093 Relids lefthand; /* base relids in lefthand expressions */
1094 Relids righthand; /* base relids coming from the subselect */
1095 List *sub_targetlist; /* targetlist of original RHS subquery */
1096 List *in_operators; /* OIDs of the IN's equality operator(s) */
1100 * Append-relation info.
1102 * When we expand an inheritable table or a UNION-ALL subselect into an
1103 * "append relation" (essentially, a list of child RTEs), we build an
1104 * AppendRelInfo for each child RTE. The list of AppendRelInfos indicates
1105 * which child RTEs must be included when expanding the parent, and each
1106 * node carries information needed to translate Vars referencing the parent
1107 * into Vars referencing that child.
1109 * These structs are kept in the PlannerInfo node's append_rel_list.
1110 * Note that we just throw all the structs into one list, and scan the
1111 * whole list when desiring to expand any one parent. We could have used
1112 * a more complex data structure (eg, one list per parent), but this would
1113 * be harder to update during operations such as pulling up subqueries,
1114 * and not really any easier to scan. Considering that typical queries
1115 * will not have many different append parents, it doesn't seem worthwhile
1116 * to complicate things.
1118 * Note: after completion of the planner prep phase, any given RTE is an
1119 * append parent having entries in append_rel_list if and only if its
1120 * "inh" flag is set. We clear "inh" for plain tables that turn out not
1121 * to have inheritance children, and (in an abuse of the original meaning
1122 * of the flag) we set "inh" for subquery RTEs that turn out to be
1123 * flattenable UNION ALL queries. This lets us avoid useless searches
1124 * of append_rel_list.
1126 * Note: the data structure assumes that append-rel members are single
1127 * baserels. This is OK for inheritance, but it prevents us from pulling
1128 * up a UNION ALL member subquery if it contains a join. While that could
1129 * be fixed with a more complex data structure, at present there's not much
1130 * point because no improvement in the plan could result.
1133 typedef struct AppendRelInfo
1138 * These fields uniquely identify this append relationship. There can be
1139 * (in fact, always should be) multiple AppendRelInfos for the same
1140 * parent_relid, but never more than one per child_relid, since a given
1141 * RTE cannot be a child of more than one append parent.
1143 Index parent_relid; /* RT index of append parent rel */
1144 Index child_relid; /* RT index of append child rel */
1147 * For an inheritance appendrel, the parent and child are both regular
1148 * relations, and we store their rowtype OIDs here for use in translating
1149 * whole-row Vars. For a UNION-ALL appendrel, the parent and child are
1150 * both subqueries with no named rowtype, and we store InvalidOid here.
1152 Oid parent_reltype; /* OID of parent's composite type */
1153 Oid child_reltype; /* OID of child's composite type */
1156 * The N'th element of this list is the integer column number of the child
1157 * column corresponding to the N'th column of the parent. A list element
1158 * is zero if it corresponds to a dropped column of the parent (this is
1159 * only possible for inheritance cases, not UNION ALL).
1161 List *col_mappings; /* list of child attribute numbers */
1164 * The N'th element of this list is a Var or expression representing the
1165 * child column corresponding to the N'th column of the parent. This is
1166 * used to translate Vars referencing the parent rel into references to
1167 * the child. A list element is NULL if it corresponds to a dropped
1168 * column of the parent (this is only possible for inheritance cases, not
1171 * This might seem redundant with the col_mappings data, but it is handy
1172 * because flattening of sub-SELECTs that are members of a UNION ALL will
1173 * cause changes in the expressions that need to be substituted for a
1174 * parent Var. Adjusting this data structure lets us track what really
1175 * needs to be substituted.
1177 * Notice we only store entries for user columns (attno > 0). Whole-row
1178 * Vars are special-cased, and system columns (attno < 0) need no special
1179 * translation since their attnos are the same for all tables.
1181 * Caution: the Vars have varlevelsup = 0. Be careful to adjust as needed
1182 * when copying into a subquery.
1184 List *translated_vars; /* Expressions in the child's Vars */
1187 * We store the parent table's OID here for inheritance, or InvalidOid for
1188 * UNION ALL. This is only needed to help in generating error messages if
1189 * an attempt is made to reference a dropped parent column.
1191 Oid parent_reloid; /* OID of parent relation */
1195 * glob->paramlist keeps track of the PARAM_EXEC slots that we have decided
1196 * we need for the query. At runtime these slots are used to pass values
1197 * either down into subqueries (for outer references in subqueries) or up out
1198 * of subqueries (for the results of a subplan). The n'th entry in the list
1199 * (n counts from 0) corresponds to Param->paramid = n.
1201 * Each paramlist item shows the absolute query level it is associated with,
1202 * where the outermost query is level 1 and nested subqueries have higher
1203 * numbers. The item the parameter slot represents can be one of three kinds:
1205 * A Var: the slot represents a variable of that level that must be passed
1206 * down because subqueries have outer references to it. The varlevelsup
1207 * value in the Var will always be zero.
1209 * An Aggref (with an expression tree representing its argument): the slot
1210 * represents an aggregate expression that is an outer reference for some
1211 * subquery. The Aggref itself has agglevelsup = 0, and its argument tree
1212 * is adjusted to match in level.
1214 * A Param: the slot holds the result of a subplan (it is a setParam item
1215 * for that subplan). The absolute level shown for such items corresponds
1216 * to the parent query of the subplan.
1218 * Note: we detect duplicate Var parameters and coalesce them into one slot,
1219 * but we do not do this for Aggref or Param slots.
1221 typedef struct PlannerParamItem
1225 Node *item; /* the Var, Aggref, or Param */
1226 Index abslevel; /* its absolute query level */
1229 #endif /* RELATION_H */