Struct LeapfrogJoinOperator 

pub struct LeapfrogJoinOperator { /* private fields */ }

Leapfrog TrieJoin operator for worst-case optimal multi-way joins.

Uses the leapfrog algorithm to efficiently find intersections across multiple sorted inputs without materializing intermediate Cartesian products.

Implementations

impl LeapfrogJoinOperator

pub fn new( inputs: Vec<Box<dyn Operator>>, join_key_indices: Vec<Vec<usize>>, output_schema: Vec<LogicalType>, output_column_mapping: Vec<(usize, usize)>, ) -> Self

Creates a new leapfrog join operator.

Arguments

• inputs - Input operators (one per relation).
• join_key_indices - Column indices for join keys in each input.
• output_schema - Schema of the output columns.
• output_column_mapping - Maps output columns to (input_idx, column_idx).

Trait Implementations

impl Operator for LeapfrogJoinOperator

fn next(&mut self) -> OperatorResult

Pulls the next batch of data. Returns None when exhausted.

fn reset(&mut self)

Resets to initial state so you can iterate again.

fn name(&self) -> &'static str

Returns a name for debugging/explain output.