Sign inSign in
ConceptSystems & CS

Iterator model

A query processing model where each operator implements a Next function that returns either a single tuple or an end-of-file marker.
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.

Processing model2Query plan2Basic C++ programming1Query execution trees1Relational algebra1Relational algebra operators1

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

    An execution model where each query plan operator implements a Next function that returns a single tuple or an end-of-file marker on each invocation.
    • 5:29Query Execution Part 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.