Some examples:
- SELECT regexp_matches('foo', 'not there');
+SELECT regexp_matches('foo', 'not there');
regexp_matches
----------------
(0 rows)
An example of synchronous_standby_names> for
a quorum-based multiple synchronous standbys is:
- synchronous_standby_names = 'ANY 2 (s1, s2, s3)'
+synchronous_standby_names = 'ANY 2 (s1, s2, s3)'
In this example, if four standby servers s1>, s2>,
s3> and s4> are running, transaction commits will
Prepares the md5-encrypted form of a
PostgreSQL> password.
-
+
char *PQencryptPassword(const char *passwd, const char *user);
-
- PQencryptPassword> is an older, deprecated version of
+
+ PQencryptPassword> is an older, deprecated version of
PQencryptPasswodConn>. The difference is that
- PQencryptPassword> does not
+ PQencryptPassword> does not
require a connection object, and md5> is always used as the
encryption algorithm.
|
backend_type
text
- Type of current backend. Possible types are
+ Type of current backend. Possible types are
autovacuum launcher>, autovacuum worker>,
background worker>, background writer>,
client backend>, checkpointer>,
the standby to catch up with the sending server assuming the current
rate of replay. Such a system would show similar times while new WAL is
being generated, but would differ when the sender becomes idle. In
- particular, when the standby has caught up completely,
+ particular, when the standby has caught up completely,
pg_stat_replication shows the time taken to
write, flush and replay the most recent reported WAL location rather than
zero as some users might expect. This is consistent with the goal of
In a parallel sequential scan>, the table's blocks will
be divided among the cooperating processes. Blocks are handed out one
- at a time, so that access to the table remains sequential.
+ at a time, so that access to the table remains sequential.
- The table_len will always be greater than the sum
- of the tuple_len, dead_tuple_len
- and free_space. The difference is accounted for by
- fixed page overhead, the per-page table of pointers to tuples, and
- padding to ensure that tuples are correctly aligned.
-
+ The table_len will always be greater than the sum
+ of the tuple_len, dead_tuple_len
+ and free_space. The difference is accounted for by
+ fixed page overhead, the per-page table of pointers to tuples, and
+ padding to ensure that tuples are correctly aligned.
+
- These are less likely to be problematic than search_path>, but
+ These are less likely to be problematic than search_path>, but
can be handled with function SET> options if the need arises.
SASL Authentication Message Flow
To begin a SASL authentication exchange, the server sends an
AuthenticationSASL message. It includes a list of SASL authentication
mechanisms that the server can accept, in the server's preferred order.
SCRAM-SHA-256> (called just SCRAM> from now on) is
the only implemented SASL mechanism, at the moment. It is described in detail
- in RFC 7677 and RFC 5802.
+ in RFC 7677 and RFC 5802.
table. Even if there is no NOT NULL> constraint on the
parent, such a constraint can still be added to individual partitions,
if desired; that is, the children can disallow nulls even if the parent
- allows them, but not the other way around.
+ allows them, but not the other way around.
- SHARE UPDATE EXCLUSIVE lock will be taken for
+ SHARE UPDATE EXCLUSIVE lock will be taken for
fillfactor and autovacuum storage parameters, as well as the
following planner related parameters:
effective_io_concurrency, parallel_workers, seq_page_cost
- If row-level security is enabled for the table, the relevant
+ If row-level security is enabled for the table, the relevant
SELECT policies will apply to COPY
table> TO statements.
Currently, COPY FROM is not supported for tables