summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorPeter Eisentraut2017-12-18 21:00:35 +0000
committerPeter Eisentraut2017-12-18 21:00:35 +0000
commit53cba77b53f98255bfbba9d2612d1a5685feec52 (patch)
tree6cdf432c4bab3afedf9bebab0f9c3728b5b33f6c
parent56a95ee5118bf6d46e261b8d352f7dafac10587d (diff)
doc: Fix figures in example description
oversight in 244c8b466a743d1ec18a7d841bf42669699b3b56 Reported-by: Blaz Merela <[email protected]>
-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 a51fd1c7dcd..c32e95a1542 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</literal>.) 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>