diff options
| author | Robert Haas | 2017-03-22 18:42:03 +0000 |
|---|---|---|
| committer | Robert Haas | 2017-03-22 18:45:14 +0000 |
| commit | dc02c7bca4dccf7de278cdc6b3325a829e75b252 (patch) | |
| tree | 27944d3e204c2ef613c1a9e7e2b40d5424118d07 /src/backend/optimizer | |
| parent | 6b76f1bb58f53aec25cfec76391270ea36ad1170 (diff) | |
Fix wrong costing of Sort under Gather Merge.
There's no mechanism for such a sort to become a top-N sort, so we
should pass -1 rather than limit_tuples to cost_sort().
Rushabh Lathia, per a report from Mithun Cy
Discussion: http://postgr.es/m/CAGPqQf1akRcSgC9=6iwx=sEPap9UvPpHJLzg8_N+OuHdb6fL+g@mail.gmail.com
Diffstat (limited to 'src/backend/optimizer')
| -rw-r--r-- | src/backend/optimizer/plan/planner.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/backend/optimizer/plan/planner.c b/src/backend/optimizer/plan/planner.c index cbdea1f537..68d74cb432 100644 --- a/src/backend/optimizer/plan/planner.c +++ b/src/backend/optimizer/plan/planner.c @@ -4416,7 +4416,7 @@ create_ordered_paths(PlannerInfo *root, ordered_rel, cheapest_partial_path, root->sort_pathkeys, - limit_tuples); + -1.0); total_groups = cheapest_partial_path->rows * cheapest_partial_path->parallel_workers; |