@@ -664,7 +664,7 @@ options(<replaceable>relopts</replaceable> <type>local_relopts *</type>) returns
664664 certain implementation-level heuristics will fail to identify and
665665 delete even one garbage index tuple (in which case a page split or
666666 deduplication pass resolves the issue of an incoming new tuple not
667- fitting on a leaf page). The worst case number of versions that
667+ fitting on a leaf page). The worst- case number of versions that
668668 any index scan must traverse (for any single logical row) is an
669669 important contributor to overall system responsiveness and
670670 throughput. A bottom-up index deletion pass targets suspected
@@ -706,7 +706,7 @@ options(<replaceable>relopts</replaceable> <type>local_relopts *</type>) returns
706706 This is expected with any B-Tree index that is subject to
707707 significant version churn from <command>UPDATE</command>s that
708708 rarely or never logically modify the columns that the index covers.
709- The average and worst case number of versions per logical row can
709+ The average and worst- case number of versions per logical row can
710710 be kept low purely through targeted incremental deletion passes.
711711 It's quite possible that the on-disk size of certain indexes will
712712 never increase by even one single page/block despite
@@ -811,7 +811,7 @@ options(<replaceable>relopts</replaceable> <type>local_relopts *</type>) returns
811811 constraints) to use deduplication. This allows leaf pages to
812812 temporarily <quote>absorb</quote> extra version churn duplicates.
813813 Deduplication in unique indexes augments bottom-up index deletion,
814- especially in cases where a long-running transactions holds a
814+ especially in cases where a long-running transaction holds a
815815 snapshot that blocks garbage collection. The goal is to buy time
816816 for the bottom-up index deletion strategy to become effective
817817 again. Delaying page splits until a single long-running
0 commit comments