-
Notifications
You must be signed in to change notification settings - Fork 3.9k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
opt: create key for UNIQUE WITHOUT INDEX constraints
This commit teaches the optimizer that columns with a valid UNIQUE WITHOUT INDEX constraint form a key, and the functional dependencies should reflect that. This will be necessary to support locality optimized search. Fixes #58944 Informs #55185 Release note (performance improvement): The optimizer now knows that the unique columns in an implicitly partitioned unique index form a key. This can be used to enable certain optimizations and may result in better plans.
- Loading branch information
Showing
4 changed files
with
235 additions
and
14 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,96 @@ | ||
| exec-ddl | ||
| CREATE TABLE t ( | ||
| x INT PRIMARY KEY, | ||
| y INT UNIQUE WITHOUT INDEX, | ||
| z INT NOT NULL UNIQUE WITHOUT INDEX, | ||
| a INT, | ||
| b INT NOT NULL, | ||
| c INT NOT NULL, | ||
| UNIQUE WITHOUT INDEX (a, b), | ||
| UNIQUE WITHOUT INDEX (b, c), | ||
| UNIQUE WITHOUT INDEX (c) WHERE a > 5 | ||
| ) | ||
| ---- | ||
|
|
||
| # Test that we build appropriate strict or lax keys for each of the UNIQUE | ||
| # WITHOUT INDEX constraints depending on whether or not the columns allow | ||
| # NULL values. We should not build a key for the partial constraint. | ||
| build | ||
| SELECT * FROM t | ||
| ---- | ||
| project | ||
| ├── columns: x:1(int!null) y:2(int) z:3(int!null) a:4(int) b:5(int!null) c:6(int!null) | ||
| ├── key: (1) | ||
| ├── fd: (1)-->(2-6), (2)~~>(1,3-6), (3)-->(1,2,4-6), (4,5)~~>(1-3,6), (5,6)-->(1-4) | ||
| ├── prune: (1-6) | ||
| ├── interesting orderings: (+1) | ||
| └── scan t | ||
| ├── columns: x:1(int!null) y:2(int) z:3(int!null) a:4(int) b:5(int!null) c:6(int!null) crdb_internal_mvcc_timestamp:7(decimal) | ||
| ├── key: (1) | ||
| ├── fd: (1)-->(2-7), (2)~~>(1,3-7), (3)-->(1,2,4-7), (4,5)~~>(1-3,6,7), (5,6)-->(1-4,7) | ||
| ├── prune: (1-7) | ||
| └── interesting orderings: (+1) | ||
|
|
||
| # Because we're constraining a key to a constant, the resulting FDs should | ||
| # show that all columns are now constant, and cardinality is at most 1. | ||
| build | ||
| SELECT * FROM t WHERE y = 5 | ||
| ---- | ||
| project | ||
| ├── columns: x:1(int!null) y:2(int!null) z:3(int!null) a:4(int) b:5(int!null) c:6(int!null) | ||
| ├── cardinality: [0 - 1] | ||
| ├── key: () | ||
| ├── fd: ()-->(1-6) | ||
| ├── prune: (1-6) | ||
| ├── interesting orderings: (+1) | ||
| └── select | ||
| ├── columns: x:1(int!null) y:2(int!null) z:3(int!null) a:4(int) b:5(int!null) c:6(int!null) crdb_internal_mvcc_timestamp:7(decimal) | ||
| ├── cardinality: [0 - 1] | ||
| ├── key: () | ||
| ├── fd: ()-->(1-7) | ||
| ├── prune: (1,3-7) | ||
| ├── interesting orderings: (+1) | ||
| ├── scan t | ||
| │ ├── columns: x:1(int!null) y:2(int) z:3(int!null) a:4(int) b:5(int!null) c:6(int!null) crdb_internal_mvcc_timestamp:7(decimal) | ||
| │ ├── key: (1) | ||
| │ ├── fd: (1)-->(2-7), (2)~~>(1,3-7), (3)-->(1,2,4-7), (4,5)~~>(1-3,6,7), (5,6)-->(1-4,7) | ||
| │ ├── prune: (1-7) | ||
| │ └── interesting orderings: (+1) | ||
| └── filters | ||
| └── eq [type=bool, outer=(2), constraints=(/2: [/5 - /5]; tight), fd=()-->(2)] | ||
| ├── variable: y:2 [type=int] | ||
| └── const: 5 [type=int] | ||
|
|
||
| # Because we're constraining a key to a constant, the resulting FDs should | ||
| # show that all columns are now constant, and cardinality is at most 1. | ||
| build | ||
| SELECT * FROM t WHERE a = 1 AND b = 1 | ||
| ---- | ||
| project | ||
| ├── columns: x:1(int!null) y:2(int) z:3(int!null) a:4(int!null) b:5(int!null) c:6(int!null) | ||
| ├── cardinality: [0 - 1] | ||
| ├── key: () | ||
| ├── fd: ()-->(1-6) | ||
| ├── prune: (1-6) | ||
| ├── interesting orderings: (+1) | ||
| └── select | ||
| ├── columns: x:1(int!null) y:2(int) z:3(int!null) a:4(int!null) b:5(int!null) c:6(int!null) crdb_internal_mvcc_timestamp:7(decimal) | ||
| ├── cardinality: [0 - 1] | ||
| ├── key: () | ||
| ├── fd: ()-->(1-7) | ||
| ├── prune: (1-3,6,7) | ||
| ├── interesting orderings: (+1) | ||
| ├── scan t | ||
| │ ├── columns: x:1(int!null) y:2(int) z:3(int!null) a:4(int) b:5(int!null) c:6(int!null) crdb_internal_mvcc_timestamp:7(decimal) | ||
| │ ├── key: (1) | ||
| │ ├── fd: (1)-->(2-7), (2)~~>(1,3-7), (3)-->(1,2,4-7), (4,5)~~>(1-3,6,7), (5,6)-->(1-4,7) | ||
| │ ├── prune: (1-7) | ||
| │ └── interesting orderings: (+1) | ||
| └── filters | ||
| └── and [type=bool, outer=(4,5), constraints=(/4: [/1 - /1]; /5: [/1 - /1]; tight), fd=()-->(4,5)] | ||
| ├── eq [type=bool] | ||
| │ ├── variable: a:4 [type=int] | ||
| │ └── const: 1 [type=int] | ||
| └── eq [type=bool] | ||
| ├── variable: b:5 [type=int] | ||
| └── const: 1 [type=int] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters