pub type PbHashJoinNode = HashJoinNode;
Expand description
Alias for HashJoinNode
.
Aliased Type§
struct PbHashJoinNode {Show 14 fields
pub join_type: i32,
pub left_key: Vec<i32>,
pub right_key: Vec<i32>,
pub condition: Option<ExprNode>,
pub inequality_pairs: Vec<InequalityPair>,
pub left_table: Option<Table>,
pub right_table: Option<Table>,
pub left_degree_table: Option<Table>,
pub right_degree_table: Option<Table>,
pub output_indices: Vec<u32>,
pub left_deduped_input_pk_indices: Vec<u32>,
pub right_deduped_input_pk_indices: Vec<u32>,
pub null_safe: Vec<bool>,
pub is_append_only: bool,
}
Fields§
§join_type: i32
§left_key: Vec<i32>
§right_key: Vec<i32>
§condition: Option<ExprNode>
§inequality_pairs: Vec<InequalityPair>
§left_table: Option<Table>
Used for internal table states.
right_table: Option<Table>
Used for internal table states.
left_degree_table: Option<Table>
Used for internal table states.
right_degree_table: Option<Table>
Used for internal table states.
output_indices: Vec<u32>
The output indices of current node
left_deduped_input_pk_indices: Vec<u32>
Left deduped input pk indices. The pk of the left_table and left_degree_table is [left_join_key | left_deduped_input_pk_indices] and is expected to be the shortest key which starts with the join key and satisfies unique constrain.
right_deduped_input_pk_indices: Vec<u32>
Right deduped input pk indices. The pk of the right_table and right_degree_table is [right_join_key | right_deduped_input_pk_indices] and is expected to be the shortest key which starts with the join key and satisfies unique constrain.
null_safe: Vec<bool>
§is_append_only: bool
Whether to optimize for append only stream. It is true when the input is append-only