mirror of
https://github.com/postgres/postgres.git
synced 2025-12-18 05:01:01 +03:00
Change "indices" to "indexes", per OED.
This commit is contained in:
@@ -1,5 +1,5 @@
|
||||
<!--
|
||||
$Header: /cvsroot/pgsql/doc/src/sgml/ref/create_index.sgml,v 1.18 2001/01/13 23:58:55 petere Exp $
|
||||
$Header: /cvsroot/pgsql/doc/src/sgml/ref/create_index.sgml,v 1.19 2001/05/17 21:50:18 petere Exp $
|
||||
Postgres documentation
|
||||
-->
|
||||
|
||||
@@ -209,7 +209,7 @@ ERROR: Cannot create index: 'index_name' already exists.
|
||||
on the result of a user-specified function
|
||||
<replaceable class="parameter">func_name</replaceable> applied
|
||||
to one or more columns of a single table.
|
||||
These <firstterm>functional indices</firstterm>
|
||||
These <firstterm>functional indexes</firstterm>
|
||||
can be used to obtain fast access to data
|
||||
based on operators that would normally require some
|
||||
transformation to apply them to the base data.
|
||||
@@ -217,7 +217,7 @@ ERROR: Cannot create index: 'index_name' already exists.
|
||||
|
||||
<para>
|
||||
Postgres provides btree, rtree and hash access methods for
|
||||
indices. The btree access method is an implementation of
|
||||
indexes. The btree access method is an implementation of
|
||||
Lehman-Yao high-concurrency btrees. The rtree access method
|
||||
implements standard rtrees using Guttman's quadratic split algorithm.
|
||||
The hash access method is an implementation of Litwin's linear
|
||||
@@ -302,7 +302,7 @@ ERROR: Cannot create index: 'index_name' already exists.
|
||||
<listitem>
|
||||
<para>
|
||||
The operator classes <literal>box_ops</literal> and
|
||||
<literal>bigbox_ops</literal> both support rtree indices on the
|
||||
<literal>bigbox_ops</literal> both support rtree indexes on the
|
||||
<literal>box</literal> data type.
|
||||
The difference between them is that <literal>bigbox_ops</literal>
|
||||
scales box coordinates down, to avoid floating-point exceptions from
|
||||
|
||||
Reference in New Issue
Block a user