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).
Linear Supertypes
CartesianRDD[UnsafeRow, UnsafeRow], RDD[(UnsafeRow, UnsafeRow)], Logging, Serializable, Serializable, AnyRef, Any
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).