summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorPeter Eisentraut <peter_e@gmx.net>2017-12-18 16:00:35 -0500
committerPeter Eisentraut <peter_e@gmx.net>2017-12-18 16:03:00 -0500
commit02f66d8656e8fb1ba56604994149f063c7230a18 (patch)
treea0fe10fb33db3a3b85da671b30d2a90a3b2ee770
parented8e1aff6acef475eb33e0212253df05cb2d4d20 (diff)
downloadpostgresql-02f66d8656e8fb1ba56604994149f063c7230a18.tar.gz
doc: Fix figures in example description
oversight in 244c8b466a743d1ec18a7d841bf42669699b3b56 Reported-by: Blaz Merela <blaz@merela.org>
-rw-r--r--doc/src/sgml/perform.sgml2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/src/sgml/perform.sgml b/doc/src/sgml/perform.sgml
index cf085fe0cc..5e6de7d9bf 100644
--- a/doc/src/sgml/perform.sgml
+++ b/doc/src/sgml/perform.sgml
@@ -388,7 +388,7 @@ WHERE t1.unique1 &lt; 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>