Struct SortMergeJoin 

pub struct SortMergeJoin { /* private fields */ }

Sort-Merge Join executor.

Efficient for joining pre-sorted relations or when both inputs can be sorted efficiently.

Implementations

impl SortMergeJoin

pub fn new( left_key_index: usize, right_key_index: usize, is_outer_join: bool, ) -> Self

Creates a new sort-merge join executor.

pub fn inner(left_key_index: usize, right_key_index: usize) -> Self

Creates an inner sort-merge join.

pub fn left_outer(left_key_index: usize, right_key_index: usize) -> Self

Creates a left outer sort-merge join.

pub fn execute(&self, left: Relation, right: Relation) -> Relation

Executes the sort-merge join. Assumes both inputs are already sorted by their join keys.

pub fn execute_with_sort(&self, left: Relation, right: Relation) -> Relation

Executes the sort-merge join, sorting inputs first.