Doc: Tweak description of B-Tree duplicate tuples.

Defining duplicates as "close by" to each other was unclear.  Simplify
the definition.

Backpatch: 13-, where deduplication was introduced (by commit 0d861bbb)

diff --git a/doc/src/sgml/btree.sgml b/doc/src/sgml/btree.sgml
index 661e7ab6503febf222529392f2afa8416dbbef5f..4f1438d522df426f5ca59b92e12b354563dfd049 100644 (file)
--- a/doc/src/sgml/btree.sgml
+++ b/doc/src/sgml/btree.sgml
@@ -635,10 +635,10 @@ options(relopts local_relopts *) returns
    A duplicate is a leaf page tuple (a tuple that points to a table
    row) where all indexed key columns have values
    that match corresponding column values from at least one other leaf
-   page tuple that's close by in the same index.  Duplicate tuples are
-   quite common in practice.  B-Tree indexes can use a special,
-   space-efficient representation for duplicates when an optional
-   technique is enabled: deduplication.
+   page tuple in the same index.  Duplicate tuples are quite common in
+   practice.  B-Tree indexes can use a special, space-efficient
+   representation for duplicates when an optional technique is
+   enabled: deduplication.
   
   
    Deduplication works by periodically merging groups of duplicate