diff options
| author | Peter Eisentraut <peter_e@gmx.net> | 2017-12-18 16:00:35 -0500 |
|---|---|---|
| committer | Peter Eisentraut <peter_e@gmx.net> | 2017-12-18 16:02:41 -0500 |
| commit | 23b63417e20d548d281cd8f904f6f2ffcebddc8c (patch) | |
| tree | 9b778177e73c0e4f60626b9ce4d65c3003bde2e3 | |
| parent | 0668c84e28578921f46ad276f9cd24bb773841f2 (diff) | |
doc: Fix figures in example description
oversight in 244c8b466a743d1ec18a7d841bf42669699b3b56
Reported-by: Blaz Merela <blaz@merela.org>
| -rw-r--r-- | doc/src/sgml/perform.sgml | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/src/sgml/perform.sgml b/doc/src/sgml/perform.sgml index a99abdda0c8..9a1c21a5425 100644 --- a/doc/src/sgml/perform.sgml +++ b/doc/src/sgml/perform.sgml @@ -388,7 +388,7 @@ WHERE t1.unique1 < 10 AND t1.unique2 = t2.unique2; as a result of caching that's expected to occur during the repeated index scans on <literal>t2</>.) The costs of the loop node are then set on the basis of the cost of the outer - scan, plus one repetition of the inner scan for each outer row (10 * 7.87, + scan, plus one repetition of the inner scan for each outer row (10 * 7.91, here), plus a little CPU time for join processing. </para> |