We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 2befd22 commit 94eec79Copy full SHA for 94eec79
doc/src/sgml/parallel.sgml
@@ -423,7 +423,7 @@ EXPLAIN SELECT * FROM pgbench_accounts WHERE filler LIKE '%x%';
423
Append</literal> node can have both partial and non-partial child plans.
424
Non-partial children will be scanned by only a single process, since
425
scanning them more than once would produce duplicate results. Plans that
426
- involve appending multiple results sets can therefore achieve
+ involve appending multiple result sets can therefore achieve
427
coarse-grained parallelism even when efficient partial plans are not
428
available. For example, consider a query against a partitioned table
429
that can only be implemented efficiently by using an index that does
0 commit comments