If both tables are pre-sorted on the join columns the optimizer chooses a HASH join, which is faster and uses considerably fewer resources.A.TrueB.False

Answer

The statement is B. False.

In a database context, if both tables are pre-sorted on the join columns, the optimizer is more likely to choose a Merge Join rather than a Hash Join. A Merge Join is efficient when the input data is already sorted, as it allows the operation to be performed in a single pass through each table. In contrast, a Hash Join is typically used when the data is not sorted and involves building a hash table for one of the tables, which can be resource-intensive.

Thus, the presence of pre-sorted data suggests a more efficient Merge Join over a Hash Join, making the initial statement inaccurate.