The direct join algorithm offers the fastest execution time and is applicable when the underlying storage for the right-hand side table supports low-latency key-value requests, and when LEFT ANY JOIN semantics is adequate. The hash join algorithm is fast but memory-bound, while the parallel hash join can be faster with large right-hand side tables but requires more memory. The full sorting merge join is a non-memory bound version that spills data temporarily to disk without requiring any sorting of the data, offering good control over memory usage vs. join speed. The partial merge join is optimized for minimizing memory usage when large tables are joined at the expense of join speed. The grace hash join offers flexible control of memory usage based on the configured amount of buckets and can be faster or slower than other non-memory bound algorithms depending on data volume, data types, and value distribution of the join key columns. The choice of join algorithm mainly depends on three factors: performance, memory, and join type support.