Sign inSign in
ConceptSystems & CS

Hash join

A relational operator with three phases (Partition, Build, and Probe) used to join two relations based on a join key.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Matt Butrovich

    Carnegie Mellon University · Undergraduate

    A join algorithm that builds a hash table from one relation during a build phase and then probes that hash table using the second relation during a probe phase.

Lectures that assume it

6

Connections

16

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

2 lecturers. 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.