Skip to content

P
Postgres FD Implementation
Commit e7d9a6bf authored by Tom Lane's avatar Tom Lane
Browse files
Options

Repair example, per note in interactive docs.

parent 23ef0926
Hide whitespace changes
Inline Side-by-side
Showing with 3 additions and 3 deletions
doc/src/sgml/ref/cluster.sgml
View file @ e7d9a6bf
<!-- <!--
$Header: /cvsroot/pgsql/doc/src/sgml/ref/cluster.sgml,v 1.13 2001/12/08 03:24:34 thomas Exp $ $Header: /cvsroot/pgsql/doc/src/sgml/ref/cluster.sgml,v 1.14 2001/12/30 04:36:52 tgl Exp $
PostgreSQL documentation PostgreSQL documentation
--> -->
...@@ -190,8 +190,8 @@ SELECT <replaceable class="parameter">columnlist</replaceable> INTO TABLE <repla ...@@ -190,8 +190,8 @@ SELECT <replaceable class="parameter">columnlist</replaceable> INTO TABLE <repla
the ORDER BY clause to match the index, and which is much faster for the ORDER BY clause to match the index, and which is much faster for
unordered data. You then drop the old table, use unordered data. You then drop the old table, use
<command>ALTER TABLE...RENAME</command> <command>ALTER TABLE...RENAME</command>
to rename <replaceable class="parameter">temp</replaceable> to the old name, and to rename <replaceable class="parameter">newtable</replaceable> to the old name, and
recreate any indexes. The only problem is that <acronym>OID</acronym>s recreate the table's indexes. The only problem is that <acronym>OID</acronym>s
will not be preserved. From then on, <command>CLUSTER</command> should be will not be preserved. From then on, <command>CLUSTER</command> should be
fast because most of the heap data has already been fast because most of the heap data has already been
ordered, and the existing index is used. ordered, and the existing index is used.
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment