Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Greenplum
Gpdb
提交
28568e58
G
Gpdb
项目概览
Greenplum
/
Gpdb
通知
7
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
G
Gpdb
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
28568e58
编写于
11月 23, 2006
作者:
N
Neil Conway
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Spelling and related minor fixes for the GIN docs.
上级
ce3d1a4f
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
26 addition
and
27 deletion
+26
-27
doc/src/sgml/gin.sgml
doc/src/sgml/gin.sgml
+26
-27
未找到文件。
doc/src/sgml/gin.sgml
浏览文件 @
28568e58
<!-- $PostgreSQL: pgsql/doc/src/sgml/gin.sgml,v 2.
4 2006/09/18 12:11:36 teodor
Exp $ -->
<!-- $PostgreSQL: pgsql/doc/src/sgml/gin.sgml,v 2.
5 2006/11/23 05:58:01 neilc
Exp $ -->
<chapter id="GIN">
<title>GIN Indexes</title>
...
...
@@ -31,14 +31,13 @@
This is much the same advantage as using <acronym>GiST</acronym>.
</para>
<para>
The <acronym>GIN</acronym>
implementation in <productname>PostgreSQL</productname> is primarily
maintained by Teodor Sigaev and Oleg Bartunov, and there is more
information on their
<ulink url="http://www.sai.msu.su/~megera/oddmuse/index.cgi/Gin">website</ulink>.
</para>
<para>
The <acronym>GIN</acronym>
implementation in <productname>PostgreSQL</productname> is primarily
maintained by Teodor Sigaev and Oleg Bartunov. There is more
information about <acronym>GIN</acronym> on their
<ulink url="http://www.sai.msu.su/~megera/oddmuse/index.cgi/Gin">website</ulink>.
</para>
</sect1>
<sect1 id="gin-extensibility">
...
...
@@ -78,7 +77,7 @@
<variablelist>
<varlistentry>
<term>int compare(
Datum a, Datum b
)</term>
<term>int compare(
Datum a, Datum b
)</term>
<listitem>
<para>
Compares keys (not indexed values!) and returns an integer less than
...
...
@@ -103,22 +102,22 @@
StrategyNumber n)</term>
<listitem>
<para>
Returns an array of keys of the query to be executed. n contains
the strategy number of the operation
(see <xref linkend="xindex-strategies">).
Depending on n, query may be
different type.
Returns an array of keys of the query to be executed. n contains
the
strategy number of the operation (see <xref
linkend="xindex-strategies">). Depending on n, query may be
different type.
</para>
</listitem>
</varlistentry>
<varlistentry>
<term>bool consistent(
bool check[], StrategyNumber n, Datum query)</term>
<term>bool consistent(bool check[], StrategyNumber n, Datum query)</term>
<listitem>
<para>
Returns TRUE if the indexed value satisfies the query qualifier with
strategy n (or may satisfy in case of RECHECK mark in operator class).
Each element of the check array is TRUE if the indexed value has a
corresponding key in the query: if (check[i] == TRUE
) the i-th key of
corresponding key in the query: if (check[i] == TRUE) the i-th key of
the query is present in the indexed value.
</para>
</listitem>
...
...
@@ -129,14 +128,14 @@
</sect1>
<sect1 id="gin-tips">
<title>GIN tips and trics</title>
<title>GIN tips and tric
k
s</title>
<variablelist>
<varlistentry>
<term>Create vs insert</term>
<listitem>
<para>
In most cases, insertion into <acronym>GIN</acronym> index is slow
In most cases, insertion into
a
<acronym>GIN</acronym> index is slow
due to the likelihood of many keys being inserted for each value.
So, for bulk insertions into a table it is advisable to to drop the GIN
index and recreate it after finishing bulk insertion.
...
...
@@ -169,9 +168,9 @@
the whole result set, chosen at random.
</para>
<para>
"Soft" means that the actual number of returned results could slightly
differ from the specified limit, depending on the query and the quality
of the system's random number generator.
<quote>Soft</quote> means that the actual number of returned results
could slightly differ from the specified limit, depending on the query
and the quality
of the system's random number generator.
</para>
</listitem>
</varlistentry>
...
...
@@ -184,16 +183,16 @@
<para>
<acronym>GIN</acronym> doesn't support full index scans due to their
extreme
ly
inefficiency: because there are often many keys per value,
extreme inefficiency: because there are often many keys per value,
each heap pointer will returned several times.
</para>
<para>
When
extractQuery returns zero keys, <acronym>GIN</acronym> will emit a
error: for different opclasses and strategies the semantic meaning of a voi
d
query may be different (for example, any array contains the void array,
but they don't overlap the void array), and <acronym>GIN</acronym> can't
suggest
reasonable answer.
When
<function>extractQuery</function> returns zero keys,
<acronym>GIN</acronym> will emit an error: for different opclasses an
d
strategies the semantic meaning of a void query may be different (for
example, any array contains the void array, but they don't overlap the
void array), and <acronym>GIN</acronym> can't suggest a
reasonable answer.
</para>
<para>
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录