Sign inSign in
ConceptSystems & CS

Leapfrog trie join

A multi-way join algorithm that assumes relations are indexed or sorted on join keys and represents relations with multiple attributes as tries.
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.

Sorted data structures1Trie1Worst-case optimal join1

Lecturers

1

    Connections

    3

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

    Concepts2

    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.