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.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.