doc: PG 13 relnotes: add duplicate btree optimization details
This commit is contained in:
parent
ca4599b0dc
commit
aa976d3b90
|
@ -359,9 +359,9 @@ More efficiently store duplicates in btree indexes (Anastasia Lubennikova, Peter
|
||||||
</para>
|
</para>
|
||||||
|
|
||||||
<para>
|
<para>
|
||||||
This allows efficient btree indexing of low cardinality columns.
|
This allows efficient btree indexing of low cardinality columns by storing
|
||||||
Users upgrading with pg_upgrade will need to use REINDEX to make use of
|
duplicate keys only once. Users upgrading with pg_upgrade will need to
|
||||||
this feature.
|
use REINDEX to make use of this feature.
|
||||||
</para>
|
</para>
|
||||||
|
|
||||||
</listitem>
|
</listitem>
|
||||||
|
|
Loading…
Reference in New Issue