WRITE_BITMAPSET_FIELD(right_relids);
WRITE_NODE_FIELD(orclause);
/* don't write parent_ec, leads to infinite recursion in plan tree dump */
+ WRITE_FLOAT_FIELD(this_selec, "%.4f");
WRITE_NODE_FIELD(mergeopfamilies);
/* don't write left_ec, leads to infinite recursion in plan tree dump */
/* don't write right_ec, leads to infinite recursion in plan tree dump */
return (Selectivity) 1.0;
}
+ /*
+ * If the clause is marked redundant, always return 1.0.
+ */
+ if (rinfo->this_selec > 1)
+ return (Selectivity) 1.0;
+
/*
* If possible, cache the result of the selectivity calculation for
* the clause. We can cache if varRelid is zero or the clause
list_delete_cell(root->left_join_clauses, cell, prev);
/* we throw it back anyway (see notes above) */
/* but the thrown-back clause has no extra selectivity */
- rinfo->this_selec = 1.0;
+ rinfo->this_selec = 2.0;
distribute_restrictinfo_to_rels(root, rinfo);
}
else
list_delete_cell(root->right_join_clauses, cell, prev);
/* we throw it back anyway (see notes above) */
/* but the thrown-back clause has no extra selectivity */
- rinfo->this_selec = 1.0;
+ rinfo->this_selec = 2.0;
distribute_restrictinfo_to_rels(root, rinfo);
}
else
list_delete_cell(root->full_join_clauses, cell, prev);
/* we throw it back anyway (see notes above) */
/* but the thrown-back clause has no extra selectivity */
- rinfo->this_selec = 1.0;
+ rinfo->this_selec = 2.0;
distribute_restrictinfo_to_rels(root, rinfo);
}
else
/* cache space for cost and selectivity */
QualCost eval_cost; /* eval cost of clause; -1 if not yet set */
- Selectivity this_selec; /* selectivity; -1 if not yet set */
+ Selectivity this_selec; /* selectivity; -1 if not yet set; >1 means
+ * a redundant clause */
/* valid if clause is mergejoinable, else NIL */
List *mergeopfamilies; /* opfamilies containing clause operator */