Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorPeter Eisentraut2012-06-07 21:06:20 +0000
committerPeter Eisentraut2012-06-07 21:06:20 +0000
commit5baf6da71701abcb76487d9de68f7d7dc6c365e9 (patch)
treefc4b806627f170fcef5a11e8efc1f1dc63149457 /doc/src/sgml/gist.sgml
parent5d0109bd2776ce918821f360e951270caa96ba8a (diff)
Documentation spell and markup checking
Diffstat (limited to 'doc/src/sgml/gist.sgml')
-rw-r--r--doc/src/sgml/gist.sgml2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/src/sgml/gist.sgml b/doc/src/sgml/gist.sgml
index 73bf63fd3a3..ed0bc54f52d 100644
--- a/doc/src/sgml/gist.sgml
+++ b/doc/src/sgml/gist.sgml
@@ -665,7 +665,7 @@ my_distance(PG_FUNCTION_ARGS)
a lot of random I/O. Beginning in version 9.2, PostgreSQL supports a more
efficient method to build GiST indexes based on buffering, which can
dramatically reduce the number of random I/Os needed for non-ordered data
- sets. For well-ordered datasets the benefit is smaller or non-existent,
+ sets. For well-ordered data sets the benefit is smaller or non-existent,
because only a small number of pages receive new tuples at a time, and
those pages fit in cache even if the index as whole does not.
</para>