Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

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

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitc6b3835

Browse files
committed
Limit the number of index clauses considered in choose_bitmap_and().
classify_index_clause_usage() is O(N^2) in the number of distinct indexqual clauses it considers, because of its use of a simple search list tostore them. For nearly all queries, that's fine because only a few clauseswill be considered. But Alexander Kuzmenkov reported a machine-generatedquery with 80000 (!) index qual clauses, which caused this code to takeforever. Somewhat remarkably, this is the only O(N^2) behavior we nowhave for such a query, so let's fix it.We can get rid of the O(N^2) runtime for cases like this without muchdamage to the functionality of choose_bitmap_and() by separating outpaths with "too many" qual or pred clauses, and deeming them to alwaysbe nonredundant with other paths. Then their clauses needn't go intothe search list, so it doesn't get too long, but we don't lose theability to consider bitmap AND plans altogether. I set the thresholdfor "too many" to be 100 clauses per path, which should be plenty toensure no change in planning behavior for normal queries.There are other things we could do to make this go faster, but it's notclear that it's worth any additional effort. 80000 qual clauses requirea whole lot of work in many other places, too.The code's been like this for a long time, so back-patch to all supportedbranches. The troublesome query only works back to 9.5 (in 9.4 it failswith stack overflow in the parser); so I'm not sure that fixing this in9.4 has any real-world benefit, but perhaps it does.Discussion:https://postgr.es/m/90c5bdfa-d633-dabe-9889-3cf3e1acd443@postgrespro.ru
1 parent346686f commitc6b3835

File tree

1 file changed

+31
-1
lines changed

1 file changed

+31
-1
lines changed

‎src/backend/optimizer/path/indxpath.c

Lines changed: 31 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -69,6 +69,7 @@ typedef struct
6969
List*quals;/* the WHERE clauses it uses */
7070
List*preds;/* predicates of its partial index(es) */
7171
Bitmapset*clauseids;/* quals+preds represented as a bitmapset */
72+
boolunclassifiable;/* has too many quals+preds to process? */
7273
}PathClauseUsage;
7374

7475
/* Callback argument for ec_member_matches_indexcol */
@@ -1449,9 +1450,18 @@ choose_bitmap_and(PlannerInfo *root, RelOptInfo *rel, List *paths)
14491450
Path*ipath= (Path*)lfirst(l);
14501451

14511452
pathinfo=classify_index_clause_usage(ipath,&clauselist);
1453+
1454+
/* If it's unclassifiable, treat it as distinct from all others */
1455+
if (pathinfo->unclassifiable)
1456+
{
1457+
pathinfoarray[npaths++]=pathinfo;
1458+
continue;
1459+
}
1460+
14521461
for (i=0;i<npaths;i++)
14531462
{
1454-
if (bms_equal(pathinfo->clauseids,pathinfoarray[i]->clauseids))
1463+
if (!pathinfoarray[i]->unclassifiable&&
1464+
bms_equal(pathinfo->clauseids,pathinfoarray[i]->clauseids))
14551465
break;
14561466
}
14571467
if (i<npaths)
@@ -1486,6 +1496,10 @@ choose_bitmap_and(PlannerInfo *root, RelOptInfo *rel, List *paths)
14861496
* For each surviving index, consider it as an "AND group leader", and see
14871497
* whether adding on any of the later indexes results in an AND path with
14881498
* cheaper total cost than before. Then take the cheapest AND group.
1499+
*
1500+
* Note: paths that are either clauseless or unclassifiable will have
1501+
* empty clauseids, so that they will not be rejected by the clauseids
1502+
* filter here, nor will they cause later paths to be rejected by it.
14891503
*/
14901504
for (i=0;i<npaths;i++)
14911505
{
@@ -1713,6 +1727,21 @@ classify_index_clause_usage(Path *path, List **clauselist)
17131727
result->preds=NIL;
17141728
find_indexpath_quals(path,&result->quals,&result->preds);
17151729

1730+
/*
1731+
* Some machine-generated queries have outlandish numbers of qual clauses.
1732+
* To avoid getting into O(N^2) behavior even in this preliminary
1733+
* classification step, we want to limit the number of entries we can
1734+
* accumulate in *clauselist. Treat any path with more than 100 quals +
1735+
* preds as unclassifiable, which will cause calling code to consider it
1736+
* distinct from all other paths.
1737+
*/
1738+
if (list_length(result->quals)+list_length(result->preds)>100)
1739+
{
1740+
result->clauseids=NULL;
1741+
result->unclassifiable= true;
1742+
returnresult;
1743+
}
1744+
17161745
/* Build up a bitmapset representing the quals and preds */
17171746
clauseids=NULL;
17181747
foreach(lc,result->quals)
@@ -1730,6 +1759,7 @@ classify_index_clause_usage(Path *path, List **clauselist)
17301759
find_list_position(node,clauselist));
17311760
}
17321761
result->clauseids=clauseids;
1762+
result->unclassifiable= false;
17331763

17341764
returnresult;
17351765
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp