-<chapter id="brin">
+<sect1 id="brin">
BRIN Indexes
BRIN
-1 id="brin-intro">
+2 id="brin-intro">
Introduction
be more precise and more data blocks can be skipped during an index scan.
- 2 id="brin-operation">
+ 3 id="brin-operation">
Index Maintenance
See for details.
- 2>
-1>
+ 3>
+2>
-1 id="brin-builtin-opclasses">
+2 id="brin-builtin-opclasses">
Built-in Operator Classes
- 2 id="brin-builtin-opclasses--parameters">
+ 3 id="brin-builtin-opclasses--parameters">
Operator Class Parameters
- 2>
+ 3>
-1>
+2>
-1 id="brin-extensibility">
+2 id="brin-extensibility">
Extensibility
float4_minmax_ops as an example of minmax, and
box_inclusion_ops as an example of inclusion.
+
-
-<chapter id="btree">
+<sect1 id="btree">
B-Tree Indexes
B-Tree
-1 id="btree-intro">
+2 id="btree-intro">
Introduction
btree
AM make use of them.
-1>
+2>
-1 id="btree-behavior">
+2 id="btree-behavior">
Behavior of B-Tree Operator Classes
planner relies on them for optimization purposes.
-1>
+2>
-1 id="btree-support-funcs">
+2 id="btree-support-funcs">
B-Tree Support Functions
-1>
+2>
-1 id="btree-implementation">
+2 id="btree-implementation">
Implementation
distribution for a much more detailed, internals-focused description
of the B-Tree implementation.
- 2 id="btree-structure">
+ 3 id="btree-structure">
B-Tree Structure
PostgreSQL B-Tree indexes are
the tree structure by creating a new root page that is one level
above the original root page.
- 2>
+ 3>
- 2 id="btree-deletion">
+ 3 id="btree-deletion">
Bottom-up Index Deletion
B-Tree indexes are not directly aware that under MVCC, there might
two logical rows whose lifetimes span the same
VACUUM cycle).
- 2>
+ 3>
- 2 id="btree-deduplication">
+ 3 id="btree-deduplication">
Deduplication
A duplicate is a leaf page tuple (a tuple that points to a table
- 2>
-1>
+ 3>
+2>
-chapter>
+sect1>
-<chapter id="gin">
+<sect1 id="gin">
GIN Indexes
GIN
-1 id="gin-intro">
+2 id="gin-intro">
Introduction
information about
GIN on their
-1>
+2>
-1 id="gin-builtin-opclasses">
+2 id="gin-builtin-opclasses">
Built-in Operator Classes
See for details.
-1>
+2>
-1 id="gin-extensibility">
+2 id="gin-extensibility">
Extensibility
though the actual type might be something else depending on the operator.
-1>
+2>
-1 id="gin-implementation">
+2 id="gin-implementation">
Implementation
- 2 id="gin-fast-update">
+ 3 id="gin-fast-update">
GIN Fast Update Technique
for details.
- 2>
+ 3>
- 2 id="gin-partial-match">
+ 3 id="gin-partial-match">
Partial Match Algorithm
to be searched, or greater than zero if the index key is past the range
that could match.
- 2>
+ 3>
-1>
+2>
-1 id="gin-tips">
+2 id="gin-tips">
GIN Tips and Tricks
-1>
+2>
-1 id="gin-limit">
+2 id="gin-limit">
Limitations
however that null key values contained within a non-null composite item
or query value are supported.
-1>
+2>
-1 id="gin-examples">
+2 id="gin-examples">
Examples
-1>
+2>
-chapter>
+sect1>
-<chapter id="gist">
+<sect1 id="gist">
GiST Indexes
GiST
-1 id="gist-intro">
+2 id="gist-intro">
Introduction
-1>
+2>
-1 id="gist-builtin-opclasses">
+2 id="gist-builtin-opclasses">
Built-in Operator Classes
-1>
+2>
-1 id="gist-extensibility">
+2 id="gist-extensibility">
Extensibility
will accumulate for the duration of the operation.
-1>
+2>
-1 id="gist-implementation">
+2 id="gist-implementation">
Implementation
- 2 id="gist-buffering-build">
+ 3 id="gist-buffering-build">
GiST Index Build Methods
is ordered.
- 2>
-1>
+ 3>
+2>
-1 id="gist-examples">
+2 id="gist-examples">
Examples
-1>
+2>
-chapter>
+sect1>
-<chapter id="hash-index">
+<sect1 id="hash-index">
Hash Indexes
Hash
-1 id="hash-intro">
+2 id="hash-intro">
Overview
with rapidly increasing number of rows.
-1>
+2>
-1 id="hash-implementation">
+2 id="hash-implementation">
Implementation
successfully.
-1>
+2>
-chapter>
+sect1>
--- /dev/null
+
+
+
+
Built-in Index Access Methods
+
+&btree;
+&gist;
+&spgist;
+&gin;
+&brin;
+&hash;
+
+
&indexam;
&generic-wal;
&custom-rmgr;
- &btree;
- &gist;
- &spgist;
- &gin;
- &brin;
- &hash;
+ &indextypes;
&storage;
&transaction;
&bki;
-<chapter id="spgist">
+<sect1 id="spgist">
SP-GiST Indexes
SP-GiST
-1 id="spgist-intro">
+2 id="spgist-intro">
Introduction
-1>
+2>
-1 id="spgist-builtin-opclasses">
+2 id="spgist-builtin-opclasses">
Built-in Operator Classes
search over indexed point or polygon data sets.
-1>
+2>
-1 id="spgist-extensibility">
+2 id="spgist-extensibility">
Extensibility
PG_GET_COLLATION() mechanism.
-1>
+2>
-1 id="spgist-implementation">
+2 id="spgist-implementation">
Implementation
know.
- 2 id="spgist-limits">
+ 3 id="spgist-limits">
SP-GiST Limits
leaf datum does not become any smaller within ten cycles
of choose method calls.
- 2>
+ 3>
- 2 id="spgist-null-labels">
+ 3 id="spgist-null-labels">
SP-GiST Without Node Labels
for choose to return spgAddNode, since the set
of nodes is supposed to be fixed in such cases.
- 2>
+ 3>
- 2 id="spgist-all-the-same">
+ 3 id="spgist-all-the-same">
All-the-Same
Inner Tuples
depending on how much the inner_consistent function normally
assumes about the meaning of the nodes.
- 2>
+ 3>
-1>
+2>
-1 id="spgist-examples">
+2 id="spgist-examples">
Examples
and src/backend/utils/adt/ to see the code.
-1>
+2>
-chapter>
+sect1>