Merge Join
Both inputs are consumed in join-key order and merged in a single interleaved pass, which is efficient when the order is free — from an index or an already-sorted child — and supports inequality band joins. If the engine must add explicit sorts first, those sorts usually decide whether merge join beats hash join.
This Concept is waiting for its first lesson!
Both inputs are consumed in join-key order and merged in a single interleaved pass, which is efficient when the order is free — from an index or an already-sorted child — and supports inequality band joins. If the engine must add explicit sorts first, those sorts usually decide whether merge join beats hash join.
Are you a teacher? Sign in to start contributing.
Sign In