Na}{

Path: ~//opt/alt/postgresql11/usr/share/doc/alt-postgresql11-9.2.24/html/

File Content: `xindex.html`

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<HTML
><HEAD
><TITLE
>Interfacing Extensions To Indexes</TITLE
><META
NAME="GENERATOR"
CONTENT="Modular DocBook HTML Stylesheet Version 1.79"><LINK
REV="MADE"
HREF="mailto:pgsql-docs@postgresql.org"><LINK
REL="HOME"
TITLE="PostgreSQL 9.2.24 Documentation"
HREF="index.html"><LINK
REL="UP"
TITLE="Extending SQL"
HREF="extend.html"><LINK
REL="PREVIOUS"
TITLE="Operator Optimization Information"
HREF="xoper-optimization.html"><LINK
REL="NEXT"
TITLE="Packaging Related Objects into an Extension"
HREF="extend-extensions.html"><LINK
REL="STYLESHEET"
TYPE="text/css"
HREF="stylesheet.css"><META
HTTP-EQUIV="Content-Type"
CONTENT="text/html; charset=ISO-8859-1"><META
NAME="creation"
CONTENT="2017-11-06T22:43:11"></HEAD
><BODY
CLASS="SECT1"
><DIV
CLASS="NAVHEADER"
><TABLE
SUMMARY="Header navigation table"
WIDTH="100%"
BORDER="0"
CELLPADDING="0"
CELLSPACING="0"
><TR
><TH
COLSPAN="5"
ALIGN="center"
VALIGN="bottom"
><A
HREF="index.html"
>PostgreSQL 9.2.24 Documentation</A
></TH
></TR
><TR
><TD
WIDTH="10%"
ALIGN="left"
VALIGN="top"
><A
TITLE="Operator Optimization Information"
HREF="xoper-optimization.html"
ACCESSKEY="P"
>Prev</A
></TD
><TD
WIDTH="10%"
ALIGN="left"
VALIGN="top"
><A
HREF="extend.html"
ACCESSKEY="U"
>Up</A
></TD
><TD
WIDTH="60%"
ALIGN="center"
VALIGN="bottom"
>Chapter 35. Extending <ACRONYM
CLASS="ACRONYM"
>SQL</ACRONYM
></TD
><TD
WIDTH="20%"
ALIGN="right"
VALIGN="top"
><A
TITLE="Packaging Related Objects into an Extension"
HREF="extend-extensions.html"
ACCESSKEY="N"
>Next</A
></TD
></TR
></TABLE
><HR
ALIGN="LEFT"
WIDTH="100%"></DIV
><DIV
CLASS="SECT1"
><H1
CLASS="SECT1"
><A
NAME="XINDEX"
>35.14. Interfacing Extensions To Indexes</A
></H1
><P
>   The procedures described thus far let you define new types, new
   functions, and new operators. However, we cannot yet define an
   index on a column of a new data type.  To do this, we must define an
   <I
CLASS="FIRSTTERM"
>operator class</I
> for the new data type.  Later in this
   section, we will illustrate this concept in an example: a new
   operator class for the B-tree index method that stores and sorts
   complex numbers in ascending absolute value order.
  </P
><P
>   Operator classes can be grouped into <I
CLASS="FIRSTTERM"
>operator families</I
>
   to show the relationships between semantically compatible classes.
   When only a single data type is involved, an operator class is sufficient,
   so we'll focus on that case first and then return to operator families.
  </P
><DIV
CLASS="SECT2"
><H2
CLASS="SECT2"
><A
NAME="XINDEX-OPCLASS"
>35.14.1. Index Methods and Operator Classes</A
></H2
><P
>   The <CODE
CLASS="CLASSNAME"
>pg_am</CODE
> table contains one row for every
   index method (internally known as access method).  Support for
   regular access to tables is built into
   <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
>, but all index methods are
   described in <CODE
CLASS="CLASSNAME"
>pg_am</CODE
>.  It is possible to add a
   new index method by defining the required interface routines and
   then creating a row in <CODE
CLASS="CLASSNAME"
>pg_am</CODE
> &mdash; but that is
   beyond the scope of this chapter (see <A
HREF="indexam.html"
>Chapter 52</A
>).
  </P
><P
>   The routines for an index method do not directly know anything
   about the data types that the index method will operate on.
   Instead, an <I
CLASS="FIRSTTERM"
>operator
   class</I
>
   identifies the set of operations that the index method needs to use
   to work with a particular data type.  Operator classes are so
   called because one thing they specify is the set of
   <TT
CLASS="LITERAL"
>WHERE</TT
>-clause operators that can be used with an index
   (i.e., can be converted into an index-scan qualification).  An
   operator class can also specify some <I
CLASS="FIRSTTERM"
>support
   procedures</I
> that are needed by the internal operations of the
   index method, but do not directly correspond to any
   <TT
CLASS="LITERAL"
>WHERE</TT
>-clause operator that can be used with the index.
  </P
><P
>   It is possible to define multiple operator classes for the same
   data type and index method.  By doing this, multiple
   sets of indexing semantics can be defined for a single data type.
   For example, a B-tree index requires a sort ordering to be defined
   for each data type it works on.
   It might be useful for a complex-number data type
   to have one B-tree operator class that sorts the data by complex
   absolute value, another that sorts by real part, and so on.
   Typically, one of the operator classes will be deemed most commonly
   useful and will be marked as the default operator class for that
   data type and index method.
  </P
><P
>   The same operator class name
   can be used for several different index methods (for example, both B-tree
   and hash index methods have operator classes named
   <TT
CLASS="LITERAL"
>int4_ops</TT
>), but each such class is an independent
   entity and must be defined separately.
  </P
></DIV
><DIV
CLASS="SECT2"
><H2
CLASS="SECT2"
><A
NAME="XINDEX-STRATEGIES"
>35.14.2. Index Method Strategies</A
></H2
><P
>   The operators associated with an operator class are identified by
   <SPAN
CLASS="QUOTE"
>"strategy numbers"</SPAN
>, which serve to identify the semantics of
   each operator within the context of its operator class.
   For example, B-trees impose a strict ordering on keys, lesser to greater,
   and so operators like <SPAN
CLASS="QUOTE"
>"less than"</SPAN
> and <SPAN
CLASS="QUOTE"
>"greater than or equal
   to"</SPAN
> are interesting with respect to a B-tree.
   Because
   <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
> allows the user to define operators,
   <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
> cannot look at the name of an operator
   (e.g., <TT
CLASS="LITERAL"
>&lt;</TT
> or <TT
CLASS="LITERAL"
>&gt;=</TT
>) and tell what kind of
   comparison it is.  Instead, the index method defines a set of
   <SPAN
CLASS="QUOTE"
>"strategies"</SPAN
>, which can be thought of as generalized operators.
   Each operator class specifies which actual operator corresponds to each
   strategy for a particular data type and interpretation of the index
   semantics.
  </P
><P
>   The B-tree index method defines five strategies, shown in <A
HREF="xindex.html#XINDEX-BTREE-STRAT-TABLE"
>Table 35-2</A
>.
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-BTREE-STRAT-TABLE"
></A
><P
><B
>Table 35-2. B-tree Strategies</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><THEAD
><TR
><TH
>Operation</TH
><TH
>Strategy Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
>less than</TD
><TD
>1</TD
></TR
><TR
><TD
>less than or equal</TD
><TD
>2</TD
></TR
><TR
><TD
>equal</TD
><TD
>3</TD
></TR
><TR
><TD
>greater than or equal</TD
><TD
>4</TD
></TR
><TR
><TD
>greater than</TD
><TD
>5</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   Hash indexes support only equality comparisons, and so they use only one
   strategy, shown in <A
HREF="xindex.html#XINDEX-HASH-STRAT-TABLE"
>Table 35-3</A
>.
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-HASH-STRAT-TABLE"
></A
><P
><B
>Table 35-3. Hash Strategies</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><THEAD
><TR
><TH
>Operation</TH
><TH
>Strategy Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
>equal</TD
><TD
>1</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   GiST indexes are more flexible: they do not have a fixed set of
   strategies at all.  Instead, the <SPAN
CLASS="QUOTE"
>"consistency"</SPAN
> support routine
   of each particular GiST operator class interprets the strategy numbers
   however it likes.  As an example, several of the built-in GiST index
   operator classes index two-dimensional geometric objects, providing
   the <SPAN
CLASS="QUOTE"
>"R-tree"</SPAN
> strategies shown in
   <A
HREF="xindex.html#XINDEX-RTREE-STRAT-TABLE"
>Table 35-4</A
>.  Four of these are true
   two-dimensional tests (overlaps, same, contains, contained by);
   four of them consider only the X direction; and the other four
   provide the same tests in the Y direction.
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-RTREE-STRAT-TABLE"
></A
><P
><B
>Table 35-4. GiST Two-Dimensional <SPAN
CLASS="QUOTE"
>"R-tree"</SPAN
> Strategies</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><THEAD
><TR
><TH
>Operation</TH
><TH
>Strategy Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
>strictly left of</TD
><TD
>1</TD
></TR
><TR
><TD
>does not extend to right of</TD
><TD
>2</TD
></TR
><TR
><TD
>overlaps</TD
><TD
>3</TD
></TR
><TR
><TD
>does not extend to left of</TD
><TD
>4</TD
></TR
><TR
><TD
>strictly right of</TD
><TD
>5</TD
></TR
><TR
><TD
>same</TD
><TD
>6</TD
></TR
><TR
><TD
>contains</TD
><TD
>7</TD
></TR
><TR
><TD
>contained by</TD
><TD
>8</TD
></TR
><TR
><TD
>does not extend above</TD
><TD
>9</TD
></TR
><TR
><TD
>strictly below</TD
><TD
>10</TD
></TR
><TR
><TD
>strictly above</TD
><TD
>11</TD
></TR
><TR
><TD
>does not extend below</TD
><TD
>12</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   SP-GiST indexes are similar to GiST indexes in flexibility: they don't have
   a fixed set of strategies. Instead the support routines of each operator
   class interpret the strategy numbers according to the operator class's
   definition. As an example, the strategy numbers used by the built-in
   operator classes for points are shown in <A
HREF="xindex.html#XINDEX-SPGIST-POINT-STRAT-TABLE"
>Table 35-5</A
>.
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-SPGIST-POINT-STRAT-TABLE"
></A
><P
><B
>Table 35-5. SP-GiST Point Strategies</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><THEAD
><TR
><TH
>Operation</TH
><TH
>Strategy Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
>strictly left of</TD
><TD
>1</TD
></TR
><TR
><TD
>strictly right of</TD
><TD
>5</TD
></TR
><TR
><TD
>same</TD
><TD
>6</TD
></TR
><TR
><TD
>contained by</TD
><TD
>8</TD
></TR
><TR
><TD
>strictly below</TD
><TD
>10</TD
></TR
><TR
><TD
>strictly above</TD
><TD
>11</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   GIN indexes are similar to GiST and SP-GiST indexes, in that they don't
   have a fixed set of strategies either. Instead the support routines of
   each operator class interpret the strategy numbers according to the
   operator class's definition. As an example, the strategy numbers used by
   the built-in operator classes for arrays are shown in
   <A
HREF="xindex.html#XINDEX-GIN-ARRAY-STRAT-TABLE"
>Table 35-6</A
>.
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-GIN-ARRAY-STRAT-TABLE"
></A
><P
><B
>Table 35-6. GIN Array Strategies</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><THEAD
><TR
><TH
>Operation</TH
><TH
>Strategy Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
>overlap</TD
><TD
>1</TD
></TR
><TR
><TD
>contains</TD
><TD
>2</TD
></TR
><TR
><TD
>is contained by</TD
><TD
>3</TD
></TR
><TR
><TD
>equal</TD
><TD
>4</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   Notice that all the operators listed above return Boolean values.  In
   practice, all operators defined as index method search operators must
   return type <TT
CLASS="TYPE"
>boolean</TT
>, since they must appear at the top
   level of a <TT
CLASS="LITERAL"
>WHERE</TT
> clause to be used with an index.
   (Some index access methods also support <I
CLASS="FIRSTTERM"
>ordering operators</I
>,
   which typically don't return Boolean values; that feature is discussed
   in <A
HREF="xindex.html#XINDEX-ORDERING-OPS"
>Section 35.14.7</A
>.)
  </P
></DIV
><DIV
CLASS="SECT2"
><H2
CLASS="SECT2"
><A
NAME="XINDEX-SUPPORT"
>35.14.3. Index Method Support Routines</A
></H2
><P
>   Strategies aren't usually enough information for the system to figure
   out how to use an index.  In practice, the index methods require
   additional support routines in order to work. For example, the B-tree
   index method must be able to compare two keys and determine whether one
   is greater than, equal to, or less than the other.  Similarly, the
   hash index method must be able to compute hash codes for key values.
   These operations do not correspond to operators used in qualifications in
   SQL commands;  they are administrative routines used by
   the index methods, internally.
  </P
><P
>   Just as with strategies, the operator class identifies which specific
   functions should play each of these roles for a given data type and
   semantic interpretation.  The index method defines the set
   of functions it needs, and the operator class identifies the correct
   functions to use by assigning them to the <SPAN
CLASS="QUOTE"
>"support function numbers"</SPAN
>
   specified by the index method.
  </P
><P
>   B-trees require a single support function, and allow a second one to be
   supplied at the operator class author's option, as shown in <A
HREF="xindex.html#XINDEX-BTREE-SUPPORT-TABLE"
>Table 35-7</A
>.
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-BTREE-SUPPORT-TABLE"
></A
><P
><B
>Table 35-7. B-tree Support Functions</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><THEAD
><TR
><TH
>Function</TH
><TH
>Support Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
>        Compare two keys and return an integer less than zero, zero, or
        greater than zero, indicating whether the first key is less than,
        equal to, or greater than the second
       </TD
><TD
>1</TD
></TR
><TR
><TD
>        Return the addresses of C-callable sort support function(s),
        as documented in <TT
CLASS="FILENAME"
>utils/sortsupport.h</TT
> (optional)
       </TD
><TD
>2</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   Hash indexes require one support function, shown in <A
HREF="xindex.html#XINDEX-HASH-SUPPORT-TABLE"
>Table 35-8</A
>.
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-HASH-SUPPORT-TABLE"
></A
><P
><B
>Table 35-8. Hash Support Functions</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><THEAD
><TR
><TH
>Function</TH
><TH
>Support Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
>Compute the hash value for a key</TD
><TD
>1</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   GiST indexes require seven support functions, with an optional eighth, as
   shown in <A
HREF="xindex.html#XINDEX-GIST-SUPPORT-TABLE"
>Table 35-9</A
>.
   (For more information see <A
HREF="gist.html"
>Chapter 53</A
>.)
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-GIST-SUPPORT-TABLE"
></A
><P
><B
>Table 35-9. GiST Support Functions</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><COL><THEAD
><TR
><TH
>Function</TH
><TH
>Description</TH
><TH
>Support Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
><CODE
CLASS="FUNCTION"
>consistent</CODE
></TD
><TD
>determine whether key satisfies the
        query qualifier</TD
><TD
>1</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>union</CODE
></TD
><TD
>compute union of a set of keys</TD
><TD
>2</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>compress</CODE
></TD
><TD
>compute a compressed representation of a key or value
        to be indexed</TD
><TD
>3</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>decompress</CODE
></TD
><TD
>compute a decompressed representation of a
        compressed key</TD
><TD
>4</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>penalty</CODE
></TD
><TD
>compute penalty for inserting new key into subtree
       with given subtree's key</TD
><TD
>5</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>picksplit</CODE
></TD
><TD
>determine which entries of a page are to be moved
       to the new page and compute the union keys for resulting pages</TD
><TD
>6</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>equal</CODE
></TD
><TD
>compare two keys and return true if they are equal</TD
><TD
>7</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>distance</CODE
></TD
><TD
>determine distance from key to query value (optional)</TD
><TD
>8</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   SP-GiST indexes require five support functions, as
   shown in <A
HREF="xindex.html#XINDEX-SPGIST-SUPPORT-TABLE"
>Table 35-10</A
>.
   (For more information see <A
HREF="spgist.html"
>Chapter 54</A
>.)
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-SPGIST-SUPPORT-TABLE"
></A
><P
><B
>Table 35-10. SP-GiST Support Functions</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><COL><THEAD
><TR
><TH
>Function</TH
><TH
>Description</TH
><TH
>Support Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
><CODE
CLASS="FUNCTION"
>config</CODE
></TD
><TD
>provide basic information about the operator class</TD
><TD
>1</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>choose</CODE
></TD
><TD
>determine how to insert a new value into an inner tuple</TD
><TD
>2</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>picksplit</CODE
></TD
><TD
>determine how to partition a set of values</TD
><TD
>3</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>inner_consistent</CODE
></TD
><TD
>determine which sub-partitions need to be searched for a
        query</TD
><TD
>4</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>leaf_consistent</CODE
></TD
><TD
>determine whether key satisfies the
        query qualifier</TD
><TD
>5</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   GIN indexes require four support functions, with an optional fifth, as
   shown in <A
HREF="xindex.html#XINDEX-GIN-SUPPORT-TABLE"
>Table 35-11</A
>.
   (For more information see <A
HREF="gin.html"
>Chapter 55</A
>.)
  </P
><DIV
CLASS="TABLE"
><A
NAME="XINDEX-GIN-SUPPORT-TABLE"
></A
><P
><B
>Table 35-11. GIN Support Functions</B
></P
><TABLE
BORDER="1"
CLASS="CALSTABLE"
><COL><COL><COL><THEAD
><TR
><TH
>Function</TH
><TH
>Description</TH
><TH
>Support Number</TH
></TR
></THEAD
><TBODY
><TR
><TD
><CODE
CLASS="FUNCTION"
>compare</CODE
></TD
><TD
>        compare two keys and return an integer less than zero, zero,
        or greater than zero, indicating whether the first key is less than,
        equal to, or greater than the second
       </TD
><TD
>1</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>extractValue</CODE
></TD
><TD
>extract keys from a value to be indexed</TD
><TD
>2</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>extractQuery</CODE
></TD
><TD
>extract keys from a query condition</TD
><TD
>3</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>consistent</CODE
></TD
><TD
>determine whether value matches query condition</TD
><TD
>4</TD
></TR
><TR
><TD
><CODE
CLASS="FUNCTION"
>comparePartial</CODE
></TD
><TD
>        compare partial key from
        query and key from index, and return an integer less than zero, zero,
        or greater than zero, indicating whether GIN should ignore this index
        entry, treat the entry as a match, or stop the index scan (optional)
       </TD
><TD
>5</TD
></TR
></TBODY
></TABLE
></DIV
><P
>   Unlike search operators, support functions return whichever data
   type the particular index method expects; for example in the case
   of the comparison function for B-trees, a signed integer.  The number
   and types of the arguments to each support function are likewise
   dependent on the index method.  For B-tree and hash the comparison and
   hashing support functions take the same input data types as do the
   operators included in the operator class, but this is not the case for
   most GiST, SP-GiST, and GIN support functions.
  </P
></DIV
><DIV
CLASS="SECT2"
><H2
CLASS="SECT2"
><A
NAME="XINDEX-EXAMPLE"
>35.14.4. An Example</A
></H2
><P
>   Now that we have seen the ideas, here is the promised example of
   creating a new operator class.
   (You can find a working copy of this example in
   <TT
CLASS="FILENAME"
>src/tutorial/complex.c</TT
> and
   <TT
CLASS="FILENAME"
>src/tutorial/complex.sql</TT
> in the source
   distribution.)
   The operator class encapsulates
   operators that sort complex numbers in absolute value order, so we
   choose the name <TT
CLASS="LITERAL"
>complex_abs_ops</TT
>.  First, we need
   a set of operators.  The procedure for defining operators was
   discussed in <A
HREF="xoper.html"
>Section 35.12</A
>.  For an operator class on
   B-trees, the operators we require are:

   <P
></P
></P><UL
COMPACT="COMPACT"
><LI
><SPAN
>absolute-value less-than (strategy 1)</SPAN
></LI
><LI
><SPAN
>absolute-value less-than-or-equal (strategy 2)</SPAN
></LI
><LI
><SPAN
>absolute-value equal (strategy 3)</SPAN
></LI
><LI
><SPAN
>absolute-value greater-than-or-equal (strategy 4)</SPAN
></LI
><LI
><SPAN
>absolute-value greater-than (strategy 5)</SPAN
></LI
></UL
><P>
  </P
><P
>   The least error-prone way to define a related set of comparison operators
   is to write the B-tree comparison support function first, and then write the
   other functions as one-line wrappers around the support function.  This
   reduces the odds of getting inconsistent results for corner cases.
   Following this approach, we first write:

</P><PRE
CLASS="PROGRAMLISTING"
>#define Mag(c)  ((c)-&#62;x*(c)-&#62;x + (c)-&#62;y*(c)-&#62;y)

static int
complex_abs_cmp_internal(Complex *a, Complex *b)
{
    double      amag = Mag(a),
                bmag = Mag(b);

    if (amag &#60; bmag)
        return -1;
    if (amag &#62; bmag)
        return 1;
    return 0;
}</PRE
><P>

   Now the less-than function looks like:

</P><PRE
CLASS="PROGRAMLISTING"
>PG_FUNCTION_INFO_V1(complex_abs_lt);

Datum
complex_abs_lt(PG_FUNCTION_ARGS)
{
    Complex    *a = (Complex *) PG_GETARG_POINTER(0);
    Complex    *b = (Complex *) PG_GETARG_POINTER(1);

    PG_RETURN_BOOL(complex_abs_cmp_internal(a, b) &#60; 0);
}</PRE
><P>

   The other four functions differ only in how they compare the internal
   function's result to zero.
  </P
><P
>   Next we declare the functions and the operators based on the functions
   to SQL:

</P><PRE
CLASS="PROGRAMLISTING"
>CREATE FUNCTION complex_abs_lt(complex, complex) RETURNS bool
    AS '<TT
CLASS="REPLACEABLE"
><I
>filename</I
></TT
>', 'complex_abs_lt'
    LANGUAGE C IMMUTABLE STRICT;

CREATE OPERATOR &lt; (
   leftarg = complex, rightarg = complex, procedure = complex_abs_lt,
   commutator = &gt; , negator = &gt;= ,
   restrict = scalarltsel, join = scalarltjoinsel
);</PRE
><P>
   It is important to specify the correct commutator and negator operators,
   as well as suitable restriction and join selectivity
   functions, otherwise the optimizer will be unable to make effective
   use of the index.  Note that the less-than, equal, and
   greater-than cases should use different selectivity functions.
  </P
><P
>   Other things worth noting are happening here:

  <P
></P
></P><UL
><LI
><P
>     There can only be one operator named, say, <TT
CLASS="LITERAL"
>=</TT
>
     and taking type <TT
CLASS="TYPE"
>complex</TT
> for both operands.  In this
     case we don't have any other operator <TT
CLASS="LITERAL"
>=</TT
> for
     <TT
CLASS="TYPE"
>complex</TT
>, but if we were building a practical data
     type we'd probably want <TT
CLASS="LITERAL"
>=</TT
> to be the ordinary
     equality operation for complex numbers (and not the equality of
     the absolute values).  In that case, we'd need to use some other
     operator name for <CODE
CLASS="FUNCTION"
>complex_abs_eq</CODE
>.
    </P
></LI
><LI
><P
>     Although <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
> can cope with
     functions having the same SQL name as long as they have different
     argument data types, C can only cope with one global function
     having a given name.  So we shouldn't name the C function
     something simple like <TT
CLASS="FILENAME"
>abs_eq</TT
>.  Usually it's
     a good practice to include the data type name in the C function
     name, so as not to conflict with functions for other data types.
    </P
></LI
><LI
><P
>     We could have made the SQL name
     of the function <TT
CLASS="FILENAME"
>abs_eq</TT
>, relying on
     <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
> to distinguish it by
     argument data types from any other SQL function of the same name.
     To keep the example simple, we make the function have the same
     names at the C level and SQL level.
    </P
></LI
></UL
><P>
  </P
><P
>   The next step is the registration of the support routine required
   by B-trees.  The example C code that implements this is in the same
   file that contains the operator functions.  This is how we declare
   the function:

</P><PRE
CLASS="PROGRAMLISTING"
>CREATE FUNCTION complex_abs_cmp(complex, complex)
    RETURNS integer
    AS '<TT
CLASS="REPLACEABLE"
><I
>filename</I
></TT
>'
    LANGUAGE C IMMUTABLE STRICT;</PRE
><P>
  </P
><P
>   Now that we have the required operators and support routine,
   we can finally create the operator class:

</P><PRE
CLASS="PROGRAMLISTING"
>CREATE OPERATOR CLASS complex_abs_ops
    DEFAULT FOR TYPE complex USING btree AS
        OPERATOR        1       &#60; ,
        OPERATOR        2       &#60;= ,
        OPERATOR        3       = ,
        OPERATOR        4       &#62;= ,
        OPERATOR        5       &#62; ,
        FUNCTION        1       complex_abs_cmp(complex, complex);</PRE
><P>
  </P
><P
>   And we're done!  It should now be possible to create
   and use B-tree indexes on <TT
CLASS="TYPE"
>complex</TT
> columns.
  </P
><P
>   We could have written the operator entries more verbosely, as in:
</P><PRE
CLASS="PROGRAMLISTING"
>        OPERATOR        1       &lt; (complex, complex) ,</PRE
><P>
   but there is no need to do so when the operators take the same data type
   we are defining the operator class for.
  </P
><P
>   The above example assumes that you want to make this new operator class the
   default B-tree operator class for the <TT
CLASS="TYPE"
>complex</TT
> data type.
   If you don't, just leave out the word <TT
CLASS="LITERAL"
>DEFAULT</TT
>.
  </P
></DIV
><DIV
CLASS="SECT2"
><H2
CLASS="SECT2"
><A
NAME="XINDEX-OPFAMILY"
>35.14.5. Operator Classes and Operator Families</A
></H2
><P
>   So far we have implicitly assumed that an operator class deals with
   only one data type.  While there certainly can be only one data type in
   a particular index column, it is often useful to index operations that
   compare an indexed column to a value of a different data type.  Also,
   if there is use for a cross-data-type operator in connection with an
   operator class, it is often the case that the other data type has a
   related operator class of its own.  It is helpful to make the connections
   between related classes explicit, because this can aid the planner in
   optimizing SQL queries (particularly for B-tree operator classes, since
   the planner contains a great deal of knowledge about how to work with them).
  </P
><P
>   To handle these needs, <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
>
   uses the concept of an <I
CLASS="FIRSTTERM"
>operator
   family</I
>.
   An operator family contains one or more operator classes, and can also
   contain indexable operators and corresponding support functions that
   belong to the family as a whole but not to any single class within the
   family.  We say that such operators and functions are <SPAN
CLASS="QUOTE"
>"loose"</SPAN
>
   within the family, as opposed to being bound into a specific class.
   Typically each operator class contains single-data-type operators
   while cross-data-type operators are loose in the family.
  </P
><P
>   All the operators and functions in an operator family must have compatible
   semantics, where the compatibility requirements are set by the index
   method.  You might therefore wonder why bother to single out particular
   subsets of the family as operator classes; and indeed for many purposes
   the class divisions are irrelevant and the family is the only interesting
   grouping.  The reason for defining operator classes is that they specify
   how much of the family is needed to support any particular index.
   If there is an index using an operator class, then that operator class
   cannot be dropped without dropping the index &mdash; but other parts of
   the operator family, namely other operator classes and loose operators,
   could be dropped.  Thus, an operator class should be specified to contain
   the minimum set of operators and functions that are reasonably needed
   to work with an index on a specific data type, and then related but
   non-essential operators can be added as loose members of the operator
   family.
  </P
><P
>   As an example, <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
> has a built-in
   B-tree operator family <TT
CLASS="LITERAL"
>integer_ops</TT
>, which includes operator
   classes <TT
CLASS="LITERAL"
>int8_ops</TT
>, <TT
CLASS="LITERAL"
>int4_ops</TT
>, and
   <TT
CLASS="LITERAL"
>int2_ops</TT
> for indexes on <TT
CLASS="TYPE"
>bigint</TT
> (<TT
CLASS="TYPE"
>int8</TT
>),
   <TT
CLASS="TYPE"
>integer</TT
> (<TT
CLASS="TYPE"
>int4</TT
>), and <TT
CLASS="TYPE"
>smallint</TT
> (<TT
CLASS="TYPE"
>int2</TT
>)
   columns respectively.  The family also contains cross-data-type comparison
   operators allowing any two of these types to be compared, so that an index
   on one of these types can be searched using a comparison value of another
   type.  The family could be duplicated by these definitions:

</P><PRE
CLASS="PROGRAMLISTING"
>CREATE OPERATOR FAMILY integer_ops USING btree;

CREATE OPERATOR CLASS int8_ops
DEFAULT FOR TYPE int8 USING btree FAMILY integer_ops AS
  -- standard int8 comparisons
  OPERATOR 1 &#60; ,
  OPERATOR 2 &#60;= ,
  OPERATOR 3 = ,
  OPERATOR 4 &#62;= ,
  OPERATOR 5 &#62; ,
  FUNCTION 1 btint8cmp(int8, int8) ,
  FUNCTION 2 btint8sortsupport(internal) ;

CREATE OPERATOR CLASS int4_ops
DEFAULT FOR TYPE int4 USING btree FAMILY integer_ops AS
  -- standard int4 comparisons
  OPERATOR 1 &#60; ,
  OPERATOR 2 &#60;= ,
  OPERATOR 3 = ,
  OPERATOR 4 &#62;= ,
  OPERATOR 5 &#62; ,
  FUNCTION 1 btint4cmp(int4, int4) ,
  FUNCTION 2 btint4sortsupport(internal) ;

CREATE OPERATOR CLASS int2_ops
DEFAULT FOR TYPE int2 USING btree FAMILY integer_ops AS
  -- standard int2 comparisons
  OPERATOR 1 &#60; ,
  OPERATOR 2 &#60;= ,
  OPERATOR 3 = ,
  OPERATOR 4 &#62;= ,
  OPERATOR 5 &#62; ,
  FUNCTION 1 btint2cmp(int2, int2) ,
  FUNCTION 2 btint2sortsupport(internal) ;

ALTER OPERATOR FAMILY integer_ops USING btree ADD
  -- cross-type comparisons int8 vs int2
  OPERATOR 1 &#60; (int8, int2) ,
  OPERATOR 2 &#60;= (int8, int2) ,
  OPERATOR 3 = (int8, int2) ,
  OPERATOR 4 &#62;= (int8, int2) ,
  OPERATOR 5 &#62; (int8, int2) ,
  FUNCTION 1 btint82cmp(int8, int2) ,

  -- cross-type comparisons int8 vs int4
  OPERATOR 1 &#60; (int8, int4) ,
  OPERATOR 2 &#60;= (int8, int4) ,
  OPERATOR 3 = (int8, int4) ,
  OPERATOR 4 &#62;= (int8, int4) ,
  OPERATOR 5 &#62; (int8, int4) ,
  FUNCTION 1 btint84cmp(int8, int4) ,

  -- cross-type comparisons int4 vs int2
  OPERATOR 1 &#60; (int4, int2) ,
  OPERATOR 2 &#60;= (int4, int2) ,
  OPERATOR 3 = (int4, int2) ,
  OPERATOR 4 &#62;= (int4, int2) ,
  OPERATOR 5 &#62; (int4, int2) ,
  FUNCTION 1 btint42cmp(int4, int2) ,

  -- cross-type comparisons int4 vs int8
  OPERATOR 1 &#60; (int4, int8) ,
  OPERATOR 2 &#60;= (int4, int8) ,
  OPERATOR 3 = (int4, int8) ,
  OPERATOR 4 &#62;= (int4, int8) ,
  OPERATOR 5 &#62; (int4, int8) ,
  FUNCTION 1 btint48cmp(int4, int8) ,

  -- cross-type comparisons int2 vs int8
  OPERATOR 1 &#60; (int2, int8) ,
  OPERATOR 2 &#60;= (int2, int8) ,
  OPERATOR 3 = (int2, int8) ,
  OPERATOR 4 &#62;= (int2, int8) ,
  OPERATOR 5 &#62; (int2, int8) ,
  FUNCTION 1 btint28cmp(int2, int8) ,

  -- cross-type comparisons int2 vs int4
  OPERATOR 1 &#60; (int2, int4) ,
  OPERATOR 2 &#60;= (int2, int4) ,
  OPERATOR 3 = (int2, int4) ,
  OPERATOR 4 &#62;= (int2, int4) ,
  OPERATOR 5 &#62; (int2, int4) ,
  FUNCTION 1 btint24cmp(int2, int4) ;</PRE
><P>

   Notice that this definition <SPAN
CLASS="QUOTE"
>"overloads"</SPAN
> the operator strategy and
   support function numbers: each number occurs multiple times within the
   family.  This is allowed so long as each instance of a
   particular number has distinct input data types.  The instances that have
   both input types equal to an operator class's input type are the
   primary operators and support functions for that operator class,
   and in most cases should be declared as part of the operator class rather
   than as loose members of the family.
  </P
><P
>   In a B-tree operator family, all the operators in the family must sort
   compatibly, meaning that the transitive laws hold across all the data types
   supported by the family: <SPAN
CLASS="QUOTE"
>"if A = B and B = C, then A = C"</SPAN
>,
   and <SPAN
CLASS="QUOTE"
>"if A &lt; B and B &lt; C, then A &lt; C"</SPAN
>.  Moreover, implicit
   or binary coercion casts between types represented in the operator family
   must not change the associated sort ordering.  For each
   operator in the family there must be a support function having the same
   two input data types as the operator.  It is recommended that a family be
   complete, i.e., for each combination of data types, all operators are
   included.  Each operator class should include just the non-cross-type
   operators and support function for its data type.
  </P
><P
>   To build a multiple-data-type hash operator family, compatible hash
   support functions must be created for each data type supported by the
   family.  Here compatibility means that the functions are guaranteed to
   return the same hash code for any two values that are considered equal
   by the family's equality operators, even when the values are of different
   types.  This is usually difficult to accomplish when the types have
   different physical representations, but it can be done in some cases.
   Furthermore, casting a value from one data type represented in the operator
   family to another data type also represented in the operator family via
   an implicit or binary coercion cast must not change the computed hash value.
   Notice that there is only one support function per data type, not one
   per equality operator.  It is recommended that a family be complete, i.e.,
   provide an equality operator for each combination of data types.
   Each operator class should include just the non-cross-type equality
   operator and the support function for its data type.
  </P
><P
>   GiST, SP-GiST, and GIN indexes do not have any explicit notion of
   cross-data-type operations.  The set of operators supported is just
   whatever the primary support functions for a given operator class can
   handle.
  </P
><DIV
CLASS="NOTE"
><BLOCKQUOTE
CLASS="NOTE"
><P
><B
>Note: </B
>    Prior to <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
> 8.3, there was no concept
    of operator families, and so any cross-data-type operators intended to be
    used with an index had to be bound directly into the index's operator
    class.  While this approach still works, it is deprecated because it
    makes an index's dependencies too broad, and because the planner can
    handle cross-data-type comparisons more effectively when both data types
    have operators in the same operator family.
   </P
></BLOCKQUOTE
></DIV
></DIV
><DIV
CLASS="SECT2"
><H2
CLASS="SECT2"
><A
NAME="XINDEX-OPCLASS-DEPENDENCIES"
>35.14.6. System Dependencies on Operator Classes</A
></H2
><P
>   <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
> uses operator classes to infer the
   properties of operators in more ways than just whether they can be used
   with indexes.  Therefore, you might want to create operator classes
   even if you have no intention of indexing any columns of your data type.
  </P
><P
>   In particular, there are SQL features such as <TT
CLASS="LITERAL"
>ORDER BY</TT
> and
   <TT
CLASS="LITERAL"
>DISTINCT</TT
> that require comparison and sorting of values.
   To implement these features on a user-defined data type,
   <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
> looks for the default B-tree operator
   class for the data type.  The <SPAN
CLASS="QUOTE"
>"equals"</SPAN
> member of this operator
   class defines the system's notion of equality of values for
   <TT
CLASS="LITERAL"
>GROUP BY</TT
> and <TT
CLASS="LITERAL"
>DISTINCT</TT
>, and the sort ordering
   imposed by the operator class defines the default <TT
CLASS="LITERAL"
>ORDER BY</TT
>
   ordering.
  </P
><P
>   Comparison of arrays of user-defined types also relies on the semantics
   defined by the default B-tree operator class.
  </P
><P
>   If there is no default B-tree operator class for a data type, the system
   will look for a default hash operator class.  But since that kind of
   operator class only provides equality, in practice it is only enough
   to support array equality.
  </P
><P
>   When there is no default operator class for a data type, you will get
   errors like <SPAN
CLASS="QUOTE"
>"could not identify an ordering operator"</SPAN
> if you
   try to use these SQL features with the data type.
  </P
><DIV
CLASS="NOTE"
><BLOCKQUOTE
CLASS="NOTE"
><P
><B
>Note: </B
>     In <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
> versions before 7.4,
     sorting and grouping operations would implicitly use operators named
     <TT
CLASS="LITERAL"
>=</TT
>, <TT
CLASS="LITERAL"
>&lt;</TT
>, and <TT
CLASS="LITERAL"
>&gt;</TT
>.  The new
     behavior of relying on default operator classes avoids having to make
     any assumption about the behavior of operators with particular names.
    </P
></BLOCKQUOTE
></DIV
><P
>   Another important point is that an operator that
   appears in a hash operator family is a candidate for hash joins,
   hash aggregation, and related optimizations.  The hash operator family
   is essential here since it identifies the hash function(s) to use.
  </P
></DIV
><DIV
CLASS="SECT2"
><H2
CLASS="SECT2"
><A
NAME="XINDEX-ORDERING-OPS"
>35.14.7. Ordering Operators</A
></H2
><P
>   Some index access methods (currently, only GiST) support the concept of
   <I
CLASS="FIRSTTERM"
>ordering operators</I
>.  What we have been discussing so far
   are <I
CLASS="FIRSTTERM"
>search operators</I
>.  A search operator is one for which
   the index can be searched to find all rows satisfying
   <TT
CLASS="LITERAL"
>WHERE</TT
>
   <TT
CLASS="REPLACEABLE"
><I
>indexed_column</I
></TT
>
   <TT
CLASS="REPLACEABLE"
><I
>operator</I
></TT
>
   <TT
CLASS="REPLACEABLE"
><I
>constant</I
></TT
>.
   Note that nothing is promised about the order in which the matching rows
   will be returned.  In contrast, an ordering operator does not restrict the
   set of rows that can be returned, but instead determines their order.
   An ordering operator is one for which the index can be scanned to return
   rows in the order represented by
   <TT
CLASS="LITERAL"
>ORDER BY</TT
>
   <TT
CLASS="REPLACEABLE"
><I
>indexed_column</I
></TT
>
   <TT
CLASS="REPLACEABLE"
><I
>operator</I
></TT
>
   <TT
CLASS="REPLACEABLE"
><I
>constant</I
></TT
>.
   The reason for defining ordering operators that way is that it supports
   nearest-neighbor searches, if the operator is one that measures distance.
   For example, a query like
</P><PRE
CLASS="PROGRAMLISTING"
>SELECT * FROM places ORDER BY location &#60;-&#62; point '(101,456)' LIMIT 10;</PRE
><P>
   finds the ten places closest to a given target point.  A GiST index
   on the location column can do this efficiently because
   <TT
CLASS="LITERAL"
>&lt;-&gt;</TT
> is an ordering operator.
  </P
><P
>   While search operators have to return Boolean results, ordering operators
   usually return some other type, such as float or numeric for distances.
   This type is normally not the same as the data type being indexed.
   To avoid hard-wiring assumptions about the behavior of different data
   types, the definition of an ordering operator is required to name
   a B-tree operator family that specifies the sort ordering of the result
   data type.  As was stated in the previous section, B-tree operator families
   define <SPAN
CLASS="PRODUCTNAME"
>PostgreSQL</SPAN
>'s notion of ordering, so
   this is a natural representation.  Since the point <TT
CLASS="LITERAL"
>&lt;-&gt;</TT
>
   operator returns <TT
CLASS="TYPE"
>float8</TT
>, it could be specified in an operator
   class creation command like this:
</P><PRE
CLASS="PROGRAMLISTING"
>OPERATOR 15    &#60;-&#62; (point, point) FOR ORDER BY float_ops</PRE
><P>
   where <TT
CLASS="LITERAL"
>float_ops</TT
> is the built-in operator family that includes
   operations on <TT
CLASS="TYPE"
>float8</TT
>.  This declaration states that the index
   is able to return rows in order of increasing values of the
   <TT
CLASS="LITERAL"
>&lt;-&gt;</TT
> operator.
  </P
></DIV
><DIV
CLASS="SECT2"
><H2
CLASS="SECT2"
><A
NAME="XINDEX-OPCLASS-FEATURES"
>35.14.8. Special Features of Operator Classes</A
></H2
><P
>   There are two special features of operator classes that we have
   not discussed yet, mainly because they are not useful
   with the most commonly used index methods.
  </P
><P
>   Normally, declaring an operator as a member of an operator class
   (or family) means that the index method can retrieve exactly the set of rows
   that satisfy a <TT
CLASS="LITERAL"
>WHERE</TT
> condition using the operator.  For example:
</P><PRE
CLASS="PROGRAMLISTING"
>SELECT * FROM table WHERE integer_column &lt; 4;</PRE
><P>
   can be satisfied exactly by a B-tree index on the integer column.
   But there are cases where an index is useful as an inexact guide to
   the matching rows.  For example, if a GiST index stores only bounding boxes
   for geometric objects, then it cannot exactly satisfy a <TT
CLASS="LITERAL"
>WHERE</TT
>
   condition that tests overlap between nonrectangular objects such as
   polygons.  Yet we could use the index to find objects whose bounding
   box overlaps the bounding box of the target object, and then do the
   exact overlap test only on the objects found by the index.  If this
   scenario applies, the index is said to be <SPAN
CLASS="QUOTE"
>"lossy"</SPAN
> for the
   operator.  Lossy index searches are implemented by having the index
   method return a <I
CLASS="FIRSTTERM"
>recheck</I
> flag when a row might or might
   not really satisfy the query condition.  The core system will then
   test the original query condition on the retrieved row to see whether
   it should be returned as a valid match.  This approach works if
   the index is guaranteed to return all the required rows, plus perhaps
   some additional rows, which can be eliminated by performing the original
   operator invocation.  The index methods that support lossy searches
   (currently, GiST, SP-GiST and GIN) allow the support functions of individual
   operator classes to set the recheck flag, and so this is essentially an
   operator-class feature.
  </P
><P
>   Consider again the situation where we are storing in the index only
   the bounding box of a complex object such as a polygon.  In this
   case there's not much value in storing the whole polygon in the index
   entry &mdash; we might as well store just a simpler object of type
   <TT
CLASS="TYPE"
>box</TT
>.  This situation is expressed by the <TT
CLASS="LITERAL"
>STORAGE</TT
>
   option in <TT
CLASS="COMMAND"
>CREATE OPERATOR CLASS</TT
>: we'd write something like:

</P><PRE
CLASS="PROGRAMLISTING"
>CREATE OPERATOR CLASS polygon_ops
    DEFAULT FOR TYPE polygon USING gist AS
        ...
        STORAGE box;</PRE
><P>

   At present, only the GiST and GIN index methods support a
   <TT
CLASS="LITERAL"
>STORAGE</TT
> type that's different from the column data type.
   The GiST <CODE
CLASS="FUNCTION"
>compress</CODE
> and <CODE
CLASS="FUNCTION"
>decompress</CODE
> support
   routines must deal with data-type conversion when <TT
CLASS="LITERAL"
>STORAGE</TT
>
   is used.  In GIN, the <TT
CLASS="LITERAL"
>STORAGE</TT
> type identifies the type of
   the <SPAN
CLASS="QUOTE"
>"key"</SPAN
> values, which normally is different from the type
   of the indexed column &mdash; for example, an operator class for
   integer-array columns might have keys that are just integers.  The
   GIN <CODE
CLASS="FUNCTION"
>extractValue</CODE
> and <CODE
CLASS="FUNCTION"
>extractQuery</CODE
> support
   routines are responsible for extracting keys from indexed values.
  </P
></DIV
></DIV
><DIV
CLASS="NAVFOOTER"
><HR
ALIGN="LEFT"
WIDTH="100%"><TABLE
SUMMARY="Footer navigation table"
WIDTH="100%"
BORDER="0"
CELLPADDING="0"
CELLSPACING="0"
><TR
><TD
WIDTH="33%"
ALIGN="left"
VALIGN="top"
><A
HREF="xoper-optimization.html"
ACCESSKEY="P"
>Prev</A
></TD
><TD
WIDTH="34%"
ALIGN="center"
VALIGN="top"
><A
HREF="index.html"
ACCESSKEY="H"
>Home</A
></TD
><TD
WIDTH="33%"
ALIGN="right"
VALIGN="top"
><A
HREF="extend-extensions.html"
ACCESSKEY="N"
>Next</A
></TD
></TR
><TR
><TD
WIDTH="33%"
ALIGN="left"
VALIGN="top"
>Operator Optimization Information</TD
><TD
WIDTH="34%"
ALIGN="center"
VALIGN="top"
><A
HREF="extend.html"
ACCESSKEY="U"
>Up</A
></TD
><TD
WIDTH="33%"
ALIGN="right"
VALIGN="top"
>Packaging Related Objects into an Extension</TD
></TR
></TABLE
></DIV
></BODY
></HTML
>

Edit Rename Chmod Delete

FILE FOLDER

Name	Size	Permission
LEGALNOTICE.html	2681 bytes	0644
acronyms.html	16284 bytes	0644
admin.html	12564 bytes	0644
adminpack.html	7889 bytes	0644
app-clusterdb.html	10602 bytes	0644
app-createdb.html	12856 bytes	0644
app-createlang.html	9907 bytes	0644
app-createuser.html	15640 bytes	0644
app-dropdb.html	9642 bytes	0644
app-droplang.html	9638 bytes	0644
app-dropuser.html	9596 bytes	0644
app-ecpg.html	8718 bytes	0644
app-initdb.html	15405 bytes	0644
app-pg-ctl.html	22459 bytes	0644
app-pg-dumpall.html	20706 bytes	0644
app-pgbasebackup.html	19833 bytes	0644
app-pgconfig.html	11093 bytes	0644
app-pgcontroldata.html	3979 bytes	0644
app-pgdump.html	43964 bytes	0644
app-pgreceivexlog.html	11057 bytes	0644
app-pgresetxlog.html	11566 bytes	0644
app-pgrestore.html	30269 bytes	0644
app-postgres.html	31828 bytes	0644
app-postmaster.html	3005 bytes	0644
app-psql.html	138871 bytes	0644
app-reindexdb.html	11281 bytes	0644
app-vacuumdb.html	12616 bytes	0644
appendixes.html	26329 bytes	0644
applevel-consistency.html	10315 bytes	0644
archive-recovery-settings.html	7338 bytes	0644
arrays.html	28079 bytes	0644
auth-delay.html	3780 bytes	0644
auth-methods.html	36202 bytes	0644
auth-pg-hba-conf.html	29759 bytes	0644
auth-username-maps.html	8597 bytes	0644
auto-explain.html	9887 bytes	0644
backup-dump.html	15927 bytes	0644
backup-file.html	7996 bytes	0644
backup.html	4485 bytes	0644
biblio.html	11549 bytes	0644
bki-commands.html	9646 bytes	0644
bki-example.html	3049 bytes	0644
bki-format.html	3463 bytes	0644
bki-structure.html	4320 bytes	0644
bki.html	4330 bytes	0644
bookindex.html	243165 bytes	0644
btree-gin.html	4600 bytes	0644
btree-gist.html	6884 bytes	0644
bug-reporting.html	18646 bytes	0644
catalog-pg-aggregate.html	5502 bytes	0644
catalog-pg-am.html	10547 bytes	0644
catalog-pg-amop.html	7593 bytes	0644
catalog-pg-amproc.html	4885 bytes	0644
catalog-pg-attrdef.html	4364 bytes	0644
catalog-pg-attribute.html	10287 bytes	0644
catalog-pg-auth-members.html	4255 bytes	0644
catalog-pg-authid.html	6815 bytes	0644
catalog-pg-cast.html	6955 bytes	0644
catalog-pg-class.html	12661 bytes	0644
catalog-pg-collation.html	5897 bytes	0644
catalog-pg-constraint.html	11579 bytes	0644
catalog-pg-conversion.html	4430 bytes	0644
catalog-pg-database.html	7027 bytes	0644
catalog-pg-db-role-setting.html	4068 bytes	0644
catalog-pg-default-acl.html	5267 bytes	0644
catalog-pg-depend.html	8635 bytes	0644
catalog-pg-description.html	4478 bytes	0644
catalog-pg-enum.html	4716 bytes	0644
catalog-pg-extension.html	5282 bytes	0644
catalog-pg-foreign-data-wrapper.html	4945 bytes	0644
catalog-pg-foreign-server.html	4688 bytes	0644
catalog-pg-foreign-table.html	4036 bytes	0644
catalog-pg-index.html	8868 bytes	0644
catalog-pg-inherits.html	3888 bytes	0644
catalog-pg-language.html	5952 bytes	0644
catalog-pg-largeobject-metadata.html	3630 bytes	0644
catalog-pg-largeobject.html	5154 bytes	0644
catalog-pg-namespace.html	3751 bytes	0644
catalog-pg-opclass.html	5863 bytes	0644
catalog-pg-operator.html	6645 bytes	0644
catalog-pg-opfamily.html	4811 bytes	0644
catalog-pg-pltemplate.html	5364 bytes	0644
catalog-pg-proc.html	13403 bytes	0644
catalog-pg-range.html	5182 bytes	0644
catalog-pg-rewrite.html	5391 bytes	0644
catalog-pg-seclabel.html	4515 bytes	0644
catalog-pg-shdepend.html	7043 bytes	0644
catalog-pg-shdescription.html	4247 bytes	0644
catalog-pg-shseclabel.html	4404 bytes	0644
catalog-pg-statistic.html	9538 bytes	0644
catalog-pg-tablespace.html	4158 bytes	0644
catalog-pg-trigger.html	8287 bytes	0644
catalog-pg-ts-config-map.html	4193 bytes	0644
catalog-pg-ts-config.html	4481 bytes	0644
catalog-pg-ts-dict.html	4716 bytes	0644
catalog-pg-ts-parser.html	5082 bytes	0644
catalog-pg-ts-template.html	4258 bytes	0644
catalog-pg-type.html	19905 bytes	0644
catalog-pg-user-mapping.html	3847 bytes	0644
catalogs-overview.html	10431 bytes	0644
catalogs.html	10387 bytes	0644
charset.html	4162 bytes	0644
chkpass.html	4391 bytes	0644
citext.html	11148 bytes	0644
client-authentication-problems.html	4224 bytes	0644
client-authentication.html	5914 bytes	0644
client-interfaces.html	13717 bytes	0644
collation.html	14222 bytes	0644
config-setting.html	11146 bytes	0644
connect-estab.html	4315 bytes	0644
continuous-archiving.html	49830 bytes	0644
contrib-dblink-build-sql-delete.html	5451 bytes	0644
contrib-dblink-build-sql-insert.html	6052 bytes	0644
contrib-dblink-build-sql-update.html	6281 bytes	0644
contrib-dblink-cancel-query.html	3820 bytes	0644
contrib-dblink-close.html	4650 bytes	0644
contrib-dblink-connect-u.html	4482 bytes	0644
contrib-dblink-connect.html	7325 bytes	0644
contrib-dblink-disconnect.html	3718 bytes	0644
contrib-dblink-error-message.html	3508 bytes	0644
contrib-dblink-exec.html	5466 bytes	0644
contrib-dblink-fetch.html	5979 bytes	0644
contrib-dblink-function.html	8630 bytes	0644
contrib-dblink-get-connections.html	3206 bytes	0644
contrib-dblink-get-notify.html	4168 bytes	0644
contrib-dblink-get-pkey.html	4498 bytes	0644
contrib-dblink-get-result.html	6959 bytes	0644
contrib-dblink-is-busy.html	3490 bytes	0644
contrib-dblink-open.html	5464 bytes	0644
contrib-dblink-send-query.html	4170 bytes	0644
contrib-prog-client.html	3434 bytes	0644
contrib-prog-server.html	3837 bytes	0644
contrib-prog.html	3320 bytes	0644
contrib-spi.html	11236 bytes	0644
contrib.html	8904 bytes	0644
creating-cluster.html	12465 bytes	0644
cube.html	15941 bytes	0644
database-roles.html	6092 bytes	0644
datatype-binary.html	12893 bytes	0644
datatype-bit.html	5096 bytes	0644
datatype-boolean.html	5267 bytes	0644
datatype-character.html	11893 bytes	0644
datatype-datetime.html	50763 bytes	0644
datatype-enum.html	6433 bytes	0644
datatype-geometric.html	12503 bytes	0644
datatype-json.html	3439 bytes	0644
datatype-money.html	5482 bytes	0644
datatype-net-types.html	10423 bytes	0644
datatype-numeric.html	22353 bytes	0644
datatype-oid.html	9686 bytes	0644
datatype-pseudo.html	7285 bytes	0644
datatype-textsearch.html	10033 bytes	0644
datatype-uuid.html	4560 bytes	0644
datatype-xml.html	11334 bytes	0644
datatype.html	16609 bytes	0644
datetime-appendix.html	3525 bytes	0644
datetime-config-files.html	8980 bytes	0644
datetime-input-rules.html	6763 bytes	0644
datetime-keywords.html	5096 bytes	0644
datetime-units-history.html	7634 bytes	0644
dblink.html	5322 bytes	0644
ddl-alter.html	10498 bytes	0644
ddl-basics.html	7816 bytes	0644
ddl-constraints.html	22790 bytes	0644
ddl-default.html	4540 bytes	0644
ddl-depend.html	6498 bytes	0644
ddl-foreign-data.html	4485 bytes	0644
ddl-inherit.html	15308 bytes	0644
ddl-others.html	3080 bytes	0644
ddl-partitioning.html	27763 bytes	0644
ddl-priv.html	6066 bytes	0644
ddl-schemas.html	18046 bytes	0644
ddl-system-columns.html	8049 bytes	0644
ddl.html	6382 bytes	0644
dict-int.html	4793 bytes	0644
dict-xsyn.html	6481 bytes	0644
different-replication-solutions.html	14793 bytes	0644
disk-full.html	3517 bytes	0644
disk-usage.html	5661 bytes	0644
diskusage.html	2668 bytes	0644
dml-delete.html	3565 bytes	0644
dml-insert.html	5801 bytes	0644
dml-returning.html	5104 bytes	0644
dml-update.html	5556 bytes	0644
dml.html	2944 bytes	0644
docguide-authoring.html	6757 bytes	0644
docguide-build.html	15280 bytes	0644
docguide-docbook.html	3853 bytes	0644
docguide-style.html	7429 bytes	0644
docguide-toolsets.html	20683 bytes	0644
docguide.html	3624 bytes	0644
dummy-seclabel.html	4358 bytes	0644
dynamic-trace.html	27234 bytes	0644
earthdistance.html	8806 bytes	0644
ecpg-commands.html	9527 bytes	0644
ecpg-concept.html	4979 bytes	0644
ecpg-connect.html	10826 bytes	0644
ecpg-cpp.html	9624 bytes	0644
ecpg-descriptors.html	34909 bytes	0644
ecpg-develop.html	7964 bytes	0644
ecpg-dynamic.html	6515 bytes	0644
ecpg-errors.html	25737 bytes	0644
ecpg-informix-compat.html	52760 bytes	0644
ecpg-library.html	5798 bytes	0644
ecpg-lo.html	5527 bytes	0644
ecpg-pgtypes.html	54457 bytes	0644
ecpg-preproc.html	8985 bytes	0644
ecpg-process.html	5386 bytes	0644
ecpg-sql-allocate-descriptor.html	3983 bytes	0644
ecpg-sql-commands.html	4698 bytes	0644
ecpg-sql-connect.html	9375 bytes	0644
ecpg-sql-deallocate-descriptor.html	3773 bytes	0644
ecpg-sql-declare.html	5397 bytes	0644
ecpg-sql-describe.html	4595 bytes	0644
ecpg-sql-disconnect.html	4733 bytes	0644
ecpg-sql-execute-immediate.html	3877 bytes	0644
ecpg-sql-get-descriptor.html	7709 bytes	0644
ecpg-sql-open.html	4642 bytes	0644
ecpg-sql-prepare.html	4177 bytes	0644
ecpg-sql-set-autocommit.html	3333 bytes	0644
ecpg-sql-set-connection.html	3929 bytes	0644
ecpg-sql-set-descriptor.html	5505 bytes	0644
ecpg-sql-type.html	5026 bytes	0644
ecpg-sql-var.html	3539 bytes	0644
ecpg-sql-whenever.html	4686 bytes	0644
ecpg-variables.html	40283 bytes	0644
ecpg.html	10344 bytes	0644
encryption-options.html	7495 bytes	0644
errcodes-appendix.html	36965 bytes	0644
error-message-reporting.html	14124 bytes	0644
error-style-guide.html	16769 bytes	0644
event-log-registration.html	4188 bytes	0644
executor.html	6612 bytes	0644
explicit-joins.html	11019 bytes	0644
explicit-locking.html	25073 bytes	0644
extend-extensions.html	32430 bytes	0644
extend-how.html	4552 bytes	0644
extend-pgxs.html	11761 bytes	0644
extend-type-system.html	10111 bytes	0644
extend.html	9982 bytes	0644
external-admin-tools.html	2722 bytes	0644
external-extensions.html	3263 bytes	0644
external-interfaces.html	5513 bytes	0644
external-pl.html	4670 bytes	0644
external-projects.html	3004 bytes	0644
fdw-callbacks.html	12905 bytes	0644
fdw-functions.html	4496 bytes	0644
fdw-helpers.html	5988 bytes	0644
fdw-planning.html	9845 bytes	0644
fdwhandler.html	3990 bytes	0644
features-sql-standard.html	39105 bytes	0644
features.html	7566 bytes	0644
file-fdw.html	7709 bytes	0644
functions-admin.html	50395 bytes	0644
functions-aggregate.html	21814 bytes	0644
functions-array.html	13521 bytes	0644
functions-binarystring.html	12588 bytes	0644
functions-bitstring.html	6786 bytes	0644
functions-comparison.html	10638 bytes	0644
functions-comparisons.html	13531 bytes	0644
functions-conditional.html	11007 bytes	0644
functions-datetime.html	48303 bytes	0644
functions-enum.html	5491 bytes	0644
functions-formatting.html	35401 bytes	0644
functions-geometry.html	20347 bytes	0644
functions-info.html	58658 bytes	0644
functions-json.html	3814 bytes	0644
functions-logical.html	4665 bytes	0644
functions-matching.html	75728 bytes	0644
functions-math.html	20401 bytes	0644
functions-net.html	13502 bytes	0644
functions-range.html	10857 bytes	0644
functions-sequence.html	12925 bytes	0644
functions-srf.html	8840 bytes	0644
functions-string.html	59052 bytes	0644
functions-subquery.html	16381 bytes	0644
functions-textsearch.html	20488 bytes	0644
functions-trigger.html	4548 bytes	0644
functions-window.html	12085 bytes	0644
functions-xml.html	32169 bytes	0644
functions.html	9939 bytes	0644
fuzzystrmatch.html	8061 bytes	0644
geqo-biblio.html	3459 bytes	0644
geqo-intro.html	4415 bytes	0644
geqo-intro2.html	5627 bytes	0644
geqo-pg-intro.html	8785 bytes	0644
geqo.html	3616 bytes	0644
gin-examples.html	3322 bytes	0644
gin-extensibility.html	14402 bytes	0644
gin-implementation.html	6564 bytes	0644
gin-intro.html	4662 bytes	0644
gin-limit.html	2817 bytes	0644
gin-tips.html	5713 bytes	0644
gin.html	2929 bytes	0644
gist-examples.html	3752 bytes	0644
gist-extensibility.html	24354 bytes	0644
gist-implementation.html	4101 bytes	0644
gist-intro.html	3616 bytes	0644
gist.html	2679 bytes	0644
git.html	4564 bytes	0644
high-availability.html	7698 bytes	0644
history.html	11918 bytes	0644
hot-standby.html	36045 bytes	0644
hstore.html	22629 bytes	0644
index-catalog.html	7996 bytes	0644
index-cost-estimation.html	9991 bytes	0644
index-functions.html	19114 bytes	0644
index-locking.html	8049 bytes	0644
index-scanning.html	10707 bytes	0644
index-unique-checks.html	9192 bytes	0644
index.html	8071 bytes	0644
indexam.html	5247 bytes	0644
indexes-bitmap-scans.html	6580 bytes	0644
indexes-collations.html	3640 bytes	0644
indexes-examine.html	7161 bytes	0644
indexes-expressional.html	4813 bytes	0644
indexes-intro.html	6313 bytes	0644
indexes-multicolumn.html	6298 bytes	0644
indexes-opclass.html	7336 bytes	0644
indexes-ordering.html	6480 bytes	0644
indexes-partial.html	11812 bytes	0644
indexes-types.html	10233 bytes	0644
indexes-unique.html	4002 bytes	0644
indexes.html	3619 bytes	0644
information-schema.html	11177 bytes	0644
infoschema-administrable-role-authorizations.html	3751 bytes	0644
infoschema-applicable-roles.html	3970 bytes	0644
infoschema-attributes.html	12807 bytes	0644
infoschema-character-sets.html	7050 bytes	0644
infoschema-check-constraint-routine-usage.html	4349 bytes	0644
infoschema-check-constraints.html	3876 bytes	0644
infoschema-collation-character-set-applicab.html	4425 bytes	0644
infoschema-collations.html	3885 bytes	0644
infoschema-column-domain-usage.html	4322 bytes	0644
infoschema-column-options.html	4109 bytes	0644
infoschema-column-privileges.html	5029 bytes	0644
infoschema-column-udt-usage.html	4583 bytes	0644
infoschema-columns.html	17625 bytes	0644
infoschema-constraint-column-usage.html	4873 bytes	0644
infoschema-constraint-table-usage.html	4774 bytes	0644
infoschema-data-type-privileges.html	5089 bytes	0644
infoschema-datatypes.html	4229 bytes	0644
infoschema-domain-constraints.html	4664 bytes	0644
infoschema-domain-udt-usage.html	4171 bytes	0644
infoschema-domains.html	11367 bytes	0644
infoschema-element-types.html	11374 bytes	0644
infoschema-enabled-roles.html	3780 bytes	0644
infoschema-foreign-data-wrapper-options.html	3910 bytes	0644
infoschema-foreign-data-wrappers.html	4227 bytes	0644
infoschema-foreign-server-options.html	3853 bytes	0644
infoschema-foreign-servers.html	4571 bytes	0644
infoschema-foreign-table-options.html	3974 bytes	0644
infoschema-foreign-tables.html	4072 bytes	0644
infoschema-information-schema-catalog-name.html	3357 bytes	0644
infoschema-key-column-usage.html	5185 bytes	0644
infoschema-parameters.html	10799 bytes	0644
infoschema-referential-constraints.html	5664 bytes	0644
infoschema-role-column-grants.html	5017 bytes	0644
infoschema-role-routine-grants.html	5360 bytes	0644
infoschema-role-table-grants.html	5427 bytes	0644
infoschema-role-udt-grants.html	4781 bytes	0644
infoschema-role-usage-grants.html	5010 bytes	0644
infoschema-routine-privileges.html	5032 bytes	0644
infoschema-routines.html	23052 bytes	0644
infoschema-schema.html	3180 bytes	0644
infoschema-schemata.html	4248 bytes	0644
infoschema-sequences.html	6111 bytes	0644
infoschema-sql-features.html	4708 bytes	0644
infoschema-sql-implementation-info.html	4503 bytes	0644
infoschema-sql-languages.html	5094 bytes	0644
infoschema-sql-packages.html	4178 bytes	0644
infoschema-sql-parts.html	4080 bytes	0644
infoschema-sql-sizing-profiles.html	4177 bytes	0644
infoschema-sql-sizing.html	4101 bytes	0644
infoschema-table-constraints.html	4914 bytes	0644
infoschema-table-privileges.html	5097 bytes	0644
infoschema-tables.html	5957 bytes	0644
infoschema-triggered-update-columns.html	4554 bytes	0644
infoschema-triggers.html	9447 bytes	0644
infoschema-udt-privileges.html	4509 bytes	0644
infoschema-usage-privileges.html	5512 bytes	0644
infoschema-user-defined-types.html	9753 bytes	0644
infoschema-user-mapping-options.html	4449 bytes	0644
infoschema-user-mappings.html	3833 bytes	0644
infoschema-view-column-usage.html	4728 bytes	0644
infoschema-view-routine-usage.html	4368 bytes	0644
infoschema-view-table-usage.html	4389 bytes	0644
infoschema-views.html	5529 bytes	0644
install-getsource.html	3574 bytes	0644
install-post.html	8076 bytes	0644
install-procedure.html	46527 bytes	0644
install-requirements.html	14481 bytes	0644
install-short.html	2870 bytes	0644
install-windows-full.html	19274 bytes	0644
install-windows-libpq.html	6283 bytes	0644
install-windows.html	6620 bytes	0644
installation-platform-notes.html	39380 bytes	0644
installation.html	4160 bytes	0644
intagg.html	6254 bytes	0644
intarray.html	13757 bytes	0644
internals.html	15638 bytes	0644
intro-whatis.html	4011 bytes	0644
isn.html	13356 bytes	0644
kernel-resources.html	37822 bytes	0644
largeobjects.html	4675 bytes	0644
libpq-async.html	21020 bytes	0644
libpq-build.html	6369 bytes	0644
libpq-cancel.html	6777 bytes	0644
libpq-connect.html	51248 bytes	0644
libpq-control.html	6280 bytes	0644
libpq-copy.html	22442 bytes	0644
libpq-envars.html	9820 bytes	0644
libpq-events.html	23093 bytes	0644
libpq-example.html	16024 bytes	0644
libpq-exec.html	64877 bytes	0644
libpq-fastpath.html	6124 bytes	0644
libpq-ldap.html	5506 bytes	0644
libpq-misc.html	13815 bytes	0644
libpq-notice-processing.html	6284 bytes	0644
libpq-notify.html	6715 bytes	0644
libpq-pgpass.html	4861 bytes	0644
libpq-pgservice.html	3905 bytes	0644
libpq-single-row-mode.html	6353 bytes	0644
libpq-ssl.html	19972 bytes	0644
libpq-status.html	17695 bytes	0644
libpq-threading.html	5544 bytes	0644
libpq.html	7918 bytes	0644
lo-examplesect.html	8696 bytes	0644
lo-funcs.html	4640 bytes	0644
lo-implementation.html	3353 bytes	0644
lo-interfaces.html	15155 bytes	0644
lo-intro.html	3206 bytes	0644
lo.html	6627 bytes	0644
locale.html	13691 bytes	0644
locking-indexes.html	4350 bytes	0644
log-shipping-alternative.html	11057 bytes	0644
logfile-maintenance.html	7143 bytes	0644
ltree.html	27295 bytes	0644
maintenance.html	5538 bytes	0644
manage-ag-config.html	3746 bytes	0644
manage-ag-createdb.html	6310 bytes	0644
manage-ag-dropdb.html	3605 bytes	0644
manage-ag-overview.html	5144 bytes	0644
manage-ag-tablespaces.html	9250 bytes	0644
manage-ag-templatedbs.html	8162 bytes	0644
managing-databases.html	3273 bytes	0644
monitoring-locks.html	3673 bytes	0644
monitoring-ps.html	6782 bytes	0644
monitoring-stats.html	58063 bytes	0644
monitoring.html	4458 bytes	0644
multibyte.html	31965 bytes	0644
mvcc-caveats.html	4077 bytes	0644
mvcc-intro.html	4552 bytes	0644
mvcc.html	4302 bytes	0644
nls-programmer.html	10078 bytes	0644
nls-translator.html	14522 bytes	0644
nls.html	3134 bytes	0644
non-durability.html	4484 bytes	0644
notation.html	4415 bytes	0644
oid2name.html	11962 bytes	0644
overview.html	4093 bytes	0644
pageinspect.html	8117 bytes	0644
parser-stage.html	8117 bytes	0644
passwordcheck.html	4788 bytes	0644
performance-tips.html	4501 bytes	0644
perm-functions.html	3338 bytes	0644
pgarchivecleanup.html	8999 bytes	0644
pgbench.html	30833 bytes	0644
pgbuffercache.html	7715 bytes	0644
pgcrypto.html	38804 bytes	0644
pgfreespacemap.html	5230 bytes	0644
pgrowlocks.html	6078 bytes	0644
pgstandby.html	15204 bytes	0644
pgstatstatements.html	16068 bytes	0644
pgstattuple.html	9449 bytes	0644
pgtestfsync.html	5254 bytes	0644
pgtesttiming.html	12476 bytes	0644
pgtrgm.html	12333 bytes	0644
pgupgrade.html	24737 bytes	0644
planner-optimizer.html	9396 bytes	0644
planner-stats-details.html	3276 bytes	0644
planner-stats-security.html	5556 bytes	0644
planner-stats.html	9058 bytes	0644
plhandler.html	13748 bytes	0644
plperl-builtins.html	18276 bytes	0644
plperl-data.html	2878 bytes	0644
plperl-funcs.html	13369 bytes	0644
plperl-global.html	5067 bytes	0644
plperl-triggers.html	6446 bytes	0644
plperl-trusted.html	6712 bytes	0644
plperl-under-the-hood.html	8991 bytes	0644
plperl.html	4930 bytes	0644
plpgsql-control-structures.html	46183 bytes	0644
plpgsql-cursors.html	25586 bytes	0644
plpgsql-declarations.html	21746 bytes	0644
plpgsql-development-tips.html	9511 bytes	0644
plpgsql-errors-and-messages.html	10094 bytes	0644
plpgsql-expressions.html	4662 bytes	0644
plpgsql-implementation.html	18043 bytes	0644
plpgsql-overview.html	9032 bytes	0644
plpgsql-porting.html	27094 bytes	0644
plpgsql-statements.html	32221 bytes	0644
plpgsql-structure.html	8329 bytes	0644
plpgsql-trigger.html	22322 bytes	0644
plpgsql.html	6965 bytes	0644
plpython-data.html	14648 bytes	0644
plpython-database.html	15413 bytes	0644
plpython-do.html	2771 bytes	0644
plpython-envar.html	3885 bytes	0644
plpython-funcs.html	5478 bytes	0644
plpython-python23.html	7207 bytes	0644
plpython-sharing.html	3032 bytes	0644
plpython-subtransaction.html	7888 bytes	0644
plpython-trigger.html	5069 bytes	0644
plpython-util.html	5104 bytes	0644
plpython.html	6067 bytes	0644
pltcl-data.html	2906 bytes	0644
pltcl-dbaccess.html	13902 bytes	0644
pltcl-functions.html	6177 bytes	0644
pltcl-global.html	5066 bytes	0644
pltcl-overview.html	5288 bytes	0644
pltcl-procnames.html	3222 bytes	0644
pltcl-trigger.html	9452 bytes	0644
pltcl-unknown.html	5075 bytes	0644
pltcl.html	3400 bytes	0644
populate.html	17114 bytes	0644
postgres-user.html	3314 bytes	0644
preface.html	5070 bytes	0644
preventing-server-spoofing.html	4604 bytes	0644
protocol-changes.html	6650 bytes	0644
protocol-error-fields.html	6131 bytes	0644
protocol-flow.html	46202 bytes	0644
protocol-message-formats.html	40844 bytes	0644
protocol-message-types.html	4933 bytes	0644
protocol-overview.html	9670 bytes	0644
protocol-replication.html	14666 bytes	0644
protocol.html	5652 bytes	0644
queries-limit.html	5335 bytes	0644
queries-order.html	7369 bytes	0644
queries-overview.html	5068 bytes	0644
queries-select-lists.html	9308 bytes	0644
queries-table-expressions.html	39874 bytes	0644
queries-union.html	5114 bytes	0644
queries-values.html	4930 bytes	0644
queries-with.html	20880 bytes	0644
queries.html	4418 bytes	0644
query-path.html	5470 bytes	0644
querytree.html	11136 bytes	0644
rangetypes.html	22735 bytes	0644
recovery-config.html	3550 bytes	0644
recovery-target-settings.html	7762 bytes	0644
reference-client.html	6102 bytes	0644
reference-server.html	3964 bytes	0644
reference.html	23162 bytes	0644
regress-coverage.html	3325 bytes	0644
regress-evaluation.html	12487 bytes	0644
regress-run.html	13710 bytes	0644
regress-variant.html	7177 bytes	0644
regress.html	4277 bytes	0644
release-0-01.html	2555 bytes	0644
release-0-02.html	4292 bytes	0644
release-0-03.html	7798 bytes	0644
release-1-0.html	4229 bytes	0644
release-1-01.html	9346 bytes	0644
release-1-02.html	6489 bytes	0644
release-1-09.html	2525 bytes	0644
release-6-0.html	7920 bytes	0644
release-6-1-1.html	3719 bytes	0644
release-6-1.html	9025 bytes	0644
release-6-2-1.html	4405 bytes	0644
release-6-2.html	8883 bytes	0644
release-6-3-1.html	4444 bytes	0644
release-6-3-2.html	4157 bytes	0644
release-6-3.html	16311 bytes	0644
release-6-4-1.html	4061 bytes	0644
release-6-4-2.html	2908 bytes	0644
release-6-4.html	14732 bytes	0644
release-6-5-1.html	3842 bytes	0644
release-6-5-2.html	4102 bytes	0644
release-6-5-3.html	3053 bytes	0644
release-6-5.html	17387 bytes	0644
release-7-0-1.html	3920 bytes	0644
release-7-0-2.html	2887 bytes	0644
release-7-0-3.html	4656 bytes	0644
release-7-0.html	23104 bytes	0644
release-7-1-1.html	3262 bytes	0644
release-7-1-2.html	2975 bytes	0644
release-7-1-3.html	3139 bytes	0644
release-7-1.html	13017 bytes	0644
release-7-2-1.html	4011 bytes	0644
release-7-2-2.html	3793 bytes	0644
release-7-2-3.html	3364 bytes	0644
release-7-2-4.html	3587 bytes	0644
release-7-2-5.html	3746 bytes	0644
release-7-2-6.html	3624 bytes	0644
release-7-2-7.html	3726 bytes	0644
release-7-2-8.html	3948 bytes	0644
release-7-2.html	27098 bytes	0644
release-7-3-1.html	4168 bytes	0644
release-7-3-10.html	7493 bytes	0644
release-7-3-11.html	4111 bytes	0644
release-7-3-12.html	3527 bytes	0644
release-7-3-13.html	4618 bytes	0644
release-7-3-14.html	3931 bytes	0644
release-7-3-15.html	6315 bytes	0644
release-7-3-16.html	3424 bytes	0644
release-7-3-17.html	3550 bytes	0644
release-7-3-18.html	3647 bytes	0644
release-7-3-19.html	3686 bytes	0644
release-7-3-2.html	5205 bytes	0644
release-7-3-20.html	3524 bytes	0644
release-7-3-21.html	6216 bytes	0644
release-7-3-3.html	10290 bytes	0644
release-7-3-4.html	3502 bytes	0644
release-7-3-5.html	4493 bytes	0644
release-7-3-6.html	4428 bytes	0644
release-7-3-7.html	3352 bytes	0644
release-7-3-8.html	3571 bytes	0644
release-7-3-9.html	4079 bytes	0644
release-7-3.html	33053 bytes	0644
release-7-4-1.html	7116 bytes	0644
release-7-4-10.html	3806 bytes	0644
release-7-4-11.html	4857 bytes	0644
release-7-4-12.html	4221 bytes	0644
release-7-4-13.html	6961 bytes	0644
release-7-4-14.html	3673 bytes	0644
release-7-4-15.html	4270 bytes	0644
release-7-4-16.html	3972 bytes	0644
release-7-4-17.html	4013 bytes	0644
release-7-4-18.html	3927 bytes	0644
release-7-4-19.html	7242 bytes	0644
release-7-4-2.html	8260 bytes	0644
release-7-4-20.html	6605 bytes	0644
release-7-4-21.html	3922 bytes	0644
release-7-4-22.html	4071 bytes	0644
release-7-4-23.html	4423 bytes	0644
release-7-4-24.html	4289 bytes	0644
release-7-4-25.html	4506 bytes	0644
release-7-4-26.html	5455 bytes	0644
release-7-4-27.html	5164 bytes	0644
release-7-4-28.html	5629 bytes	0644
release-7-4-29.html	6960 bytes	0644
release-7-4-3.html	4615 bytes	0644
release-7-4-30.html	6211 bytes	0644
release-7-4-4.html	4085 bytes	0644
release-7-4-5.html	3194 bytes	0644
release-7-4-6.html	4731 bytes	0644
release-7-4-7.html	4274 bytes	0644
release-7-4-8.html	10156 bytes	0644
release-7-4-9.html	5118 bytes	0644
release-7-4.html	57378 bytes	0644
release-8-0-1.html	4744 bytes	0644
release-8-0-10.html	4751 bytes	0644
release-8-0-11.html	3969 bytes	0644
release-8-0-12.html	3134 bytes	0644
release-8-0-13.html	4118 bytes	0644
release-8-0-14.html	4518 bytes	0644
release-8-0-15.html	9101 bytes	0644
release-8-0-16.html	8946 bytes	0644
release-8-0-17.html	3920 bytes	0644
release-8-0-18.html	5579 bytes	0644
release-8-0-19.html	4976 bytes	0644
release-8-0-2.html	9566 bytes	0644
release-8-0-20.html	4312 bytes	0644
release-8-0-21.html	4504 bytes	0644
release-8-0-22.html	6440 bytes	0644
release-8-0-23.html	6023 bytes	0644
release-8-0-24.html	7002 bytes	0644
release-8-0-25.html	7427 bytes	0644
release-8-0-26.html	8026 bytes	0644
release-8-0-3.html	7425 bytes	0644
release-8-0-4.html	6680 bytes	0644
release-8-0-5.html	4816 bytes	0644
release-8-0-6.html	5694 bytes	0644
release-8-0-7.html	5909 bytes	0644
release-8-0-8.html	7225 bytes	0644
release-8-0-9.html	4306 bytes	0644
release-8-0.html	66818 bytes	0644
release-8-1-1.html	5459 bytes	0644
release-8-1-10.html	4781 bytes	0644
release-8-1-11.html	9946 bytes	0644
release-8-1-12.html	9341 bytes	0644
release-8-1-13.html	4292 bytes	0644
release-8-1-14.html	6901 bytes	0644
release-8-1-15.html	6274 bytes	0644
release-8-1-16.html	5278 bytes	0644
release-8-1-17.html	6035 bytes	0644
release-8-1-18.html	6442 bytes	0644
release-8-1-19.html	6612 bytes	0644
release-8-1-2.html	6335 bytes	0644
release-8-1-20.html	7298 bytes	0644
release-8-1-21.html	7213 bytes	0644
release-8-1-22.html	8324 bytes	0644
release-8-1-23.html	7933 bytes	0644
release-8-1-3.html	7026 bytes	0644
release-8-1-4.html	8873 bytes	0644
release-8-1-5.html	5479 bytes	0644
release-8-1-6.html	5337 bytes	0644
release-8-1-7.html	4558 bytes	0644
release-8-1-8.html	3116 bytes	0644
release-8-1-9.html	4388 bytes	0644
release-8-1.html	62113 bytes	0644
release-8-2-1.html	5065 bytes	0644
release-8-2-10.html	8180 bytes	0644
release-8-2-11.html	7147 bytes	0644
release-8-2-12.html	6748 bytes	0644
release-8-2-13.html	7348 bytes	0644
release-8-2-14.html	7876 bytes	0644
release-8-2-15.html	8155 bytes	0644
release-8-2-16.html	9293 bytes	0644
release-8-2-17.html	8214 bytes	0644
release-8-2-18.html	10277 bytes	0644
release-8-2-19.html	8589 bytes	0644
release-8-2-2.html	5802 bytes	0644
release-8-2-20.html	6244 bytes	0644
release-8-2-21.html	5593 bytes	0644
release-8-2-22.html	9617 bytes	0644
release-8-2-23.html	9559 bytes	0644
release-8-2-3.html	3095 bytes	0644
release-8-2-4.html	5428 bytes	0644
release-8-2-5.html	5995 bytes	0644
release-8-2-6.html	10551 bytes	0644
release-8-2-7.html	9311 bytes	0644
release-8-2-8.html	7521 bytes	0644
release-8-2-9.html	4281 bytes	0644
release-8-2.html	69398 bytes	0644
release-8-3-1.html	10585 bytes	0644
release-8-3-10.html	10725 bytes	0644
release-8-3-11.html	8963 bytes	0644
release-8-3-12.html	12119 bytes	0644
release-8-3-13.html	9506 bytes	0644
release-8-3-14.html	6242 bytes	0644
release-8-3-15.html	6381 bytes	0644
release-8-3-16.html	11015 bytes	0644
release-8-3-17.html	10590 bytes	0644
release-8-3-18.html	11265 bytes	0644
release-8-3-19.html	8466 bytes	0644
release-8-3-2.html	12203 bytes	0644
release-8-3-20.html	9251 bytes	0644
release-8-3-21.html	5034 bytes	0644
release-8-3-22.html	10585 bytes	0644
release-8-3-23.html	6284 bytes	0644
release-8-3-3.html	4275 bytes	0644
release-8-3-4.html	11273 bytes	0644
release-8-3-5.html	8689 bytes	0644
release-8-3-6.html	9197 bytes	0644
release-8-3-7.html	9729 bytes	0644
release-8-3-8.html	9260 bytes	0644
release-8-3-9.html	10206 bytes	0644
release-8-3.html	69773 bytes	0644
release-8-4-1.html	9563 bytes	0644
release-8-4-10.html	11932 bytes	0644
release-8-4-11.html	13787 bytes	0644
release-8-4-12.html	9987 bytes	0644
release-8-4-13.html	9714 bytes	0644
release-8-4-14.html	5117 bytes	0644
release-8-4-15.html	10626 bytes	0644
release-8-4-16.html	7329 bytes	0644
release-8-4-17.html	9572 bytes	0644
release-8-4-18.html	7048 bytes	0644
release-8-4-19.html	7780 bytes	0644
release-8-4-2.html	15697 bytes	0644
release-8-4-20.html	16258 bytes	0644
release-8-4-21.html	5450 bytes	0644
release-8-4-22.html	11306 bytes	0644
release-8-4-3.html	13928 bytes	0644
release-8-4-4.html	10736 bytes	0644
release-8-4-5.html	15933 bytes	0644
release-8-4-6.html	10430 bytes	0644
release-8-4-7.html	6220 bytes	0644
release-8-4-8.html	8850 bytes	0644
release-8-4-9.html	14528 bytes	0644
release-8-4.html	87976 bytes	0644
release-9-0-1.html	5946 bytes	0644
release-9-0-10.html	5693 bytes	0644
release-9-0-11.html	12666 bytes	0644
release-9-0-12.html	8824 bytes	0644
release-9-0-13.html	11671 bytes	0644
release-9-0-14.html	8759 bytes	0644
release-9-0-15.html	9147 bytes	0644
release-9-0-16.html	17408 bytes	0644
release-9-0-17.html	6335 bytes	0644
release-9-0-18.html	11879 bytes	0644
release-9-0-19.html	26610 bytes	0644
release-9-0-2.html	13636 bytes	0644
release-9-0-20.html	15836 bytes	0644
release-9-0-21.html	5166 bytes	0644
release-9-0-22.html	4321 bytes	0644
release-9-0-23.html	16158 bytes	0644
release-9-0-3.html	7256 bytes	0644
release-9-0-4.html	11345 bytes	0644
release-9-0-5.html	17915 bytes	0644
release-9-0-6.html	13426 bytes	0644
release-9-0-7.html	18091 bytes	0644
release-9-0-8.html	10993 bytes	0644
release-9-0-9.html	11743 bytes	0644
release-9-0.html	96127 bytes	0644
release-9-1-1.html	3670 bytes	0644
release-9-1-10.html	10352 bytes	0644
release-9-1-11.html	9584 bytes	0644
release-9-1-12.html	18554 bytes	0644
release-9-1-13.html	6685 bytes	0644
release-9-1-14.html	13036 bytes	0644
release-9-1-15.html	28969 bytes	0644
release-9-1-16.html	19119 bytes	0644
release-9-1-17.html	4947 bytes	0644
release-9-1-18.html	4102 bytes	0644
release-9-1-19.html	17617 bytes	0644
release-9-1-2.html	21571 bytes	0644
release-9-1-20.html	17541 bytes	0644
release-9-1-21.html	7601 bytes	0644
release-9-1-22.html	7258 bytes	0644
release-9-1-23.html	12653 bytes	0644
release-9-1-24.html	8731 bytes	0644
release-9-1-3.html	21153 bytes	0644
release-9-1-4.html	16018 bytes	0644
release-9-1-5.html	14042 bytes	0644
release-9-1-6.html	9521 bytes	0644
release-9-1-7.html	14941 bytes	0644
release-9-1-8.html	10154 bytes	0644
release-9-1-9.html	12679 bytes	0644
release-9-1.html	78963 bytes	0644
release-9-2-1.html	7111 bytes	0644
release-9-2-10.html	32368 bytes	0644
release-9-2-11.html	20298 bytes	0644
release-9-2-12.html	5130 bytes	0644
release-9-2-13.html	4102 bytes	0644
release-9-2-14.html	18386 bytes	0644
release-9-2-15.html	18605 bytes	0644
release-9-2-16.html	7598 bytes	0644
release-9-2-17.html	8195 bytes	0644
release-9-2-18.html	12718 bytes	0644
release-9-2-19.html	10514 bytes	0644
release-9-2-2.html	23001 bytes	0644
release-9-2-20.html	13332 bytes	0644
release-9-2-21.html	14198 bytes	0644
release-9-2-22.html	15865 bytes	0644
release-9-2-23.html	8126 bytes	0644
release-9-2-24.html	7877 bytes	0644
release-9-2-3.html	13373 bytes	0644
release-9-2-4.html	14800 bytes	0644
release-9-2-5.html	12005 bytes	0644
release-9-2-6.html	11684 bytes	0644
release-9-2-7.html	20022 bytes	0644
release-9-2-8.html	7375 bytes	0644
release-9-2-9.html	15615 bytes	0644
release-9-2.html	79519 bytes	0644
release.html	22882 bytes	0644
resources.html	4226 bytes	0644
role-attributes.html	7855 bytes	0644
role-membership.html	8390 bytes	0644
role-removal.html	5303 bytes	0644
routine-reindex.html	3628 bytes	0644
routine-vacuuming.html	38023 bytes	0644
row-estimation-examples.html	20767 bytes	0644
rowtypes.html	23412 bytes	0644
rule-system.html	4117 bytes	0644
rules-privileges.html	11663 bytes	0644
rules-status.html	4512 bytes	0644
rules-triggers.html	9476 bytes	0644
rules-update.html	32615 bytes	0644
rules-views.html	26888 bytes	0644
rules.html	4948 bytes	0644
runtime-config-autovacuum.html	10974 bytes	0644
runtime-config-client.html	32815 bytes	0644
runtime-config-compatible.html	14827 bytes	0644
runtime-config-connection.html	23478 bytes	0644
runtime-config-custom.html	3548 bytes	0644
runtime-config-developer.html	14070 bytes	0644
runtime-config-error-handling.html	3570 bytes	0644
runtime-config-file-locations.html	6977 bytes	0644
runtime-config-locks.html	7634 bytes	0644
runtime-config-logging.html	45446 bytes	0644
runtime-config-preset.html	8710 bytes	0644
runtime-config-query.html	24950 bytes	0644
runtime-config-replication.html	18294 bytes	0644
runtime-config-resource.html	27901 bytes	0644
runtime-config-short.html	6683 bytes	0644
runtime-config-statistics.html	8616 bytes	0644
runtime-config-wal.html	27093 bytes	0644
runtime-config.html	8249 bytes	0644
runtime.html	5241 bytes	0644
seg.html	15470 bytes	0644
sepgsql.html	30829 bytes	0644
server-programming.html	9618 bytes	0644
server-shutdown.html	6469 bytes	0644
server-start.html	14217 bytes	0644
source-format.html	5133 bytes	0644
source.html	4071 bytes	0644
sourcerepo.html	3411 bytes	0644
spgist-examples.html	2703 bytes	0644
spgist-extensibility.html	31282 bytes	0644
spgist-implementation.html	8098 bytes	0644
spgist-intro.html	4323 bytes	0644
spgist.html	2966 bytes	0644
spi-examples.html	6217 bytes	0644
spi-interface-support.html	3770 bytes	0644
spi-interface.html	5998 bytes	0644
spi-memory.html	7089 bytes	0644
spi-realloc.html	3627 bytes	0644
spi-spi-connect.html	4052 bytes	0644
spi-spi-copytuple.html	3453 bytes	0644
spi-spi-cursor-close.html	3336 bytes	0644
spi-spi-cursor-fetch.html	4110 bytes	0644
spi-spi-cursor-find.html	3464 bytes	0644
spi-spi-cursor-move.html	3890 bytes	0644
spi-spi-cursor-open-with-args.html	6178 bytes	0644
spi-spi-cursor-open-with-paramlist.html	5035 bytes	0644
spi-spi-cursor-open.html	5732 bytes	0644
spi-spi-exec.html	3591 bytes	0644
spi-spi-execp.html	4866 bytes	0644
spi-spi-execute-plan-with-paramlist.html	4893 bytes	0644
spi-spi-execute-plan.html	5901 bytes	0644
spi-spi-execute-with-args.html	6221 bytes	0644
spi-spi-execute.html	12598 bytes	0644
spi-spi-finish.html	3655 bytes	0644
spi-spi-fname.html	3767 bytes	0644
spi-spi-fnumber.html	3936 bytes	0644
spi-spi-freeplan.html	3505 bytes	0644
spi-spi-freetuple.html	3277 bytes	0644
spi-spi-freetupletable.html	3628 bytes	0644
spi-spi-getargcount.html	3698 bytes	0644
spi-spi-getargtypeid.html	4141 bytes	0644
spi-spi-getbinval.html	4287 bytes	0644
spi-spi-getnspname.html	3467 bytes	0644
spi-spi-getrelname.html	3351 bytes	0644
spi-spi-gettype.html	3714 bytes	0644
spi-spi-gettypeid.html	3718 bytes	0644
spi-spi-getvalue.html	4166 bytes	0644
spi-spi-is-cursor-plan.html	4560 bytes	0644
spi-spi-keepplan.html	3884 bytes	0644
spi-spi-modifytuple.html	5631 bytes	0644
spi-spi-palloc.html	3157 bytes	0644
spi-spi-pfree.html	3275 bytes	0644
spi-spi-pop.html	2743 bytes	0644
spi-spi-prepare-cursor.html	5055 bytes	0644
spi-spi-prepare-params.html	4412 bytes	0644
spi-spi-prepare.html	7661 bytes	0644
spi-spi-push.html	3737 bytes	0644
spi-spi-returntuple.html	4097 bytes	0644
spi-spi-saveplan.html	4576 bytes	0644
spi-spi-scroll-cursor-fetch.html	4809 bytes	0644
spi-spi-scroll-cursor-move.html	4899 bytes	0644
spi-visibility.html	4152 bytes	0644
spi.html	10843 bytes	0644
sql-abort.html	4177 bytes	0644
sql-alteraggregate.html	6111 bytes	0644
sql-altercollation.html	5084 bytes	0644
sql-alterconversion.html	5170 bytes	0644
sql-alterdatabase.html	8778 bytes	0644
sql-alterdefaultprivileges.html	9407 bytes	0644
sql-alterdomain.html	11113 bytes	0644
sql-alterextension.html	11745 bytes	0644
sql-alterforeigndatawrapper.html	7378 bytes	0644
sql-alterforeigntable.html	12707 bytes	0644
sql-alterfunction.html	12845 bytes	0644
sql-altergroup.html	5239 bytes	0644
sql-alterindex.html	7655 bytes	0644
sql-alterlanguage.html	4022 bytes	0644
sql-alterlargeobject.html	3730 bytes	0644
sql-alteropclass.html	5114 bytes	0644
sql-alteroperator.html	5435 bytes	0644
sql-alteropfamily.html	13564 bytes	0644
sql-alterrole.html	13028 bytes	0644
sql-alterschema.html	4314 bytes	0644
sql-altersequence.html	13031 bytes	0644
sql-alterserver.html	5928 bytes	0644
sql-altertable.html	43543 bytes	0644
sql-altertablespace.html	5866 bytes	0644
sql-altertrigger.html	4647 bytes	0644
sql-altertsconfig.html	8126 bytes	0644
sql-altertsdictionary.html	6539 bytes	0644
sql-altertsparser.html	4257 bytes	0644
sql-altertstemplate.html	4223 bytes	0644
sql-altertype.html	11193 bytes	0644
sql-alteruser.html	4720 bytes	0644
sql-alterusermapping.html	5714 bytes	0644
sql-alterview.html	6969 bytes	0644
sql-analyze.html	10674 bytes	0644
sql-begin.html	6695 bytes	0644
sql-checkpoint.html	3758 bytes	0644
sql-close.html	4984 bytes	0644
sql-cluster.html	9404 bytes	0644
sql-commands.html	18810 bytes	0644
sql-comment.html	13799 bytes	0644
sql-commit-prepared.html	4516 bytes	0644
sql-commit.html	3992 bytes	0644
sql-copy.html	37443 bytes	0644
sql-createaggregate.html	13829 bytes	0644
sql-createcast.html	19632 bytes	0644
sql-createcollation.html	6739 bytes	0644
sql-createconversion.html	6538 bytes	0644
sql-createdatabase.html	12133 bytes	0644
sql-createdomain.html	8544 bytes	0644
sql-createextension.html	9083 bytes	0644
sql-createforeigndatawrapper.html	8059 bytes	0644
sql-createforeigntable.html	7718 bytes	0644
sql-createfunction.html	31076 bytes	0644
sql-creategroup.html	4012 bytes	0644
sql-createindex.html	25934 bytes	0644
sql-createlanguage.html	14888 bytes	0644
sql-createopclass.html	12676 bytes	0644
sql-createoperator.html	10688 bytes	0644
sql-createopfamily.html	5626 bytes	0644
sql-createrole.html	19325 bytes	0644
sql-createrule.html	12656 bytes	0644
sql-createschema.html	8319 bytes	0644
sql-createsequence.html	13862 bytes	0644
sql-createserver.html	6251 bytes	0644
sql-createtable.html	59172 bytes	0644
sql-createtableas.html	12772 bytes	0644
sql-createtablespace.html	6104 bytes	0644
sql-createtrigger.html	23175 bytes	0644
sql-createtsconfig.html	5352 bytes	0644
sql-createtsdictionary.html	5533 bytes	0644
sql-createtsparser.html	5947 bytes	0644
sql-createtstemplate.html	5437 bytes	0644
sql-createtype.html	39460 bytes	0644
sql-createuser.html	4524 bytes	0644
sql-createusermapping.html	5503 bytes	0644
sql-createview.html	10556 bytes	0644
sql-deallocate.html	3785 bytes	0644
sql-declare.html	15400 bytes	0644
sql-delete.html	11777 bytes	0644
sql-discard.html	4309 bytes	0644
sql-do.html	5204 bytes	0644
sql-drop-owned.html	5058 bytes	0644
sql-dropaggregate.html	4561 bytes	0644
sql-dropcast.html	4344 bytes	0644
sql-dropcollation.html	4409 bytes	0644
sql-dropconversion.html	4437 bytes	0644
sql-dropdatabase.html	4344 bytes	0644
sql-dropdomain.html	4257 bytes	0644
sql-dropextension.html	4785 bytes	0644
sql-dropforeigndatawrapper.html	4526 bytes	0644
sql-dropforeigntable.html	4560 bytes	0644
sql-dropfunction.html	5838 bytes	0644
sql-dropgroup.html	3047 bytes	0644
sql-dropindex.html	5182 bytes	0644
sql-droplanguage.html	4841 bytes	0644
sql-dropopclass.html	5678 bytes	0644
sql-dropoperator.html	5222 bytes	0644
sql-dropopfamily.html	5279 bytes	0644
sql-droprole.html	5158 bytes	0644
sql-droprule.html	4151 bytes	0644
sql-dropschema.html	4529 bytes	0644
sql-dropsequence.html	4367 bytes	0644
sql-dropserver.html	4265 bytes	0644
sql-droptable.html	5028 bytes	0644
sql-droptablespace.html	4585 bytes	0644
sql-droptrigger.html	4711 bytes	0644
sql-droptsconfig.html	4772 bytes	0644
sql-droptsdictionary.html	4689 bytes	0644
sql-droptsparser.html	4595 bytes	0644
sql-droptstemplate.html	4567 bytes	0644
sql-droptype.html	4463 bytes	0644
sql-dropuser.html	3181 bytes	0644
sql-dropusermapping.html	4679 bytes	0644
sql-dropview.html	4262 bytes	0644
sql-end.html	4157 bytes	0644
sql-execute.html	5073 bytes	0644
sql-explain.html	17094 bytes	0644
sql-expressions.html	47801 bytes	0644
sql-fetch.html	14251 bytes	0644
sql-grant.html	29245 bytes	0644
sql-insert.html	12860 bytes	0644
sql-keywords-appendix.html	106534 bytes	0644
sql-listen.html	5903 bytes	0644
sql-load.html	4207 bytes	0644
sql-lock.html	11869 bytes	0644
sql-move.html	4984 bytes	0644
sql-notify.html	10948 bytes	0644
sql-prepare-transaction.html	8640 bytes	0644
sql-prepare.html	9181 bytes	0644
sql-reassign-owned.html	5344 bytes	0644
sql-reindex.html	11103 bytes	0644
sql-release-savepoint.html	5005 bytes	0644
sql-reset.html	4993 bytes	0644
sql-revoke.html	14879 bytes	0644
sql-rollback-prepared.html	4627 bytes	0644
sql-rollback-to.html	6401 bytes	0644
sql-rollback.html	3996 bytes	0644
sql-savepoint.html	5605 bytes	0644
sql-security-label.html	8879 bytes	0644
sql-select.html	79544 bytes	0644
sql-selectinto.html	7634 bytes	0644
sql-set-constraints.html	7068 bytes	0644
sql-set-role.html	6915 bytes	0644
sql-set-session-authorization.html	6062 bytes	0644
sql-set-transaction.html	12696 bytes	0644
sql-set.html	12057 bytes	0644
sql-show.html	6851 bytes	0644
sql-start-transaction.html	4983 bytes	0644
sql-syntax-calling-funcs.html	8080 bytes	0644
sql-syntax-lexical.html	43370 bytes	0644
sql-syntax.html	5430 bytes	0644
sql-truncate.html	9364 bytes	0644
sql-unlisten.html	4923 bytes	0644
sql-update.html	15669 bytes	0644
sql-vacuum.html	10669 bytes	0644
sql-values.html	10640 bytes	0644
sql.html	13569 bytes	0644
ssh-tunnels.html	6263 bytes	0644
ssl-tcp.html	13477 bytes	0644
sslinfo.html	7594 bytes	0644
standby-settings.html	5427 bytes	0644
storage-file-layout.html	12936 bytes	0644
storage-fsm.html	3821 bytes	0644
storage-init.html	2760 bytes	0644
storage-page-layout.html	13891 bytes	0644
storage-toast.html	11478 bytes	0644
storage-vm.html	3540 bytes	0644
storage.html	2952 bytes	0644
stylesheet.css	1538 bytes	0644
supported-platforms.html	5042 bytes	0644
tablefunc.html	32193 bytes	0644
tcn.html	4974 bytes	0644
test-parser.html	4530 bytes	0644
textsearch-configuration.html	6257 bytes	0644
textsearch-controls.html	26966 bytes	0644
textsearch-debugging.html	17227 bytes	0644
textsearch-dictionaries.html	31261 bytes	0644
textsearch-features.html	21310 bytes	0644
textsearch-indexes.html	7387 bytes	0644
textsearch-intro.html	18453 bytes	0644
textsearch-limitations.html	3859 bytes	0644
textsearch-migration.html	5034 bytes	0644
textsearch-parsers.html	9210 bytes	0644
textsearch-psql.html	9345 bytes	0644
textsearch-tables.html	9750 bytes	0644
textsearch.html	5878 bytes	0644
transaction-iso.html	27240 bytes	0644
trigger-datachanges.html	5072 bytes	0644
trigger-definition.html	15507 bytes	0644
trigger-example.html	7749 bytes	0644
trigger-interface.html	10719 bytes	0644
triggers.html	3798 bytes	0644
tsearch2.html	9950 bytes	0644
tutorial-accessdb.html	7040 bytes	0644
tutorial-advanced-intro.html	3341 bytes	0644
tutorial-advanced.html	2856 bytes	0644
tutorial-agg.html	7594 bytes	0644
tutorial-arch.html	4852 bytes	0644
tutorial-concepts.html	3839 bytes	0644
tutorial-conclusion.html	2849 bytes	0644
tutorial-createdb.html	9200 bytes	0644
tutorial-delete.html	3517 bytes	0644
tutorial-fk.html	4422 bytes	0644
tutorial-inheritance.html	6137 bytes	0644
tutorial-install.html	4522 bytes	0644
tutorial-join.html	9685 bytes	0644
tutorial-populate.html	4839 bytes	0644
tutorial-select.html	8033 bytes	0644
tutorial-sql-intro.html	4904 bytes	0644
tutorial-sql.html	3060 bytes	0644
tutorial-start.html	2629 bytes	0644
tutorial-table.html	5704 bytes	0644
tutorial-transactions.html	9948 bytes	0644
tutorial-update.html	3159 bytes	0644
tutorial-views.html	3375 bytes	0644
tutorial-window.html	12481 bytes	0644
tutorial.html	5209 bytes	0644
typeconv-func.html	12170 bytes	0644
typeconv-oper.html	14907 bytes	0644
typeconv-overview.html	8301 bytes	0644
typeconv-query.html	5450 bytes	0644
typeconv-union-case.html	6612 bytes	0644
typeconv.html	3721 bytes	0644
unaccent.html	6742 bytes	0644
unsupported-features-sql-standard.html	35115 bytes	0644
upgrading.html	12795 bytes	0644
user-manag.html	3983 bytes	0644
using-explain.html	41824 bytes	0644
uuid-ossp.html	7228 bytes	0644
vacuumlo.html	7548 bytes	0644
view-pg-available-extension-versions.html	4642 bytes	0644
view-pg-available-extensions.html	3944 bytes	0644
view-pg-cursors.html	5669 bytes	0644
view-pg-group.html	3897 bytes	0644
view-pg-indexes.html	4155 bytes	0644
view-pg-locks.html	14444 bytes	0644
view-pg-prepared-statements.html	5060 bytes	0644
view-pg-prepared-xacts.html	4912 bytes	0644
view-pg-roles.html	6073 bytes	0644
view-pg-rules.html	3999 bytes	0644
view-pg-seclabels.html	5123 bytes	0644
view-pg-settings.html	10600 bytes	0644
view-pg-shadow.html	5381 bytes	0644
view-pg-stats.html	8887 bytes	0644
view-pg-tables.html	4836 bytes	0644
view-pg-timezone-abbrevs.html	3860 bytes	0644
view-pg-timezone-names.html	4177 bytes	0644
view-pg-user-mappings.html	5165 bytes	0644
view-pg-user.html	4517 bytes	0644
view-pg-views.html	3853 bytes	0644
views-overview.html	6542 bytes	0644
wal-async-commit.html	9016 bytes	0644
wal-configuration.html	14960 bytes	0644
wal-internals.html	6151 bytes	0644
wal-intro.html	5534 bytes	0644
wal-reliability.html	11479 bytes	0644
wal.html	2928 bytes	0644
warm-standby-failover.html	6102 bytes	0644
warm-standby.html	34646 bytes	0644
xaggr.html	9902 bytes	0644
xfunc-c.html	78520 bytes	0644
xfunc-internal.html	4004 bytes	0644
xfunc-overload.html	5911 bytes	0644
xfunc-pl.html	2991 bytes	0644
xfunc-sql.html	38027 bytes	0644
xfunc-volatility.html	9839 bytes	0644
xfunc.html	4518 bytes	0644
xindex.html	44593 bytes	0644
xml2.html	16900 bytes	0644
xoper-optimization.html	23144 bytes	0644
xoper.html	4835 bytes	0644
xplang-install.html	11127 bytes	0644
xplang.html	4235 bytes	0644
xtypes.html	12114 bytes	0644

File Content: xindex.html

File Content: `xindex.html`