|
263 | 263 |
|
264 | 264 | <para>
|
265 | 265 | As a rule of thumb, an assumption of the stability or comparability
|
266 |
| - of <structfield>querid</> values should be predicated on the the |
| 266 | + of <structfield>queryid</> values should be predicated on the the |
267 | 267 | underlying catalog metadata and hash function implementation
|
268 | 268 | details exactly matching. Any two servers participating in any
|
269 | 269 | variety of replication based on physical WAL-replay can be expected
|
270 |
| - to have identical <structfield>querid</> values for the same query. |
| 270 | + to have identical <structfield>queryid</> values for the same query. |
271 | 271 | Logical replication schemes do not have replicas comparable in all
|
272 |
| - relevant regards, and so <structfield>querid</> will not be a |
| 272 | + relevant regards, and so <structfield>queryid</> will not be a |
273 | 273 | useful identifier for accumulating costs for the entire replica
|
274 | 274 | set. If in doubt, direct testing is recommended.
|
275 | 275 | </para>
|
|