JoinAlgorithm.PairwiseHash

JoinAlgorithm.PairwiseHash (1) is an enumeration that specifies the join algorithm to be used in the join operation. It is a member of the JoinAlgorithm.Type and indicates that the algorithm buffers the rows of both the left and right tables until one of the tables is completely buffered, and then performs a LeftHash or RightHash, depending on which table was buffered completely. This algorithm is recommended only for small tables.

Examples

The PairwiseHash join algorithm is recommended only for small tables. The following code buffers both Table1 and Table2 in memory until one of them is completely buffered. It then performs either a Left- or RightHash.

= Table.Join(
     Table1,  
     {"A1"}, 
     Table2, 
     {"A2"},
     JoinKind.Inner, 
     JoinAlgorithm.PairwiseHash // performs a join with the PairwiseHash algorithm
)

Related enumerations

Other related enumerations are:

• JoinAlgorithm.Dynamic
• JoinAlgorithm.LeftHash
• JoinAlgorithm.LeftIndex
• JoinAlgorithm.RightHash
• JoinAlgorithm.RightIndex
• JoinAlgorithm.SortMerge

Applies to

Here’s a list of functions that work with JoinAlgorithm.Type:

• Table.Join

Contribute » | Contributors: Rick de Groot