[Enhancement] Add DrivingTableSelectionRule

[KKould]

Why I'm doing:

#52399

support similar to #55376: If the table and driving table are only in an OR relationship, cross join is converted to union all

What I'm doing:

DrivingTableSelectionRule is used to adjust the position of the driving table according to the on predicate of the inner join when multiple tables are cross joined and the root is an inner join. Reduce the overhead caused by Join in this case

mysql> explain logical select *  from T where T.a = (select a from T0) and T.b = (select b from T1) or T.c = (select c from T2);
+-------------------------------------------------------------------------------------------------------------+
| Explain String                                                                                              |
+-------------------------------------------------------------------------------------------------------------+
| - Output => [1:a, 2:b, 3:c]                                                                                 |
|     - NESTLOOP/INNER JOIN [1:a = 4:a AND 2:b = 9:b OR 3:c = 14:c] => [1:a, 2:b, 3:c]                        |
|             Estimates: {row: 6, cpu: 1728.00, memory: 7200.00, network: 0.00, cost: 16017132.00}            |
|         - UNION => [4: a, 9: b, 14: c]                                                                      |
|                 Estimates: {row: 2, cpu: ?, memory: ?, network: ?, cost: 1.6001706E7}                       |
|             - NESTLOOP/CROSS JOIN => [4:a, 9:b, 14:c]                                                       |
|                     Estimates: {row: 1, cpu: 32000000.00, memory: 800.00, network: 0.00, cost: 16001676.00} |
|                     14:c := null                                                                            |
|                 - ASSERT LE 1                                                                               |
|                         Estimates: {row: 1, cpu: ?, memory: ?, network: ?, cost: 30.0}                      |
|                     - EXCHANGE(GATHER)                                                                      |
|                             Estimates: {row: 3, cpu: ?, memory: ?, network: ?, cost: 30.0}                  |
|                         - SCAN [T0] => [4:a]                                                                |
|                                 Estimates: {row: 3, cpu: ?, memory: ?, network: ?, cost: 6.0}               |
|                                 partitionRatio: 1/1, tabletRatio: 1/1                                       |
|                 - EXCHANGE(BROADCAST)                                                                       |
|                         Estimates: {row: 1, cpu: ?, memory: ?, network: ?, cost: 46.0}                      |
|                     - ASSERT LE 1                                                                           |
|                             Estimates: {row: 1, cpu: ?, memory: ?, network: ?, cost: 30.0}                  |
|                         - EXCHANGE(GATHER)                                                                  |
|                                 Estimates: {row: 3, cpu: ?, memory: ?, network: ?, cost: 30.0}              |
|                             - SCAN [T1] => [9:b]                                                            |
|                                     Estimates: {row: 3, cpu: ?, memory: ?, network: ?, cost: 6.0}           |
|                                     partitionRatio: 1/1, tabletRatio: 1/1                                   |
|             - ASSERT LE 1                                                                                   |
|                     Estimates: {row: 1, cpu: 0.00, memory: 0.00, network: 0.00, cost: 30.00}                |
|                     4:a := null                                                                             |
|                     9:b := null                                                                             |
|                 - EXCHANGE(GATHER)                                                                          |
|                         Estimates: {row: 3, cpu: ?, memory: ?, network: ?, cost: 30.0}                      |
|                     - SCAN [T2] => [14:c]                                                                   |
|                             Estimates: {row: 3, cpu: ?, memory: ?, network: ?, cost: 6.0}                   |
|                             partitionRatio: 1/1, tabletRatio: 1/1                                           |
|         - EXCHANGE(BROADCAST)                                                                               |
|                 Estimates: {row: 3, cpu: ?, memory: ?, network: ?, cost: 162.0}                             |
|             - SCAN [T] => [1:a, 2:b, 3:c]                                                                   |
|                     Estimates: {row: 3, cpu: ?, memory: ?, network: ?, cost: 18.0}                          |
|                     partitionRatio: 1/1, tabletRatio: 1/1                                                   |
+-------------------------------------------------------------------------------------------------------------+

Implementation idea:

Analyze the corresponding relationship between the tables of the two columns in the BinaryPredicateOperator through the on predicate of the inner join, and establish an undirected graph. When all edges only have the same table as the endpoint, the table is a driving table, which is the top layer of the inner join table to replace(if the replaced node is not the driving table)

What type of PR is this:

• BugFix
• Feature
• Enhancement
• Refactor
• UT
• Doc
• Tool

Does this PR entail a change in behavior?

• Yes, this PR will result in a change in behavior.
• No, this PR will not result in a change in behavior.

If yes, please specify the type of change:

• Interface/UI changes: syntax, type conversion, expression evaluation, display information
• Parameter changes: default values, similar parameters but with different default values
• Policy changes: use new policy to replace old one, functionality automatically enabled
• Feature removed
• Miscellaneous: upgrade & downgrade compatibility, etc.

Checklist:

• I have added test cases for my bug fix or my new feature
• This pr needs user documentation (for new or modified features or behaviors)
  • I have added documentation for my new feature or new function
• This is a backport pr

Bugfix cherry-pick branch check:

• I have checked the version labels which the pr will be auto-backported to the target branch
  • 3.4
  • 3.3
  • 3.2
  • 3.1
  • 3.0

[LiShuMing]

well done, can you rebase again?

[LiShuMing]

1. it's better to not explain this directly, you can refer assert_explain_contains in sql-tests

function: assert_explain_contains('SELECT COUNT(*) FROM partitions_multi_column_1 WHERE c1=1 AND TRUE', 'partitions=1/3')

2. it's better to add some specific data and check rewrite result fine.

[kangkaisen]

If you only want to test the explain, you could add test cases in the FE code like PlanFragmentWithCostTest. which will be easier to debug and test.

[KKould]

Thank you, but I think it is better not to explain in this e2e test (fe ut has been verified)

[sonarqubecloud]

Quality Gate passed

Issues
6 New issues
0 Accepted issues

Measures
0 Security Hotspots
0.0% Coverage on New Code
0.0% Duplication on New Code

See analysis details on SonarQube Cloud

[KKould]

I tried to run the failed unit test in CI locally but it passed locally. Do you have any solution?

[before-Sunrise]

I tried to run the failed unit test in CI locally but it passed locally. Do you have any solution?

this test case is not stable, i already rerun this pr's ci

[github-actions]

[Java-Extensions Incremental Coverage Report]

✅ pass : 0 / 0 (0%)

[github-actions]

[FE Incremental Coverage Report]

✅ pass : 179 / 195 (91.79%)

file detail

	path	covered_line	new_line	coverage	not_covered_line_detail
🔵	com/starrocks/sql/optimizer/rule/transformation/DrivingTableSelection.java	177	193	91.71%	[122, 132, 139, 159, 162, 181, 185, 194, 279, 300, 301, 303, 318, 339, 357, 358]
🔵	com/starrocks/sql/optimizer/QueryOptimizer.java	1	1	100.00%	[]
🔵	com/starrocks/sql/optimizer/rule/RuleType.java	1	1	100.00%	[]

[github-actions]

[BE Incremental Coverage Report]

✅ pass : 0 / 0 (0%)