ConceptSystems & CS
Dynamic programming Hypergraph
An algorithm that models a query as a hypergraph to incrementally and exhaustively enumerate all possible join orders without cross products.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.