Struct HashJoinNode 

pub struct HashJoinNode { /* private fields */ }

Hash join: builds a hash table from the build side, probes with the probe side.

Supports INNER, LEFT, RIGHT, and FULL [OUTER] joins.

HashJoin(build_key=users.id, probe_key=orders.user_id)
  ├── build: SeqScan(users)
  └── probe: SeqScan(orders)

Implementations

impl HashJoinNode

pub fn new( build: Box<dyn PlanNode>, probe: Box<dyn PlanNode>, build_key_expr: Expr, probe_key_expr: Expr, join_type: JoinType, ) -> Self

Trait Implementations

impl PlanNode for HashJoinNode

fn schema(&self) -> &Schema

Schema of rows produced by this node.

fn next(&mut self) -> Result<Option<Row>>

Return the next row, or None when exhausted.

fn reset(&mut self) -> Result<()>

Reset the operator for re-execution (e.g., inner side of nested loop join).

fn collect_all(&mut self) -> Result<Vec<Row>>

Collect all remaining rows (convenience method).