Skip to content

Commit

Permalink
Don't use partial unique indexes for unique proofs in the planner
Browse files Browse the repository at this point in the history
Here we adjust relation_has_unique_index_for() so that it no longer makes
use of partial unique indexes as uniqueness proofs.  It is incorrect to
use these as the predicates used by check_index_predicates() to set
predOK makes use of not only baserestrictinfo quals as proofs, but also
qual from join conditions.  For relation_has_unique_index_for()'s case, we
need to know the relation is unique for a given set of columns before any
joins are evaluated, so if predOK was only set to true due to some join
qual, then it's unsafe to use such indexes in
relation_has_unique_index_for().  The final plan may not even make use
of that index, which could result in reading tuples that are not as
unique as the planner previously expected them to be.

Bug: #17975
Reported-by: Tor Erik Linnerud
Backpatch-through: 11, all supported versions
Discussion: https://postgr.es/m/17975-98a90c156f25c952%40postgresql.org
  • Loading branch information
david-rowley committed Jun 19, 2023
1 parent 3f157d0 commit 73f1c17
Show file tree
Hide file tree
Showing 4 changed files with 36 additions and 8 deletions.
9 changes: 6 additions & 3 deletions src/backend/optimizer/path/indxpath.c
Original file line number Diff line number Diff line change
Expand Up @@ -3569,10 +3569,13 @@ relation_has_unique_index_for(PlannerInfo *root, RelOptInfo *rel,

/*
* If the index is not unique, or not immediately enforced, or if it's
* a partial index that doesn't match the query, it's useless here.
* a partial index, it's useless here. We're unable to make use of
* predOK partial unique indexes due to the fact that
* check_index_predicates() also makes use of join predicates to
* determine if the partial index is usable. Here we need proofs that
* hold true before any joins are evaluated.
*/
if (!ind->unique || !ind->immediate ||
(ind->indpred != NIL && !ind->predOK))
if (!ind->unique || !ind->immediate || ind->indpred != NIL)
continue;

/*
Expand Down
9 changes: 4 additions & 5 deletions src/backend/optimizer/plan/analyzejoins.c
Original file line number Diff line number Diff line change
Expand Up @@ -592,18 +592,17 @@ rel_supports_distinctness(PlannerInfo *root, RelOptInfo *rel)
/*
* For a plain relation, we only know how to prove uniqueness by
* reference to unique indexes. Make sure there's at least one
* suitable unique index. It must be immediately enforced, and if
* it's a partial index, it must match the query. (Keep these
* conditions in sync with relation_has_unique_index_for!)
* suitable unique index. It must be immediately enforced, and not a
* partial index. (Keep these conditions in sync with
* relation_has_unique_index_for!)
*/
ListCell *lc;

foreach(lc, rel->indexlist)
{
IndexOptInfo *ind = (IndexOptInfo *) lfirst(lc);

if (ind->unique && ind->immediate &&
(ind->indpred == NIL || ind->predOK))
if (ind->unique && ind->immediate && ind->indpred == NIL)
return true;
}
}
Expand Down
17 changes: 17 additions & 0 deletions src/test/regress/expected/join.out
Original file line number Diff line number Diff line change
Expand Up @@ -6503,6 +6503,23 @@ left join j2 on j1.id1 = j2.id1 where j1.id2 = 1;
Output: j2.id1, j2.id2
(8 rows)

create unique index j1_id2_idx on j1(id2) where id2 is not null;
-- ensure we don't use a partial unique index as unique proofs
explain (verbose, costs off)
select * from j1
inner join j2 on j1.id2 = j2.id2;
QUERY PLAN
------------------------------------------
Nested Loop
Output: j1.id1, j1.id2, j2.id1, j2.id2
Join Filter: (j1.id2 = j2.id2)
-> Seq Scan on public.j2
Output: j2.id1, j2.id2
-> Seq Scan on public.j1
Output: j1.id1, j1.id2
(7 rows)

drop index j1_id2_idx;
-- validate logic in merge joins which skips mark and restore.
-- it should only do this if all quals which were used to detect the unique
-- are present as join quals, and not plain quals.
Expand Down
9 changes: 9 additions & 0 deletions src/test/regress/sql/join.sql
Original file line number Diff line number Diff line change
Expand Up @@ -2263,6 +2263,15 @@ explain (verbose, costs off)
select * from j1
left join j2 on j1.id1 = j2.id1 where j1.id2 = 1;

create unique index j1_id2_idx on j1(id2) where id2 is not null;

-- ensure we don't use a partial unique index as unique proofs
explain (verbose, costs off)
select * from j1
inner join j2 on j1.id2 = j2.id2;

drop index j1_id2_idx;

-- validate logic in merge joins which skips mark and restore.
-- it should only do this if all quals which were used to detect the unique
-- are present as join quals, and not plain quals.
Expand Down

0 comments on commit 73f1c17

Please sign in to comment.