Sign inSign in
ConceptSystems & CS

Worst-case optimal join

A category of join algorithms whose worst-case execution time matches the worst-case size bound of the output.
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.

Binary join1Computational complexity1Database execution algorithms1Join ordering1Multi-way join1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    5

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

    Concepts4

    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.