1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Chapter49.GiST Indexes</title>
<link rel="stylesheet" href="stylesheet.css" type="text/css">
<link rev="made" href="pgsql-docs@postgresql.org">
<meta name="generator" content="DocBook XSL Stylesheets V1.70.0">
<link rel="start" href="index.html" title="PostgreSQL 8.1.4 Documentation">
<link rel="up" href="internals.html" title="PartVII.Internals">
<link rel="prev" href="index-cost-estimation.html" title="48.6.Index Cost Estimation Functions">
<link rel="next" href="gist-extensibility.html" title="49.2.Extensibility">
<link rel="copyright" href="ln-legalnotice.html" title="Legal Notice">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="chapter" lang="en" id="gist">
<div class="titlepage"><div><div><h2 class="title">
<a name="gist"></a>Chapter49.GiST Indexes</h2></div></div></div>
<div class="toc">
<p><b>Table of Contents</b></p>
<dl>
<dt><span class="sect1"><a href="gist.html#gist-intro">49.1. Introduction</a></span></dt>
<dt><span class="sect1"><a href="gist-extensibility.html">49.2. Extensibility</a></span></dt>
<dt><span class="sect1"><a href="gist-implementation.html">49.3. Implementation</a></span></dt>
<dt><span class="sect1"><a href="gist-examples.html">49.4. Examples</a></span></dt>
<dt><span class="sect1"><a href="gist-recovery.html">49.5. Crash Recovery</a></span></dt>
</dl>
</div>
<div class="sect1" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="gist-intro"></a>49.1.Introduction</h2></div></div></div>
<p> <a name="id843936"></a>
<a name="id843946"></a>
<acronym class="acronym">GiST</acronym> stands for Generalized Search Tree. It is a
balanced, tree-structured access method, that acts as a base template in
which to implement arbitrary indexing schemes. B+-trees, R-trees and many
other indexing schemes can be implemented in <acronym class="acronym">GiST</acronym>.
</p>
<p> One advantage of <acronym class="acronym">GiST</acronym> is that it allows the development
of custom data types with the appropriate access methods, by
an expert in the domain of the data type, rather than a database expert.
</p>
<p> Some of the information here is derived from the University of California at
Berkeley's GiST Indexing Project
<a href="http://gist.cs.berkeley.edu/" target="_top">web site</a> and
<a href="http://www.sai.msu.su/~megera/postgres/gist/papers/concurrency/access-methods-for-next-generation.pdf.gz" target="_top"> Marcel Kornacker's thesis, Access Methods for Next-Generation Database Systems</a>.
The <acronym class="acronym">GiST</acronym>
implementation in <span class="productname">PostgreSQL</span> is primarily
maintained by Teodor Sigaev and Oleg Bartunov, and there is more
information on their
<a href="http://www.sai.msu.su/~megera/postgres/gist/" target="_top">website</a>.
</p>
</div>
</div></body>
</html>
|
