|
1 | 1 | .\" This is -*-nroff-*- |
2 | 2 | .\" XXX standard disclaimer belongs here.... |
3 | | -.\" $Header: /cvsroot/pgsql/src/man/Attic/cluster.l,v 1.6 1998/03/14 22:55:21 momjian Exp $ |
| 3 | +.\" $Header: /cvsroot/pgsql/src/man/Attic/cluster.l,v 1.7 1998/03/15 02:13:23 momjian Exp $ |
4 | 4 | .TH CLUSTER SQL 01/23/93 PostgreSQL PostgreSQL |
5 | 5 | .SH NAME |
6 | 6 | cluster - give storage clustering advice to Postgres |
@@ -51,9 +51,10 @@ of a big table will not fit in the cache. |
51 | 51 | Another way is to use SELECT ... INTO TABLE temp FROM ...ORDER BY ... |
52 | 52 | This uses the PostgreSQL sorting code in ORDER BY to match the index, |
53 | 53 | and is much faster for unordered data. You then drop the old table, use |
54 | | -ALTER TABLE RENAME to rename 'temp' to the old name, and recreate the |
55 | | -indexes. From then on, CLUSTER should be fast because most of the heap |
56 | | -data has been already ordered. |
| 54 | +ALTER TABLE RENAME to rename 'temp' to the old name, and recreate the b |
| 55 | +bindexes. The only problem is that oids will not be preserved. From |
| 56 | +then on, CLUSTER should be fast because most of the heap data has |
| 57 | +already been ordered, and the existing index is used. |
57 | 58 | .SH EXAMPLE |
58 | 59 | .nf |
59 | 60 | /* |
|