Sign inSign in
ConceptSystems & CS

Predicate pushdown

Moving predicates down to the lowest possible point in the query plan, below join operators, to filter out data early.
as Andy Pavlo defines itCarnegie Mellon UniversityThe wording closest to all 4 definitions
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.

  • Jignesh Patel

    Carnegie Mellon University · Undergraduate

    A rule-based optimization technique that moves selection operations lower in the query tree to reduce the amount of data processed by subsequent operations.
    • 25:51Query Planning & Optimization
  • Andy Pavlo

    Carnegie Mellon University · Graduate

    • 20:14History of Query Optimizers ft. IBM System R
    • 50:56Modern OLAP Database Systems

Lectures that assume it

1

Connections

10

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.