JoinAlgorithm.RightHash

JoinAlgorithm.RightHash (4) 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 right rows into a lookup table and streams the left rows. For each left row, the matching right rows are found via the buffered lookup table. This algorithm is recommended when the right table is small and most of the rows from the left table are expected to match a right row.

Examples

The RightHash join algorithm is recommended when Table2 is small and most rows from Table2 match rows in Table1.

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

Related enumerations

Other related enumerations are:

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

Applies to

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

• Table.Join

Contribute » | Contributors: Rick de Groot