From 146d9a4719a815a0195da0c1a8df5b149241f9b5 Mon Sep 17 00:00:00 2001 From: Richard Guo Date: Mon, 17 Jul 2023 14:08:10 +0800 Subject: [PATCH v3 2/2] Revise how we sort partial paths in gather_grouping_paths --- src/backend/optimizer/plan/planner.c | 71 ++++++++----------- src/test/regress/expected/select_parallel.out | 16 +++++ src/test/regress/sql/select_parallel.sql | 4 ++ 3 files changed, 48 insertions(+), 43 deletions(-) diff --git a/src/backend/optimizer/plan/planner.c b/src/backend/optimizer/plan/planner.c index a882fe6d5b..c934a41953 100644 --- a/src/backend/optimizer/plan/planner.c +++ b/src/backend/optimizer/plan/planner.c @@ -7295,44 +7295,9 @@ gather_grouping_paths(PlannerInfo *root, RelOptInfo *rel) /* Try Gather for unordered paths and Gather Merge for ordered ones. */ generate_useful_gather_paths(root, rel, true); - /* Try cheapest partial path + explicit Sort + Gather Merge. */ cheapest_partial_path = linitial(rel->partial_pathlist); - if (!pathkeys_contained_in(root->group_pathkeys, - cheapest_partial_path->pathkeys)) - { - Path *path; - double total_groups; - - total_groups = - cheapest_partial_path->rows * cheapest_partial_path->parallel_workers; - path = (Path *) create_sort_path(root, rel, cheapest_partial_path, - root->group_pathkeys, - -1.0); - path = (Path *) - create_gather_merge_path(root, - rel, - path, - rel->reltarget, - root->group_pathkeys, - NULL, - &total_groups); - - add_path(rel, path); - } - /* - * Consider incremental sort on all partial paths, if enabled. - * - * We can also skip the entire loop when we only have a single-item - * group_pathkeys because then we can't possibly have a presorted prefix - * of the list without having the list be fully sorted. - * - * XXX Shouldn't this also consider the group-key-reordering? - */ - if (!enable_incremental_sort || list_length(root->group_pathkeys) == 1) - return; - - /* also consider incremental sort on partial paths, if enabled */ + /* XXX Shouldn't this also consider the group-key-reordering? */ foreach(lc, rel->partial_pathlist) { Path *path = (Path *) lfirst(lc); @@ -7347,15 +7312,35 @@ gather_grouping_paths(PlannerInfo *root, RelOptInfo *rel) if (is_sorted) continue; - if (presorted_keys == 0) + /* + * Try at least sorting the cheapest path and also try + * incrementally sorting any path which is partially sorted + * already (no need to deal with paths which have presorted + * keys when incremental sort is disabled unless it's the + * cheapest input path). + */ + if (path != cheapest_partial_path && + (presorted_keys == 0 || !enable_incremental_sort)) continue; - path = (Path *) create_incremental_sort_path(root, - rel, - path, - root->group_pathkeys, - presorted_keys, - -1.0); + total_groups = path->rows * path->parallel_workers; + + /* + * We've no need to consider both a sort and incremental sort. + * We'll just do a sort if there are no presorted keys and an + * incremental sort when there are presorted keys. + */ + if (presorted_keys == 0 || !enable_incremental_sort) + path = (Path *) create_sort_path(root, rel, path, + root->group_pathkeys, + -1.0); + else + path = (Path *) create_incremental_sort_path(root, + rel, + path, + root->group_pathkeys, + presorted_keys, + -1.0); path = (Path *) create_gather_merge_path(root, diff --git a/src/test/regress/expected/select_parallel.out b/src/test/regress/expected/select_parallel.out index d82a7799e6..5d1b8e05c9 100644 --- a/src/test/regress/expected/select_parallel.out +++ b/src/test/regress/expected/select_parallel.out @@ -970,6 +970,22 @@ select * from tenk1 where four = 2 order by four, hundred, parallel_safe_volatil reset min_parallel_index_scan_size; reset enable_seqscan; +-- gather merge atop sort of grouped rel's partial paths +explain (costs off) +select count(*) from tenk1 group by twenty, parallel_safe_volatile(two); + QUERY PLAN +-------------------------------------------------------------------- + Finalize GroupAggregate + Group Key: twenty, (parallel_safe_volatile(two)) + -> Gather Merge + Workers Planned: 4 + -> Sort + Sort Key: twenty, (parallel_safe_volatile(two)) + -> Partial HashAggregate + Group Key: twenty, parallel_safe_volatile(two) + -> Parallel Seq Scan on tenk1 +(9 rows) + SAVEPOINT settings; SET LOCAL debug_parallel_query = 1; explain (costs off) diff --git a/src/test/regress/sql/select_parallel.sql b/src/test/regress/sql/select_parallel.sql index 7cba6519cb..0f9e874ae9 100644 --- a/src/test/regress/sql/select_parallel.sql +++ b/src/test/regress/sql/select_parallel.sql @@ -360,6 +360,10 @@ select * from tenk1 where four = 2 order by four, hundred, parallel_safe_volatil reset min_parallel_index_scan_size; reset enable_seqscan; +-- gather merge atop sort of grouped rel's partial paths +explain (costs off) +select count(*) from tenk1 group by twenty, parallel_safe_volatile(two); + SAVEPOINT settings; SET LOCAL debug_parallel_query = 1; explain (costs off) -- 2.31.0