</para>

<para>

Deduplication works by periodically merging groups of duplicate

group. The column key value(s) only appear once in this

representation. This is followed by a sorted array of

<acronym>TID</acronym>s that point to rows in the table. This

of statistics accumulated for this statistics object by

<xref linkend="sql-analyze"/>.

A zero value indicates that no statistics should be collected.

Positive values of <structfield>stxstattarget</structfield>

determine the target number of <quote>most common values</quote>

to collect.

servers or streaming base backup clients (i.e., the maximum number of

simultaneously running WAL sender processes). The default is

<literal>10</literal>. The value <literal>0</literal> means

leave an orphaned connection slot behind until a timeout is reached,

so this parameter should be set slightly higher than the maximum

number of expected clients so disconnected clients can immediately

slots</link> are allowed to retain in the <filename>pg_wal</filename>

directory at checkpoint time.

If <varname>max_slot_wal_keep_size</varname> is -1 (the default),

to continue replication due to removal of required WAL files. You

can see the WAL availability of replication slots

in <link linkend="view-pg-replication-slots">pg_replication_slots</link>.

</term>

<listitem>

<para>

<literal>-1</literal> (the default) allows bind parameters to be

logged in full.

If this value is specified without units, it is taken as bytes.

a regular <command>VACUUM</command> in that it visits every page that might

contain unfrozen XIDs or MXIDs, not just those that might contain dead

tuples. The default is 150 million transactions. Although users can

will silently limit the effective value to 95% of

<xref linkend="guc-autovacuum-freeze-max-age"/>, so that a

anti-wraparound autovacuum is launched for the table. For more

information see

<xref linkend="vacuum-for-wraparound"/>.

a regular <command>VACUUM</command> in that it visits every page that might

contain unfrozen XIDs or MXIDs, not just those that might contain dead

tuples. The default is 150 million multixacts.

<command>VACUUM</command> will silently limit the effective value to 95% of

<xref linkend="guc-autovacuum-multixact-freeze-max-age"/>, so that a

anti-wraparound is launched for the table.

For more information see <xref linkend="vacuum-for-multixact-wraparound"/>.

</para>

Before running the <command>ATTACH PARTITION</command> command, it is

recommended to create a <literal>CHECK</literal> constraint on the table to

be attached matching the desired partition constraint. That way,

partition constraint. Without the <literal>CHECK</literal> constraint,

the table will be scanned to validate the partition constraint while

holding an <literal>ACCESS EXCLUSIVE</literal> lock on that partition

<literal>'use_json_null'</literal>.

</para>

<para>

<returnvalue>[{"f1":null,"f2":null},2,null,3]</returnvalue>

</para>

<para>

<returnvalue>[{"f1": 99, "f2": null}, 2]</returnvalue>

</para></entry>

</row>

<term><literal>connect_timeout</literal></term>

<listitem>

<para>

e.g., <literal>10</literal>). Zero, negative, or not specified means

wait indefinitely. The minimum allowed timeout is 2 seconds, therefore

a value of <literal>1</literal> is interpreted as <literal>2</literal>.

<listitem>

<para>

Replication is only supported by tables, including partitioned tables.

views, or foreign tables, will result in an error.

</para>

</listitem>

<entry><literal>waiting for checkpoint to finish</literal></entry>

<entry>

The WAL sender process is currently performing

checkpoint to finish.

</entry>

</row>

and sent along with the backup. The manifest is a list of every

file present in the backup with the exception of any WAL files that

may be included. It also stores the size, last modification time, and

A value of <literal>force-encode</literal> forces all filenames

to be hex-encoded; otherwise, this type of encoding is performed only

for files whose names are non-UTF8 octet sequences.

<term><literal>MANIFEST_CHECKSUMS</literal> <replaceable>checksum_algorithm</replaceable></term>

<listitem>

<para>

in the backup manifest. Currently, the available

algorithms are <literal>NONE</literal>, <literal>CRC32C</literal>,

<literal>SHA224</literal>, <literal>SHA256</literal>,

The statistic-gathering target for this statistics object for subsequent

<xref linkend="sql-analyze"/> operations.

The target can be set in the range 0 to 10000; alternatively, set it

target (<xref linkend="guc-default-statistics-target"/>).

For more information on the use of statistics by the

<productname>PostgreSQL</productname> query planner, refer to

