You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The rough draft idea is: if the computing engine(trino) can obtain the sorting information of the shard, the statistical information of the file is recorded in iceberg’s meta, and sort_order_id != 0 indicates that the file has been sorted. Then the steps of PartialSort or PartialTopN can be omitted, and in when reading data, the sorting operation in the shard can be avoided. I've got an initial plan and implemented some basic code.
The specific work can be decomposed into the following two tasks
The content you are editing has changed. Please copy your edits and refresh the page.
rice668
changed the title
Push down sortNode(partial) or topNNode(partial) to iceberg
[draft] Push down sortNode(partial) or topNNode(partial) to iceberg
Jul 22, 2023
rice668
changed the title
[draft] Push down sortNode(partial) or topNNode(partial) to iceberg
[draft and in progress] Push down sortNode(partial) or topNNode(partial) to iceberg
Jul 22, 2023
rice668
changed the title
[draft and in progress] Push down sortNode(partial) or topNNode(partial) to iceberg
[draft and in progress] Push down PartialTopNode to iceberg
Jul 24, 2023
rice668
changed the title
[draft and in progress] Push down PartialTopNode to iceberg
[draft and in progress] Push down PartialSort and PartialTopNode to iceberg
Jul 24, 2023
rice668
changed the title
[draft and in progress] Push down PartialSort and PartialTopNode to iceberg
[draft and in progress] Push down PartialSortNode and PartialTopNode to iceberg
Jul 24, 2023
rice668
changed the title
[draft and in progress] Push down PartialSortNode and PartialTopNode to iceberg
[in progress] Push down PartialSortNode and PartialTopNode to iceberg
Jul 24, 2023
rice668
changed the title
[in progress] Push down PartialSortNode and PartialTopNode to iceberg
Push down PartialSortNode and PartialTopNode to iceberg
Jul 24, 2023
The rough draft idea is: if the computing engine(trino) can obtain the sorting information of the shard, the statistical information of the file is recorded in iceberg’s meta, and
sort_order_id != 0
indicates that the file has been sorted. Then the steps ofPartialSort
orPartialTopN
can be omitted, and in when reading data, the sorting operation in the shard can be avoided. I've got an initial plan and implemented some basic code.The specific work can be decomposed into the following two tasks
Tasks
The text was updated successfully, but these errors were encountered: