diff options
| author | Magnus Hagander | 2020-05-18 09:55:11 +0000 |
|---|---|---|
| committer | Magnus Hagander | 2020-05-18 09:55:35 +0000 |
| commit | a01debe3db3d7f09797460500f217530b502c2de (patch) | |
| tree | 7954bdac5905be9f77db7df7d6b10da0b975f169 /src | |
| parent | 7e041b0c1d13b243b595d0b00145cb1116e4c327 (diff) | |
Fix typos in README
Author: Daniel Gustafsson
Diffstat (limited to 'src')
| -rw-r--r-- | src/backend/optimizer/README | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/backend/optimizer/README b/src/backend/optimizer/README index 40558cdf6b7..7dcab9a54b6 100644 --- a/src/backend/optimizer/README +++ b/src/backend/optimizer/README @@ -1109,10 +1109,10 @@ compatibly partitioned tables. Even if the joining relations don't have exactly the same partition bounds, partitionwise join can still be applied by using an advanced partition-matching algorithm. For both the joining relations, the algorithm -checks wether every partition of one joining relation only matches one +checks whether every partition of one joining relation only matches one partition of the other joining relation at most. In such a case the join between the joining relations can be broken down into joins between the -matching partitions. The join relation can then be considerd partitioned. +matching partitions. The join relation can then be considered partitioned. The algorithm produces the pairs of the matching partitions, plus the partition bounds for the join relation, to allow partitionwise join for computing the join. The algorithm is implemented in partition_bounds_merge(). |