When applied to a partitioned table, nothing is moved, but any

partitions created afterwards with

<command>CREATE TABLE PARTITION OF</command> will use that tablespace,

</para>

<para>

</para>

<para>

The following command-line options control the generation of the

<variablelist>

<varlistentry>

of each file for users who wish to verify that the backup has not been

tampered with, while the CRC32C algorithm provides a checksum that is

much faster to calculate; it is good at catching errors due to accidental

be useful against an adversary who has access to the backup, the backup

manifest would need to be stored securely elsewhere or otherwise

verified not to have been modified since the backup was taken.

<listitem>

<para>

Run the dump in parallel by dumping <replaceable class="parameter">njobs</replaceable>

increases the load on the database server. You can only use this option with the

directory output format because this is the only output format where multiple processes

can write their data at the same time.

<command>pg_rewind</command> to return without waiting, which is

faster, but means that a subsequent operating system crash can leave

the synchronized data directory corrupt. Generally, this option is

installation.

</para>

</listitem>

<para>

When executing <application>pg_rewind</application> using an online

cluster as source which has been recently promoted, it is necessary

control file reflects up-to-date timeline information, which is used by

<application>pg_rewind</application> to check if the target cluster

can be rewound using the designated source cluster.

<title>Common Options</title>

<para>

<variablelist>

<para>

Reindexing a single index or table requires being the owner of that

index or table. Reindexing a schema or database requires being the

possible for non-superusers to rebuild indexes of tables owned by

other users. However, as a special exception, when

<command>REINDEX DATABASE</command>, <command>REINDEX SCHEMA</command>

<para>

Execute the reindex commands in parallel by running

<replaceable class="parameter">njobs</replaceable>

</para>

<para>

<application>reindexdb</application> will open

<para>

Execute the vacuum or analyze commands in parallel by running

<replaceable class="parameter">njobs</replaceable>

</para>

<para>

<application>vacuumdb</application> will open

<para>

The <productname>PostgreSQL</productname> server will listen for both

normal and <acronym>GSSAPI</acronym>-encrypted connections on the same TCP

use <acronym>GSSAPI</acronym> for encryption (and for authentication). By

default, this decision is up to the client (which means it can be

downgraded by an attacker); see <xref linkend="auth-pg-hba-conf"/> about

<title>Use of Quotes</title>

<para>

other variables that might contain words. Do not use them to mark up

variables that will not contain words (for example, operator names).

</para>

Deletion algorithm keeps exclusive locks on left siblings of pages comprising

currently investigated path. Thus, if current page is to be removed, all

required pages to remove both downlink and rightlink are already locked. That

concurrent stepping right.

A search concurrent to page deletion might already have read a pointer to the

-- This tests that when merging partitions from plt1_adv and plt2_adv in

-- merge_list_bounds(), process_outer_partition() returns an already-assigned

-- merged partition when re-called with plt1_adv_p1 for the second list value

EXPLAIN (COSTS OFF)

SELECT t1.a, t1.c, t2.a, t2.c, t3.a, t3.c FROM (plt1_adv t1 LEFT JOIN plt2_adv t2 ON (t1.c = t2.c)) FULL JOIN plt3_adv t3 ON (t1.c = t3.c) WHERE coalesce(t1.a, 0) % 5 != 3 AND coalesce(t1.a, 0) % 5 != 4 ORDER BY t1.c, t1.a, t2.a, t3.a;

QUERY PLAN

EXPLAIN (COSTS OFF)

SELECT t1.a, t1.c, t2.a, t2.c, t3.a, t3.c FROM (plt1_adv t1 LEFT JOIN plt2_adv t2 ON (t1.c = t2.c)) FULL JOIN plt3_adv t3 ON (t1.c = t3.c) WHERE coalesce(t1.a, 0) % 5 != 3 AND coalesce(t1.a, 0) % 5 != 4 ORDER BY t1.c, t1.a, t2.a, t3.a;

SELECT t1.a, t1.c, t2.a, t2.c, t3.a, t3.c FROM (plt1_adv t1 LEFT JOIN plt2_adv t2 ON (t1.c = t2.c)) FULL JOIN plt3_adv t3 ON (t1.c = t3.c) WHERE coalesce(t1.a, 0) % 5 != 3 AND coalesce(t1.a, 0) % 5 != 4 ORDER BY t1.c, t1.a, t2.a, t3.a;