ConceptSystems & CS
Accumulated-cost bounding
Accumulated-cost bounding uses an upper bound of the best complete physical plan found so far and a lower bound formed by the summation of physical operators as the optimizer traverses down the search tree.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Branch-and-bound pruning1Branch-and-bound search1Physical plan1Query optimization1Query optimizer1Search tree1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
6The lectures that define it or assume it, and the concepts next to it.