< * Consider compressing indexes by storing key prefix values shared by
> * Consider compressing indexes by storing key values duplicated in
735a736,737
>
>   This is difficult because it requires datatype-specific knowledge.

<
> * Consider compressing indexes by storing key prefix values shared by
>   several rows as a single index entry

CREATE TABLE command, and translate dBase's 'M' field type to 'text'.

cache lookup in the success case.  This won't help much for cases where
the given relation is far down the search path, but it does not hurt in
any cases either; and it requires only a little new code.  Per gripe from
Jim Nasby about slowness of \d with many tables.

current backend in pg_listener, so there is little point in making
the PID to register part of async.c's public API. Other minor tweaks.

the parameter's name (if any) as the default column name for SELECT FROM
the function, rather than the function name as previously.  I still think
this is a bad idea, but I lost the argument.  Force decompilation of
function RTEs to specify full aliases always, to reduce the odds of this
decision breaking dumped views.

predicate_implied_by() to detect redundant filter conditions, but forgot
that predicate_implied_by() assumes its first argument contains only
immutable functions.  Add a check to guarantee that.  Also, test to see
if filter conditions can be discarded because they are redundant with
the predicate of a partial index.

information item is not available.

generated by bitmap index scans.  Along the way, simplify and speed up
the code for counting sequential and index scans; it was both confusing
and inefficient to be taking care of that in the per-tuple loops, IMHO.
initdb forced because of internal changes in pg_stat view definitions.

fixes by Neil Conway.

comment, it can at least test whether the expression returns set.

-Wold-style-definition, per recent discussion.

Dave Page

 Jun Kuwamura

renamed to --log-file for clarity.

Make pgbench "script driven" to eliminate hard coded transaction
scenario. (Tatsuo Ishii)

Somehow I missed some parser changes, so this commit comes pretty late. I just synced the parser of ecpg against the backend version, but still have to sync the lexer.

Also I fixed a bug in a bug fix I committed a few weeks ago. he check for a varchar pointer was incomplete.

Per buildfarm results and Michael Fuhr.

where it should prohibit COPY FROM.  Found by Alon Goldshuv.

sort operations.  Per recent discussion.  Simon Riggs and Tom Lane.

for using it for other things besides VACUUM.

Update release dates for pending back-branch releases.

early binding for nextval() calls in default clauses.

< * -Have sequence dependency track use of DEFAULT sequences

< * Have sequence dependency track use of DEFAULT sequences,
<   seqname.nextval?
> * -Have sequence dependency track use of DEFAULT sequences

was created on a machine with alignment rules and floating-point format
similar to the current machine.  Per recent discussion, this seems like
a good idea with the increasing prevalence of 32/64 bit environments.

argument as a 'regclass' value instead of a text string.  The frontend
conversion of text string to pg_class OID is now encapsulated as an
implicitly-invocable coercion from text to regclass.  This provides
backwards compatibility to the old behavior when the sequence argument
is explicitly typed as 'text'.  When the argument is just an unadorned
literal string, it will be taken as 'regclass', which means that the
stored representation will be an OID.  This solves longstanding problems
with renaming sequences that are referenced in default expressions, as
well as new-in-8.1 problems with renaming such sequences' schemas or
moving them to another schema.  All per recent discussion.
Along the way, fix some rather serious problems in dbmirror's support
for mirroring sequence operations (int4 vs int8 confusion for instance).