diff --git a/doc/src/sgml/arch-dev.sgml b/doc/src/sgml/arch-dev.sgml index 44646ce0956b9918d8a7f4452dc58bc03d594db6..1decf825b99bb2d5d88a4d07354f5a332ad75f60 100644 --- a/doc/src/sgml/arch-dev.sgml +++ b/doc/src/sgml/arch-dev.sgml @@ -1,5 +1,5 @@ @@ -603,7 +603,7 @@ current context are performed. The planner/optimizer decides which plans should be generated - based upon the types of indices defined on the relations appearing in + based upon the types of indexes defined on the relations appearing in a query. There is always the possibility of performing a sequential scan on a relation, so a plan using only sequential scans is always created. Assume an index is defined on a @@ -612,7 +612,7 @@ current context are performed. relation.attribute OPR constant. If relation.attribute happens to match the key of the B-tree index and OPR is anything but '<>' another plan is created using - the B-tree index to scan the relation. If there are further indices + the B-tree index to scan the relation. If there are further indexes present and the restrictions in the query happen to match a key of an index further plans will be considered. @@ -889,7 +889,7 @@ The {\tt AGG} node is followed by a {\tt GRP} node. The implementation of the {\it grouping} logic needs a sorted table for its operation so the {\tt GRP} node is followed by a {\tt SORT} node. The {\tt SORT} operation gets its tuples from a kind of {\tt Scan} node (if no -indices are present this will be a simple {\tt SeqScan} node). Any +indexes are present this will be a simple {\tt SeqScan} node). Any qualifications present are attached to the {\tt Scan} node. Figure \ref{plan_having} shows the {\it plan} created for the query given in example \ref{having}. diff --git a/doc/src/sgml/backup.sgml b/doc/src/sgml/backup.sgml index ba1b6c9b21c6254dcf954cb03b09875fe5c4e692..40673c7ab497ec1c8343e1032a46624239111711 100644 --- a/doc/src/sgml/backup.sgml +++ b/doc/src/sgml/backup.sgml @@ -1,4 +1,4 @@ - + Backup and Restore @@ -355,7 +355,7 @@ tar -cf backup.tar /usr/local/pgsql/data Also note that the file system backup will not necessarily be smaller than an SQL dump. On the contrary, it will most likely be larger. (pg_dump does not need to dump - the contents of indices for example, just the commands to recreate + the contents of indexes for example, just the commands to recreate them.) diff --git a/doc/src/sgml/extend.sgml b/doc/src/sgml/extend.sgml index 4c27897f4e19215da74f18cd6e7039b1e88e1a6a..cda4532a51d6e8e04dd96333d687c7630f545225 100644 --- a/doc/src/sgml/extend.sgml +++ b/doc/src/sgml/extend.sgml @@ -1,5 +1,5 @@ @@ -96,7 +96,7 @@ $Header: /cvsroot/pgsql/doc/src/sgml/extend.sgml,v 1.9 2001/01/13 23:58:55 peter file that stores all rows of a table) but the user can "look inside" at the attributes of these types from the query language and optimize their retrieval by - (for example) defining indices on the attributes. + (for example) defining indexes on the attributes. Postgres base types are further divided into built-in types and user-defined types. Built-in types (like @@ -149,7 +149,7 @@ $Header: /cvsroot/pgsql/doc/src/sgml/extend.sgml,v 1.9 2001/01/13 23:58:55 peter pg_index - secondary indices + secondary indexes pg_proc @@ -256,7 +256,7 @@ $Header: /cvsroot/pgsql/doc/src/sgml/extend.sgml,v 1.9 2001/01/13 23:58:55 peter pg_am, pg_amop, pg_amproc, pg_operator and pg_opclass are particularly hard to understand and will be described in depth (in the section - on interfacing types and operators to indices) + on interfacing types and operators to indexes) after we have discussed basic extensions. diff --git a/doc/src/sgml/geqo.sgml b/doc/src/sgml/geqo.sgml index 969c1820b356d27128ba46a7557fb5d151b42138..78d7109e9faa5f3da7f2440a0f02699d0daf9d6d 100644 --- a/doc/src/sgml/geqo.sgml +++ b/doc/src/sgml/geqo.sgml @@ -1,5 +1,5 @@ @@ -51,8 +51,8 @@ Genetic Optimizer join methods (e.g., nested loop, hash join, merge join in Postgres) to process individual joins and a diversity of - indices (e.g., r-tree, - b-tree, hash in Postgres) as access paths for relations. + indexes (e.g., R-tree, + B-tree, hash in Postgres) as access paths for relations. diff --git a/doc/src/sgml/gist.sgml b/doc/src/sgml/gist.sgml index f7183b547851b1fcfefb9457bff8c0aecd4ac407..692bfd8c47785f7339a6c7285828f3eeafe6b89a 100644 --- a/doc/src/sgml/gist.sgml +++ b/doc/src/sgml/gist.sgml @@ -8,7 +8,7 @@ Transcribed 1998-02-19 -GiST Indices +GiST Indexes The information about GIST is at diff --git a/doc/src/sgml/indices.sgml b/doc/src/sgml/indices.sgml index fa04c3cd91d8ee44864133c93871703bb6659a5e..32ea606f1da7e6842e246cdd67581ec7f11f60f8 100644 --- a/doc/src/sgml/indices.sgml +++ b/doc/src/sgml/indices.sgml @@ -1,27 +1,22 @@ - + - - Indices + + Indices - - indices - - - + indexes - indices - Indices are a common way to enhance database performance. An index + Indexes are a common way to enhance database performance. An index allows the database server to find and retrieve specific rows much - faster than it could do without an index. But indices also add + faster than it could do without an index. But indexes also add overhead to the database system as a whole, so they should be used sensibly. - + Introduction @@ -73,7 +68,7 @@ CREATE INDEX test1_id_index ON test1 (id); To remove an index, use the DROP INDEX command. - Indices can be added and removed from tables at any time. + Indexes can be added and removed from tables at any time. @@ -88,10 +83,10 @@ CREATE INDEX test1_id_index ON test1 (id); - Indices can also benefit UPDATEs and + Indexes can also benefit UPDATEs and DELETEs with search conditions. Note that a query or data manipulation commands can only use at most one index - per table. Indices can also be used in table join methods. Thus, + per table. Indexes can also be used in table join methods. Thus, an index defined on a column that is part of a join condition can significantly speed up queries with joins. @@ -99,13 +94,13 @@ CREATE INDEX test1_id_index ON test1 (id); When an index is created, it has to be kept synchronized with the table. This adds overhead to data manipulation operations. - Therefore indices that are non-essential or do not get used at all + Therefore indexes that are non-essential or do not get used at all should be removed. - + Index Types @@ -113,12 +108,12 @@ CREATE INDEX test1_id_index ON test1 (id); B-tree, R-tree, and Hash. Each index type is more appropriate for a particular query type because of the algorithm it uses. - indices + indexes B-tree B-tree - indices + indexes By default, the CREATE INDEX command will create a @@ -138,14 +133,14 @@ CREATE INDEX test1_id_index ON test1 (id); - indices + indexes R-tree R-tree - indices + indexes - R-tree indices are especially suited for spacial data. To create + R-tree indexes are especially suited for spacial data. To create an R-tree index, use a command of the form CREATE INDEX name ON table USING RTREE (column); @@ -169,12 +164,12 @@ CREATE INDEX name ON table - indices + indexes hash hash - indices + indexes The query optimizer will consider using a hash index whenever an indexed column is involved in a comparison using the @@ -185,12 +180,12 @@ CREATE INDEX name ON table - Because of the limited utility of hash indices, a B-tree index + Because of the limited utility of hash indexes, a B-tree index should generally be preferred over a hash index. We do not have - sufficient evidence that hash indices are actually faster than + sufficient evidence that hash indexes are actually faster than B-trees even for = comparisons. Moreover, - hash indices require coarser locks; see . + hash indexes require coarser locks; see . @@ -208,11 +203,11 @@ CREATE INDEX name ON table - - Multi-Column Indices + + Multi-Column Indexes - - indices + + indexes multi-column @@ -241,7 +236,7 @@ CREATE INDEX test2_mm_idx ON test2 (major, minor); Currently, only the B-tree implementation supports multi-column - indices. Up to 16 columns may be specified. (This limit can be + indexes. Up to 16 columns may be specified. (This limit can be altered when building Postgres; see the file config.h.) @@ -274,7 +269,7 @@ SELECT name FROM test2 WHERE major = constant OR mino - Multi-column indices should be used sparingly. Most of the time, + Multi-column indexes should be used sparingly. Most of the time, an index on a single column is sufficient and saves space and time. Indexes with more than three columns are almost certainly inappropriate. @@ -282,11 +277,11 @@ SELECT name FROM test2 WHERE major = constant OR mino - - Unique Indices + + Unique Indexes - - indices + + indexes unique @@ -296,7 +291,7 @@ SELECT name FROM test2 WHERE major = constant OR mino CREATE UNIQUE INDEX name ON table (column , ...); - Only B-tree indices can be declared unique. + Only B-tree indexes can be declared unique. @@ -307,7 +302,7 @@ CREATE UNIQUE INDEX name ON table PostgreSQL automatically creates unique - indices when a table is declared with a unique constraint or a + indexes when a table is declared with a unique constraint or a primary key, on the columns that make up the primary key or unique columns (a multi-column index, if appropriate), to enforce that constraint. A unique index can be added to a table at any later @@ -317,18 +312,18 @@ CREATE UNIQUE INDEX name ON table - - Functional Indices + + Functional Indexes - - indices + + indexes on functions For a functional index, an index is defined on the result of a function applied to one or more columns of a - single table. Functional indices can be used to obtain fast access + single table. Functional indexes can be used to obtain fast access to data based on the result of function calls. @@ -349,9 +344,9 @@ CREATE INDEX test1_lower_col1_idx ON test1 (lower(col1)); The function in the index definition can take more than one argument, but they must be table columns, not constants. - Functional indices are always single-column (namely, the function + Functional indexes are always single-column (namely, the function result) even if the function uses more than one input field; there - cannot be multi-column indices that contain function calls. + cannot be multi-column indexes that contain function calls. @@ -364,7 +359,7 @@ CREATE INDEX test1_lower_col1_idx ON test1 (lower(col1)); - + Operator Classes @@ -390,7 +385,7 @@ CREATE INDEX name ON table The operator classes box_ops and - bigbox_ops both support R-tree indices on the + bigbox_ops both support R-tree indexes on the box data type. The difference between them is that bigbox_ops scales box coordinates down, to avoid floating point exceptions from doing multiplication, @@ -540,11 +535,11 @@ Subject: Re: [QUESTIONS] PRIMARY KEY | UNIQUE As for why no non-unique keys are defined explicitly in standard SQL syntax? Well, you - must understand that indices are implementation-dependent. + must understand that indexes are implementation-dependent. SQL does not define the implementation, merely the relations between data in the database. Postgres does allow - non-unique indices, but indices + non-unique indexes, but indexes used to enforce SQL keys are always unique. @@ -579,7 +574,7 @@ CREATE MEMSTORE ON table COLUMNS colsRDBMS provider gives you - be it an index, my imaginary MEMSTORE command, or an intelligent RDBMS - that creates indices without your knowledge based on the fact that you have + that creates indexes without your knowledge based on the fact that you have sent it many queries based on a specific combination of keys... (It learns from experience). @@ -587,10 +582,10 @@ CREATE MEMSTORE ON table COLUMNS cols - Partial Indices + Partial Indexes - indices + indexes partial @@ -611,7 +606,7 @@ CREATE MEMSTORE ON table COLUMNS cols Note - Partial indices are not currently supported by + Partial indexes are not currently supported by PostgreSQL, but they were once supported by its predecessor Postgres, and much of the code is still there. We hope to revive support for this @@ -623,14 +618,14 @@ CREATE MEMSTORE ON table COLUMNS colspartial index is an index built over a subset of a table; the subset is defined by a predicate. Postgres - supported partial indices with arbitrary + supported partial indexes with arbitrary predicates. I believe IBM's DB2 - for AS/400 supports partial indices + for AS/400 supports partial indexes using single-clause predicates. - The main motivation for partial indices is this: + The main motivation for partial indexes is this: if all of the queries you ask that can profitably use an index fall into a certain range, why build an index over the whole table and suffer the associated space/time costs? @@ -640,9 +635,9 @@ CREATE MEMSTORE ON table COLUMNS cols - The machinery to build, update and query partial indices isn't too - bad. The hairy parts are index selection (which indices do I build?) - and query optimization (which indices do I use?); i.e., the parts + The machinery to build, update and query partial indexes isn't too + bad. The hairy parts are index selection (which indexes do I build?) + and query optimization (which indexes do I use?); i.e., the parts that involve deciding what predicate(s) match the workload/query in some useful way. For those who are into database theory, the problems are basically analogous to the corresponding materialized view diff --git a/doc/src/sgml/mvcc.sgml b/doc/src/sgml/mvcc.sgml index 79567996d221f25f70c3e023d839c4827283610f..2eaf00803b16a3d05f5b0eca19bdd3117d8a6e0c 100644 --- a/doc/src/sgml/mvcc.sgml +++ b/doc/src/sgml/mvcc.sgml @@ -1,5 +1,5 @@ @@ -554,8 +554,8 @@ ERROR: Can't serialize access due to concurrent update - - Locking and Indices + + Locking and Indexes Though Postgres @@ -571,7 +571,7 @@ ERROR: Can't serialize access due to concurrent update - GiST and R-Tree indices + GiST and R-Tree indexes @@ -583,7 +583,7 @@ ERROR: Can't serialize access due to concurrent update - Hash indices + Hash indexes @@ -600,7 +600,7 @@ ERROR: Can't serialize access due to concurrent update - Btree indices + B-tree indexes @@ -610,7 +610,7 @@ ERROR: Can't serialize access due to concurrent update - Btree indices provide the highest concurrency without deadlock + B-tree indexes provide the highest concurrency without deadlock conditions. @@ -619,7 +619,7 @@ ERROR: Can't serialize access due to concurrent update - In short, btree indices are the recommended index type for concurrent + In short, B-tree indexes are the recommended index type for concurrent applications. diff --git a/doc/src/sgml/page.sgml b/doc/src/sgml/page.sgml index 761386c79936db73fa12e38865170f8d277fda53..c1dd9b3e849d32acabfe004ce2fc482a2cf3309b 100644 --- a/doc/src/sgml/page.sgml +++ b/doc/src/sgml/page.sgml @@ -23,7 +23,7 @@ refers to data that is stored in Postgres tables. The following table shows how pages in both normal Postgres tables - and Postgres indices + and Postgres indexes (e.g., a B-tree index) are structured. diff --git a/doc/src/sgml/perform.sgml b/doc/src/sgml/perform.sgml index bfe66eb5dc5785a1c11ca02a2eff73b4a0cbc407..04e7162ac2ae9ae73dcdd6e58191c5ff26e26d5d 100644 --- a/doc/src/sgml/perform.sgml +++ b/doc/src/sgml/perform.sgml @@ -1,5 +1,5 @@ @@ -395,8 +395,8 @@ SELECT * FROM d LEFT JOIN - - Remove Indices + + Remove Indexes If you are loading a freshly created table, the fastest way is to diff --git a/doc/src/sgml/plsql.sgml b/doc/src/sgml/plsql.sgml index 559ba4aad1aba00007d28d2ecddb2a8e0101eadf..b30bca80f7de8c985f40dddd31b6972839b9f8a8 100644 --- a/doc/src/sgml/plsql.sgml +++ b/doc/src/sgml/plsql.sgml @@ -1,5 +1,5 @@ @@ -115,7 +115,7 @@ END; for user defined types, anything that can be defined in C language functions can also be done with PL/pgSQL. It is possible to create complex conditional computation functions and later use - them to define operators or use them in functional indices. + them to define operators or use them in functional indexes. Advantages of Using PL/pgSQL diff --git a/doc/src/sgml/ref/create_index.sgml b/doc/src/sgml/ref/create_index.sgml index be1e82a7e91b043920614f73b13d5007209698b0..bc72fb1993aaeeea57355f8d62a78d8ca63c5a7b 100644 --- a/doc/src/sgml/ref/create_index.sgml +++ b/doc/src/sgml/ref/create_index.sgml @@ -1,5 +1,5 @@ @@ -209,7 +209,7 @@ ERROR: Cannot create index: 'index_name' already exists. on the result of a user-specified function func_name applied to one or more columns of a single table. - These functional indices + These functional indexes 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. 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. The operator classes box_ops and - bigbox_ops both support rtree indices on the + bigbox_ops both support rtree indexes on the box data type. The difference between them is that bigbox_ops scales box coordinates down, to avoid floating-point exceptions from diff --git a/doc/src/sgml/ref/pg_dump.sgml b/doc/src/sgml/ref/pg_dump.sgml index be2afefc8f25f051b56861e3dbcd0580f3e514bb..14f2f9e497ac7b84fe8cf2b02276b02f6e68b875 100644 --- a/doc/src/sgml/ref/pg_dump.sgml +++ b/doc/src/sgml/ref/pg_dump.sgml @@ -1,5 +1,5 @@ @@ -74,7 +74,7 @@ Postgres documentation pg_dump will produce the queries necessary to re-generate all - user-defined types, functions, tables, indices, aggregates, and + user-defined types, functions, tables, indexes, aggregates, and operators. In addition, all the data is copied out in text format so that it can be readily copied in again, as well as imported into tools for editing. diff --git a/doc/src/sgml/ref/pg_restore.sgml b/doc/src/sgml/ref/pg_restore.sgml index 5ab98fc0b3aa3760904d5622d08e3ec730110eb0..e30f42421887a863ebc2ede2b9bb450019c0c0cf 100644 --- a/doc/src/sgml/ref/pg_restore.sgml +++ b/doc/src/sgml/ref/pg_restore.sgml @@ -1,4 +1,4 @@ - + @@ -71,7 +71,7 @@ or even to reorder the items prior to being restored. The archive files are designed to be portable across architectures. pg_dump will produce the queries necessary to re-generate all user-defined types, functions, - tables, indices, aggregates, and operators. In addition, all the data is copied + tables, indexes, aggregates, and operators. In addition, all the data is copied out (in text format for scripts) so that it can be readily copied in again. @@ -335,7 +335,7 @@ Restore items in modified OID order. By default pg_dump will dump items in an order convenient to pg_dump, then save the archive in a modified OID order. Most objects - will be restored in OID order, but some things (e.g., rules and indices) will be restored at the end of + will be restored in OID order, but some things (e.g., rules and indexes) will be restored at the end of the process irrespective of their OIDs. This option is the default. diff --git a/doc/src/sgml/ref/pgaccess-ref.sgml b/doc/src/sgml/ref/pgaccess-ref.sgml index beda85f37a95edc7e5427bc8c9d8df49aed09f2a..d2aa9782d0c009df59d49798808947dc6e12ec8a 100644 --- a/doc/src/sgml/ref/pgaccess-ref.sgml +++ b/doc/src/sgml/ref/pgaccess-ref.sgml @@ -1,5 +1,5 @@ @@ -163,7 +163,7 @@ Postgres documentation - Retrieve information on tables, including owner, field information, indices. + Retrieve information on tables, including owner, field information, indexes. diff --git a/doc/src/sgml/ref/psql-ref.sgml b/doc/src/sgml/ref/psql-ref.sgml index af3b90968e2b71d19c3f74a49c1900288db1c836..3a1c8ab0e072591c5739f222e41b06a9a552d086 100644 --- a/doc/src/sgml/ref/psql-ref.sgml +++ b/doc/src/sgml/ref/psql-ref.sgml @@ -1,5 +1,5 @@ @@ -348,7 +348,7 @@ testdb=> (which could be a table, view, index, or sequence), their types, and any special attributes such as NOT NULL or defaults, if any. - If the relation is, in fact, a table, any defined indices are also listed. + If the relation is, in fact, a table, any defined indexes are also listed. If the relation is a view, the view definition is also shown. @@ -387,7 +387,7 @@ testdb=> Shows the descriptions of object (which can be a regular expression), or of all objects if no argument is given. (Object covers aggregates, functions, operators, types, relations - (tables, views, indices, sequences, large objects), rules, and triggers.) For example: + (tables, views, indexes, sequences, large objects), rules, and triggers.) For example: => \dd version Object descriptions diff --git a/doc/src/sgml/release.sgml b/doc/src/sgml/release.sgml index 9a3b2124336d43bc1b3a3eacc10e2851d22f23bd..d9826a0932cd144493df599d00559bc5878a653e 100644 --- a/doc/src/sgml/release.sgml +++ b/doc/src/sgml/release.sgml @@ -1,5 +1,5 @@ @@ -1196,7 +1196,7 @@ subselect+CASE fixes(Tom) Add SHLIB_LINK setting for solaris_i386 and solaris_sparc ports(Daren Sefcik) Fixes for CASE in WHERE join clauses(Tom) Fix BTScan abort(Tom) -Repair the check for redundant UNIQUE and PRIMARY KEY indices(Thomas) +Repair the check for redundant UNIQUE and PRIMARY KEY indexes(Thomas) Improve it so that it checks for multi-column constraints(Thomas) Fix for Win32 making problem with MB enabled(Hiroki Kataoka) Allow BSD yacc and bison to compile pl code(Bruce) @@ -1595,7 +1595,7 @@ Enhancements ------------ Add "vacuumdb" utility Speed up libpq by allocating memory better(Tom) -EXPLAIN all indices used(Tom) +EXPLAIN all indexes used(Tom) Implement CASE, COALESCE, NULLIF expression(Thomas) New pg_dump table output format(Constantin) Add string min()/max() functions(Thomas) @@ -2029,14 +2029,14 @@ Allow index use with OR clauses(Bruce) Allows "SELECT NULL ORDER BY 1;" Explain VERBOSE prints the plan, and now pretty-prints the plan to the postmaster log file(Bruce) -Add Indices display to \d command(Bruce) +Add indexes display to \d command(Bruce) Allow GROUP BY on functions(David) New pg_class.relkind for large objects(Bruce) New way to send libpq NOTICE messages to a different location(Tom) New \w write command to psql(Bruce) New /contrib/findoidjoins scans oid columns to find join relationships(Bruce) -Allow binary-compatible indices to be considered when checking for valid -indices for restriction clauses containing a constant(Thomas) +Allow binary-compatible indexes to be considered when checking for valid +Indexes for restriction clauses containing a constant(Thomas) New ISBN/ISSN code in /contrib/isbn_issn Allow NOT LIKE, IN, NOT IN, BETWEEN, and NOT BETWEEN constraint(Thomas) New rewrite system fixes many problems with rules and views(Jan) @@ -2502,7 +2502,7 @@ Real deadlock detection, no more timeouts(Bruce) Add SQL92 "constants" CURRENT_DATE, CURRENT_TIME, CURRENT_TIMESTAMP, CURRENT_USER(Thomas) Modify constraint syntax to be SQL92-compliant(Thomas) -Implement SQL92 PRIMARY KEY and UNIQUE clauses using indices(Thomas) +Implement SQL92 PRIMARY KEY and UNIQUE clauses using indexes(Thomas) Recognize SQL92 syntax for FOREIGN KEY. Throw elog notice(Thomas) Allow NOT NULL UNIQUE constraint clause (each allowed separately before)(Thomas) Allow Postgres-style casting ("::") of non-constants(Thomas) @@ -2514,14 +2514,14 @@ Implement SQL92 binary and hexadecimal string decoding (b'10' and x'1F')(Thomas) Support SQL92 syntax for type coercion of literal strings (e.g. "DATETIME 'now'")(Thomas) Add conversions for int2, int4, and OID types to and from text(Thomas) -Use shared lock when building indices(Vadim) +Use shared lock when building indexes(Vadim) Free memory allocated for an user query inside transaction block after this query is done, was turned off in <= 6.2.1(Vadim) New SQL statement CREATE PROCEDURAL LANGUAGE(Jan) New Postgres Procedural Language (PL) backend interface(Jan) Rename pg_dump -H option to -h(Bruce) Add Java support for passwords, European dates(Peter) -Use indices for LIKE and ~, !~ operations(Bruce) +Use indexes for LIKE and ~, !~ operations(Bruce) Add hash functions for datetime and timespan(Thomas) Time Travel removed(Vadim, Bruce) Add paging for \d and \z, and fix \i(Bruce) @@ -2539,7 +2539,7 @@ Regression tests time zone automatically set with "setenv PGTZ PST8PDT"(Thomas) Add pg_description table for info on tables, columns, operators, types, and aggregates(Bruce) Increase 16 char limit on system table/index names to 32 characters(Bruce) -Rename system indices(Bruce) +Rename system indexes(Bruce) Add 'GERMAN' option to SET DATESTYLE(Thomas) Define an "ISO-style" timespan output format with "hh:mm:ss" fields(Thomas) Allow fractional values for delta times (e.g. '2.5 days')(Thomas) @@ -3041,7 +3041,7 @@ fix join clauses for multiple tables(Vadim) fix hash, hashjoin for arrays(Vadim) fix btree for abstime type(Vadim) large object fixes(Raymond) -fix buffer leak in hash indices (Vadim) +fix buffer leak in hash indexes (Vadim) fix rtree for use in inner scan (Vadim) fix gist for use in inner scan, cleanups (Vadim, Andrea) avoid unnecessary local buffers allocation (Vadim, Massimo) @@ -3816,8 +3816,8 @@ Bug fixes: * allow the use of \; inside the monitor * the LISTEN/NOTIFY asynchronous notification mechanism now work * NOTIFY in rule action bodies now work - * hash indices work, and access methods in general should perform better. - creation of large btree indices should be much faster. (thanks to Paul + * hash indexes work, and access methods in general should perform better. + creation of large btree indexes should be much faster. (thanks to Paul Aoki) Other changes and enhancements: diff --git a/doc/src/sgml/rules.sgml b/doc/src/sgml/rules.sgml index 6f3ac48573472bd39c59bb7a3aa92e1e24f022ae..508345a44200be6b7190522198a44e421d4c33d5 100644 --- a/doc/src/sgml/rules.sgml +++ b/doc/src/sgml/rules.sgml @@ -1869,7 +1869,7 @@ Merge Join AND software.hostname = computer.hostname; - Since there are appropriate indices setup, the planner + Since there are appropriate indexes setup, the planner will create a plan of @@ -1919,7 +1919,7 @@ Merge Join get invoked once for any of the 2000 old computers that have to be deleted and that will result in one index scan over computer and 2000 index scans for the software. The - rule implementation will do it with two queries over indices. + rule implementation will do it with two queries over indexes. And it depends on the overall size of the software table if the rule will still be faster in the seqscan situation. 2000 query executions over the SPI manager take some time, even diff --git a/doc/src/sgml/wal.sgml b/doc/src/sgml/wal.sgml index dfb90e6e6c0ae073d3a3acf3d8c22cb44c346c86..602ed11f974e3a79be800d1a29b118c690a54211 100644 --- a/doc/src/sgml/wal.sgml +++ b/doc/src/sgml/wal.sgml @@ -1,4 +1,4 @@ - + Write-Ahead Logging (<acronym>WAL</acronym>) @@ -18,7 +18,7 @@ is a standard approach to transaction logging. Its detailed description may be found in most (if not all) books about transaction processing. Briefly, WAL's central - concept is that changes to data files (where tables and indices + concept is that changes to data files (where tables and indexes reside) must be written only after those changes have been logged - that is, when log records have been flushed to permanent storage. When we follow this procedure, we do not need to flush @@ -67,7 +67,7 @@ - Problems with indices (problems 1 and 2) could possibly have been + Problems with indexes (problems 1 and 2) could possibly have been fixed by additional fsync() calls, but it is not obvious how to handle the last case without WAL; WAL saves the entire diff --git a/doc/src/sgml/xindex.sgml b/doc/src/sgml/xindex.sgml index dc062710e03cdfbbd52df68acb7f37ba0d4f5633..5b747fe60339d09a55617b762e32644877bf0a49 100644 --- a/doc/src/sgml/xindex.sgml +++ b/doc/src/sgml/xindex.sgml @@ -1,10 +1,10 @@ - Interfacing Extensions To Indices + Interfacing Extensions To Indexes The procedures described thus far let you define a new type, new @@ -34,7 +34,7 @@ Postgres documentation
Index Schema - Indices + @@ -118,7 +118,7 @@ SELECT oid FROM pg_am WHERE amname = 'btree'; example, that the "<=" and ">" operators partition a B-tree. Postgres uses strategies to express these relationships between - operators and the way they can be used to scan indices. + operators and the way they can be used to scan indexes. diff --git a/doc/src/sgml/xtypes.sgml b/doc/src/sgml/xtypes.sgml index 65407e50a9db5e40dcdbb3bb404c806bfdd0f6c6..b9093253d426fcbaf792bdf0693ed89031d14a27 100644 --- a/doc/src/sgml/xtypes.sgml +++ b/doc/src/sgml/xtypes.sgml @@ -10,7 +10,7 @@ As previously mentioned, there are two kinds of types in Postgres: base types (defined in a programming language) and composite types. - Examples in this section up to interfacing indices can + Examples in this section up to interfacing indexes can be found in complex.sql and complex.c. Composite examples are in funcs.sql.