Sign inSign in
ConceptSystems & CS

Greedy operator ordering

A heuristic that iteratively finds the connected pair of nodes with the minimum intermediate result size and merges them.
as Andy Pavlo defines itCarnegie Mellon University
Watch it explained

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

1
  • Andy Pavlo

    Carnegie Mellon University · Graduate

    • 41:50Join Ordering: Bottom-up

Connections

5

The lectures that define it or assume it, and the concepts next to it.

Concepts3

Lectures2

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.