ConceptSystems & CS
Dynamic programming with Hypergraph algorithm
An algorithm that models the query graph as a hypergraph and incrementally expands subgraphs using rules for valid traversal to enumerate join orderings.
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
4The lectures that define it or assume it, and the concepts next to it.