Performs an inner hash join of two child relations.
Performs a hash join of two child relations by first shuffling the data using the join keys.
Performs a sort merge join of two child relations.
An optimized CartesianRDD for UnsafeRow, which will cache the rows from second child RDD, will be much faster than building the right partition for every row in left RDD, it also materialize the right RDD (in case of the right RDD is nondeterministic).
Physical execution operators for join operations.