Sign inSign in
ConceptSystems & CS

Late materialization

A strategy where only necessary join keys and record identifiers are passed between operators, fetching full attribute values only when required.
as Andy Pavlo defines itCarnegie Mellon UniversityThe wording closest to all 5 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.

Column stores2Query execution2Columnar storage1Database compression1Disk storage1Early materialization1Join1Pointer1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Andy Pavlo

    Carnegie Mellon University · Undergraduate

    Postponing decompression of compressed database values for as long as possible during query execution.
    • 47:30OLTP vs. OLAP Storage Models & Database Compression
    • 2:52Data Formats & Encoding Part 1
  • Jignesh Patel

    Carnegie Mellon University · Undergraduate

    Storing only the key and a pointer to the record in intermediate files during sorting passes to save space.
    • 23:14Sorting & Aggregation Algorithms
  • Matt Butrovich

    Carnegie Mellon University · Undergraduate

    Only copy the join keys along with the Record IDs of the matching tuples, deferring fetching full tuple data.

Lectures that assume it

1

Connections

9

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

3 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.