You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@flink.apache.org by "dalongliu (Jira)" <ji...@apache.org> on 2022/10/09 02:28:00 UTC

[jira] [Updated] (FLINK-29551) Improving adaptive hash join by using sort merge join strategy per partition instead of all partitions

     [ https://issues.apache.org/jira/browse/FLINK-29551?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

dalongliu updated FLINK-29551:
------------------------------
    Description: Currently, regarding adaptive hash join, when falling back to sort-merge join, it sorts all partitions globally, however, due to the keys of each partition are disjoint, we can sort it per partition, which can improve the performance.  (was: Currently, Regarding adaptive hash join, when falling back to sort-merge join, it sorts all partitions globally, however, due to the keys of each partition are disjoint, we can sort it per partition, which can improve the performance.)

> Improving adaptive hash join by using sort merge join strategy per partition instead of all partitions 
> -------------------------------------------------------------------------------------------------------
>
>                 Key: FLINK-29551
>                 URL: https://issues.apache.org/jira/browse/FLINK-29551
>             Project: Flink
>          Issue Type: Improvement
>          Components: Table SQL / Runtime
>    Affects Versions: 1.16.0
>            Reporter: dalongliu
>            Priority: Major
>             Fix For: 1.17.0
>
>
> Currently, regarding adaptive hash join, when falling back to sort-merge join, it sorts all partitions globally, however, due to the keys of each partition are disjoint, we can sort it per partition, which can improve the performance.



--
This message was sent by Atlassian Jira
(v8.20.10#820010)