Commit 949cfe52 authored by Bruce Momjian's avatar Bruce Momjian

Update create_index manual page to have unique section.

parent 003bfd96
.\" This is -*-nroff-*- .\" This is -*-nroff-*-
.\" XXX standard disclaimer belongs here.... .\" XXX standard disclaimer belongs here....
.\" $Header: /cvsroot/pgsql/src/man/Attic/create_index.l,v 1.3 1996/12/11 00:27:14 momjian Exp $ .\" $Header: /cvsroot/pgsql/src/man/Attic/create_index.l,v 1.4 1997/01/13 17:22:25 momjian Exp $
.TH "CREATE INDEX" SQL 11/05/95 PostgreSQL PostgreSQL .TH "CREATE INDEX" SQL 11/05/95 PostgreSQL PostgreSQL
.SH NAME .SH NAME
create index \(em construct a secondary index create index \(em construct a secondary index
...@@ -62,6 +62,11 @@ and then comparing it to the value on the other side of the operator. ...@@ -62,6 +62,11 @@ and then comparing it to the value on the other side of the operator.
Obviously, the decision to build a functional index represents a Obviously, the decision to build a functional index represents a
tradeoff between space (for the index) and execution time. tradeoff between space (for the index) and execution time.
.PP .PP
The \fBunique\fR keyword causes the system to check for duplicate
values when the index is created (if data already exist) and each
time data is added.
Attempts to insert or update non-duplicate data will generate an error.
.PP
Postgres provides btree, rtree and hash access methods for Postgres provides btree, rtree and hash access methods for
secondary indices. The btree access method is an implementation of secondary indices. The btree access method is an implementation of
the Lehman-Yao high-concurrency btrees. The rtree access method the Lehman-Yao high-concurrency btrees. The rtree access method
......
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