NotificationsYou must be signed in to change notification settings
Fork28
Star153

Commit33a332b

committed

Relax some asserts in merge join costing code

In the planner, it was possible, given an extreme enough case containing alarge number of joins for the number of estimated rows to become infinite.This could cause problems in initial_cost_mergejoin() where we performsome calculations based on those row estimates.A problem case, presented by Onder Kalaci showed an Assert failure froman Assert checking outerstartsel <= outerendsel. In his test case thiswas effectively NaN <= Inf, which is false. The NaN outerstartsel camefrom multiplying the infinite outer_path_rows by 0.0.In master, this problem was fixed by a90c950fc, however, that fix was tooinvasive for the backbranches. Here we just relax the Asserts to allowthem to pass. The worst that appears to happen from this is that we showNaN cost values and infinite row estimates in EXPLAIN. add_path() wouldhave had a hard time doing anything useful with such costs, but that doesnot really matter as if the row estimates were even close to accurate,such plan would not complete this side of the heat death of the universe.Reported-by: Onder KalaciBackpatch: 9.5 to 13Discussion:https://postgr.es/m/DM6PR21MB1211FF360183BCA901B27F04D80B0@DM6PR21MB1211.namprd21.prod.outlook.com

1 parent99ae342 commit33a332bCopy full SHA for 33a332b

File tree

1 file changed

-4

lines changed

src/backend/optimizer/path
- costsize.c

1 file changed

-4

lines changed

`‎src/backend/optimizer/path/costsize.c‎`

Lines changed: 6 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -3040,8 +3040,9 @@ initial_cost_mergejoin(PlannerInfo root, JoinCostWorkspace workspace,`
`3040`	`3040`	`outer_rows=clamp_row_est(outer_path_rows*outerendsel);`
`3041`	`3041`	`inner_rows=clamp_row_est(inner_path_rows*innerendsel);`
`3042`	`3042`
`3043`		`-Assert(outer_skip_rows <=outer_rows);`
`3044`		`-Assert(inner_skip_rows <=inner_rows);`
	`3043`	`+/* skip rows can become NaN when path rows has become infinite */`
	`3044`	`+Assert(outer_skip_rows <=outer_rows\|\|isnan(outer_skip_rows));`
	`3045`	`+Assert(inner_skip_rows <=inner_rows\|\|isnan(inner_skip_rows));`
`3045`	`3046`
`3046`	`3047`	`/*`
`3047`	`3048`	`* Readjust scan selectivities to account for above rounding. This is`
`@@ -3053,8 +3054,9 @@ initial_cost_mergejoin(PlannerInfo root, JoinCostWorkspace workspace,`
`3053`	`3054`	`outerendsel=outer_rows /outer_path_rows;`
`3054`	`3055`	`innerendsel=inner_rows /inner_path_rows;`
`3055`	`3056`
`3056`		`-Assert(outerstartsel <=outerendsel);`
`3057`		`-Assert(innerstartsel <=innerendsel);`
	`3057`	`+/* start sel can become NaN when path rows has become infinite */`
	`3058`	`+Assert(outerstartsel <=outerendsel\|\|isnan(outerstartsel));`
	`3059`	`+Assert(innerstartsel <=innerendsel\|\|isnan(innerstartsel));`
`3058`	`3060`
`3059`	`3061`	`/* cost of source data */`
`3060`	`3062`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit33a332b

File tree

1 file changed

1 file changed

`‎src/backend/optimizer/path/costsize.c‎`

0 commit comments