Loading...

XML

Word

Printable

JSON

One way to do this is to use random costing.

Once we do this, then we can remove the random re-orderer altogether. This should also mean we can enumerate random plans of certain shapes.

As part of this work, we may want to refer to the query knob which limits join algorithms considered in the bottom-up enumerator.

depends on

SERVER-113980 Create query-knob for picking between join ordering tree shapes

related to

SERVER-120346 Base collection fields discarded when right subtree only has embedded fields

SERVER-120666 Investigate why null semantics are incorrect for implicit cycle test case

SERVER-120558 Decide if we should bail or uassert when join enumerator fails

SERVER-120187 Add query knob to force specific join algorithm

SERVER-119870 Add "wildcard" hints to plan enumerator

(1 related to)

Needs Merge

Alya Berciu