Linux server.kiran-academy.com 3.10.0-1160.108.1.el7.x86_64 #1 SMP Thu Jan 25 16:17:31 UTC 2024 x86_64
Apache/2.4.57 (Unix) OpenSSL/1.0.2k-fips
: 194.233.91.196 | : 216.73.216.216
Cant Read [ /etc/named.conf ]
7.4.32
finalho
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
share /
doc /
postgresql-9.2.24 /
html /
[ HOME SHELL ]
Name
Size
Permission
Action
LEGALNOTICE.html
2.62
KB
-rw-r--r--
acronyms.html
15.9
KB
-rw-r--r--
admin.html
12.27
KB
-rw-r--r--
adminpack.html
7.7
KB
-rw-r--r--
app-clusterdb.html
10.35
KB
-rw-r--r--
app-createdb.html
12.55
KB
-rw-r--r--
app-createlang.html
9.67
KB
-rw-r--r--
app-createuser.html
15.27
KB
-rw-r--r--
app-dropdb.html
9.42
KB
-rw-r--r--
app-droplang.html
9.41
KB
-rw-r--r--
app-dropuser.html
9.37
KB
-rw-r--r--
app-ecpg.html
8.51
KB
-rw-r--r--
app-initdb.html
15.04
KB
-rw-r--r--
app-pg-ctl.html
21.93
KB
-rw-r--r--
app-pg-dumpall.html
20.22
KB
-rw-r--r--
app-pgbasebackup.html
19.37
KB
-rw-r--r--
app-pgconfig.html
10.83
KB
-rw-r--r--
app-pgcontroldata.html
3.89
KB
-rw-r--r--
app-pgdump.html
42.93
KB
-rw-r--r--
app-pgreceivexlog.html
10.8
KB
-rw-r--r--
app-pgresetxlog.html
11.29
KB
-rw-r--r--
app-pgrestore.html
29.56
KB
-rw-r--r--
app-postgres.html
31.08
KB
-rw-r--r--
app-postmaster.html
2.93
KB
-rw-r--r--
app-psql.html
135.62
KB
-rw-r--r--
app-reindexdb.html
11.02
KB
-rw-r--r--
app-vacuumdb.html
12.32
KB
-rw-r--r--
appendixes.html
25.71
KB
-rw-r--r--
applevel-consistency.html
10.07
KB
-rw-r--r--
archive-recovery-settings.html
7.17
KB
-rw-r--r--
arrays.html
27.42
KB
-rw-r--r--
auth-delay.html
3.69
KB
-rw-r--r--
auth-methods.html
35.35
KB
-rw-r--r--
auth-pg-hba-conf.html
29.06
KB
-rw-r--r--
auth-username-maps.html
8.4
KB
-rw-r--r--
auto-explain.html
9.66
KB
-rw-r--r--
backup-dump.html
15.55
KB
-rw-r--r--
backup-file.html
7.81
KB
-rw-r--r--
backup.html
4.38
KB
-rw-r--r--
biblio.html
11.28
KB
-rw-r--r--
bki-commands.html
9.42
KB
-rw-r--r--
bki-example.html
2.98
KB
-rw-r--r--
bki-format.html
3.38
KB
-rw-r--r--
bki-structure.html
4.22
KB
-rw-r--r--
bki.html
4.23
KB
-rw-r--r--
bookindex.html
237.47
KB
-rw-r--r--
btree-gin.html
4.49
KB
-rw-r--r--
btree-gist.html
6.72
KB
-rw-r--r--
bug-reporting.html
18.21
KB
-rw-r--r--
catalog-pg-aggregate.html
5.37
KB
-rw-r--r--
catalog-pg-am.html
10.3
KB
-rw-r--r--
catalog-pg-amop.html
7.42
KB
-rw-r--r--
catalog-pg-amproc.html
4.77
KB
-rw-r--r--
catalog-pg-attrdef.html
4.26
KB
-rw-r--r--
catalog-pg-attribute.html
10.05
KB
-rw-r--r--
catalog-pg-auth-members.html
4.16
KB
-rw-r--r--
catalog-pg-authid.html
6.66
KB
-rw-r--r--
catalog-pg-cast.html
6.79
KB
-rw-r--r--
catalog-pg-class.html
12.36
KB
-rw-r--r--
catalog-pg-collation.html
5.76
KB
-rw-r--r--
catalog-pg-constraint.html
11.31
KB
-rw-r--r--
catalog-pg-conversion.html
4.33
KB
-rw-r--r--
catalog-pg-database.html
6.86
KB
-rw-r--r--
catalog-pg-db-role-setting.htm...
3.97
KB
-rw-r--r--
catalog-pg-default-acl.html
5.14
KB
-rw-r--r--
catalog-pg-depend.html
8.43
KB
-rw-r--r--
catalog-pg-description.html
4.37
KB
-rw-r--r--
catalog-pg-enum.html
4.61
KB
-rw-r--r--
catalog-pg-extension.html
5.16
KB
-rw-r--r--
catalog-pg-foreign-data-wrappe...
4.83
KB
-rw-r--r--
catalog-pg-foreign-server.html
4.58
KB
-rw-r--r--
catalog-pg-foreign-table.html
3.94
KB
-rw-r--r--
catalog-pg-index.html
8.66
KB
-rw-r--r--
catalog-pg-inherits.html
3.8
KB
-rw-r--r--
catalog-pg-language.html
5.81
KB
-rw-r--r--
catalog-pg-largeobject-metadat...
3.54
KB
-rw-r--r--
catalog-pg-largeobject.html
5.03
KB
-rw-r--r--
catalog-pg-namespace.html
3.66
KB
-rw-r--r--
catalog-pg-opclass.html
5.73
KB
-rw-r--r--
catalog-pg-operator.html
6.49
KB
-rw-r--r--
catalog-pg-opfamily.html
4.7
KB
-rw-r--r--
catalog-pg-pltemplate.html
5.24
KB
-rw-r--r--
catalog-pg-proc.html
13.09
KB
-rw-r--r--
catalog-pg-range.html
5.06
KB
-rw-r--r--
catalog-pg-rewrite.html
5.26
KB
-rw-r--r--
catalog-pg-seclabel.html
4.41
KB
-rw-r--r--
catalog-pg-shdepend.html
6.88
KB
-rw-r--r--
catalog-pg-shdescription.html
4.15
KB
-rw-r--r--
catalog-pg-shseclabel.html
4.3
KB
-rw-r--r--
catalog-pg-statistic.html
9.31
KB
-rw-r--r--
catalog-pg-tablespace.html
4.06
KB
-rw-r--r--
catalog-pg-trigger.html
8.09
KB
-rw-r--r--
catalog-pg-ts-config-map.html
4.09
KB
-rw-r--r--
catalog-pg-ts-config.html
4.38
KB
-rw-r--r--
catalog-pg-ts-dict.html
4.61
KB
-rw-r--r--
catalog-pg-ts-parser.html
4.96
KB
-rw-r--r--
catalog-pg-ts-template.html
4.16
KB
-rw-r--r--
catalog-pg-type.html
19.44
KB
-rw-r--r--
catalog-pg-user-mapping.html
3.76
KB
-rw-r--r--
catalogs-overview.html
10.19
KB
-rw-r--r--
catalogs.html
10.14
KB
-rw-r--r--
charset.html
4.06
KB
-rw-r--r--
chkpass.html
4.29
KB
-rw-r--r--
citext.html
10.89
KB
-rw-r--r--
client-authentication-problems...
4.13
KB
-rw-r--r--
client-authentication.html
5.78
KB
-rw-r--r--
client-interfaces.html
13.4
KB
-rw-r--r--
collation.html
13.89
KB
-rw-r--r--
config-setting.html
10.88
KB
-rw-r--r--
connect-estab.html
4.21
KB
-rw-r--r--
continuous-archiving.html
48.66
KB
-rw-r--r--
contrib-dblink-build-sql-delet...
5.32
KB
-rw-r--r--
contrib-dblink-build-sql-inser...
5.91
KB
-rw-r--r--
contrib-dblink-build-sql-updat...
6.13
KB
-rw-r--r--
contrib-dblink-cancel-query.ht...
3.73
KB
-rw-r--r--
contrib-dblink-close.html
4.54
KB
-rw-r--r--
contrib-dblink-connect-u.html
4.38
KB
-rw-r--r--
contrib-dblink-connect.html
7.15
KB
-rw-r--r--
contrib-dblink-disconnect.html
3.63
KB
-rw-r--r--
contrib-dblink-error-message.h...
3.43
KB
-rw-r--r--
contrib-dblink-exec.html
5.34
KB
-rw-r--r--
contrib-dblink-fetch.html
5.84
KB
-rw-r--r--
contrib-dblink-function.html
8.43
KB
-rw-r--r--
contrib-dblink-get-connections...
3.13
KB
-rw-r--r--
contrib-dblink-get-notify.html
4.07
KB
-rw-r--r--
contrib-dblink-get-pkey.html
4.39
KB
-rw-r--r--
contrib-dblink-get-result.html
6.8
KB
-rw-r--r--
contrib-dblink-is-busy.html
3.41
KB
-rw-r--r--
contrib-dblink-open.html
5.34
KB
-rw-r--r--
contrib-dblink-send-query.html
4.07
KB
-rw-r--r--
contrib-prog-client.html
3.35
KB
-rw-r--r--
contrib-prog-server.html
3.75
KB
-rw-r--r--
contrib-prog.html
3.24
KB
-rw-r--r--
contrib-spi.html
10.97
KB
-rw-r--r--
contrib.html
8.7
KB
-rw-r--r--
creating-cluster.html
12.17
KB
-rw-r--r--
cube.html
15.57
KB
-rw-r--r--
database-roles.html
5.95
KB
-rw-r--r--
datatype-binary.html
12.59
KB
-rw-r--r--
datatype-bit.html
4.98
KB
-rw-r--r--
datatype-boolean.html
5.14
KB
-rw-r--r--
datatype-character.html
11.61
KB
-rw-r--r--
datatype-datetime.html
49.57
KB
-rw-r--r--
datatype-enum.html
6.28
KB
-rw-r--r--
datatype-geometric.html
12.21
KB
-rw-r--r--
datatype-json.html
3.36
KB
-rw-r--r--
datatype-money.html
5.35
KB
-rw-r--r--
datatype-net-types.html
10.18
KB
-rw-r--r--
datatype-numeric.html
21.83
KB
-rw-r--r--
datatype-oid.html
9.46
KB
-rw-r--r--
datatype-pseudo.html
7.11
KB
-rw-r--r--
datatype-textsearch.html
9.8
KB
-rw-r--r--
datatype-uuid.html
4.45
KB
-rw-r--r--
datatype-xml.html
11.07
KB
-rw-r--r--
datatype.html
16.22
KB
-rw-r--r--
datetime-appendix.html
3.44
KB
-rw-r--r--
datetime-config-files.html
8.77
KB
-rw-r--r--
datetime-input-rules.html
6.6
KB
-rw-r--r--
datetime-keywords.html
4.98
KB
-rw-r--r--
datetime-units-history.html
7.46
KB
-rw-r--r--
dblink.html
5.2
KB
-rw-r--r--
ddl-alter.html
10.25
KB
-rw-r--r--
ddl-basics.html
7.63
KB
-rw-r--r--
ddl-constraints.html
22.26
KB
-rw-r--r--
ddl-default.html
4.43
KB
-rw-r--r--
ddl-depend.html
6.35
KB
-rw-r--r--
ddl-foreign-data.html
4.38
KB
-rw-r--r--
ddl-inherit.html
14.95
KB
-rw-r--r--
ddl-others.html
3.01
KB
-rw-r--r--
ddl-partitioning.html
27.11
KB
-rw-r--r--
ddl-priv.html
5.92
KB
-rw-r--r--
ddl-schemas.html
17.62
KB
-rw-r--r--
ddl-system-columns.html
7.86
KB
-rw-r--r--
ddl.html
6.23
KB
-rw-r--r--
dict-int.html
4.68
KB
-rw-r--r--
dict-xsyn.html
6.33
KB
-rw-r--r--
different-replication-solution...
14.45
KB
-rw-r--r--
disk-full.html
3.43
KB
-rw-r--r--
disk-usage.html
5.53
KB
-rw-r--r--
diskusage.html
2.61
KB
-rw-r--r--
dml-delete.html
3.48
KB
-rw-r--r--
dml-insert.html
5.67
KB
-rw-r--r--
dml-returning.html
4.98
KB
-rw-r--r--
dml-update.html
5.43
KB
-rw-r--r--
dml.html
2.88
KB
-rw-r--r--
docguide-authoring.html
6.6
KB
-rw-r--r--
docguide-build.html
14.92
KB
-rw-r--r--
docguide-docbook.html
3.76
KB
-rw-r--r--
docguide-style.html
7.25
KB
-rw-r--r--
docguide-toolsets.html
20.2
KB
-rw-r--r--
docguide.html
3.54
KB
-rw-r--r--
dummy-seclabel.html
4.26
KB
-rw-r--r--
dynamic-trace.html
26.6
KB
-rw-r--r--
earthdistance.html
8.6
KB
-rw-r--r--
ecpg-commands.html
9.3
KB
-rw-r--r--
ecpg-concept.html
4.86
KB
-rw-r--r--
ecpg-connect.html
10.57
KB
-rw-r--r--
ecpg-cpp.html
9.4
KB
-rw-r--r--
ecpg-descriptors.html
34.09
KB
-rw-r--r--
ecpg-develop.html
7.78
KB
-rw-r--r--
ecpg-dynamic.html
6.36
KB
-rw-r--r--
ecpg-errors.html
25.13
KB
-rw-r--r--
ecpg-informix-compat.html
51.52
KB
-rw-r--r--
ecpg-library.html
5.66
KB
-rw-r--r--
ecpg-lo.html
5.4
KB
-rw-r--r--
ecpg-pgtypes.html
53.18
KB
-rw-r--r--
ecpg-preproc.html
8.77
KB
-rw-r--r--
ecpg-process.html
5.26
KB
-rw-r--r--
ecpg-sql-allocate-descriptor.h...
3.89
KB
-rw-r--r--
ecpg-sql-commands.html
4.59
KB
-rw-r--r--
ecpg-sql-connect.html
9.16
KB
-rw-r--r--
ecpg-sql-deallocate-descriptor...
3.68
KB
-rw-r--r--
ecpg-sql-declare.html
5.27
KB
-rw-r--r--
ecpg-sql-describe.html
4.49
KB
-rw-r--r--
ecpg-sql-disconnect.html
4.62
KB
-rw-r--r--
ecpg-sql-execute-immediate.htm...
3.79
KB
-rw-r--r--
ecpg-sql-get-descriptor.html
7.53
KB
-rw-r--r--
ecpg-sql-open.html
4.53
KB
-rw-r--r--
ecpg-sql-prepare.html
4.08
KB
-rw-r--r--
ecpg-sql-set-autocommit.html
3.25
KB
-rw-r--r--
ecpg-sql-set-connection.html
3.84
KB
-rw-r--r--
ecpg-sql-set-descriptor.html
5.38
KB
-rw-r--r--
ecpg-sql-type.html
4.91
KB
-rw-r--r--
ecpg-sql-var.html
3.46
KB
-rw-r--r--
ecpg-sql-whenever.html
4.58
KB
-rw-r--r--
ecpg-variables.html
39.34
KB
-rw-r--r--
ecpg.html
10.1
KB
-rw-r--r--
encryption-options.html
7.32
KB
-rw-r--r--
errcodes-appendix.html
36.1
KB
-rw-r--r--
error-message-reporting.html
13.79
KB
-rw-r--r--
error-style-guide.html
16.38
KB
-rw-r--r--
event-log-registration.html
4.09
KB
-rw-r--r--
executor.html
6.46
KB
-rw-r--r--
explicit-joins.html
10.76
KB
-rw-r--r--
explicit-locking.html
24.49
KB
-rw-r--r--
extend-extensions.html
31.67
KB
-rw-r--r--
extend-how.html
4.45
KB
-rw-r--r--
extend-pgxs.html
11.49
KB
-rw-r--r--
extend-type-system.html
9.87
KB
-rw-r--r--
extend.html
9.75
KB
-rw-r--r--
external-admin-tools.html
2.66
KB
-rw-r--r--
external-extensions.html
3.19
KB
-rw-r--r--
external-interfaces.html
5.38
KB
-rw-r--r--
external-pl.html
4.56
KB
-rw-r--r--
external-projects.html
2.93
KB
-rw-r--r--
fdw-callbacks.html
12.6
KB
-rw-r--r--
fdw-functions.html
4.39
KB
-rw-r--r--
fdw-helpers.html
5.85
KB
-rw-r--r--
fdw-planning.html
9.61
KB
-rw-r--r--
fdwhandler.html
3.9
KB
-rw-r--r--
features-sql-standard.html
38.19
KB
-rw-r--r--
features.html
7.39
KB
-rw-r--r--
file-fdw.html
7.53
KB
-rw-r--r--
functions-admin.html
49.21
KB
-rw-r--r--
functions-aggregate.html
21.3
KB
-rw-r--r--
functions-array.html
13.2
KB
-rw-r--r--
functions-binarystring.html
12.29
KB
-rw-r--r--
functions-bitstring.html
6.63
KB
-rw-r--r--
functions-comparison.html
10.39
KB
-rw-r--r--
functions-comparisons.html
13.21
KB
-rw-r--r--
functions-conditional.html
10.75
KB
-rw-r--r--
functions-datetime.html
47.17
KB
-rw-r--r--
functions-enum.html
5.36
KB
-rw-r--r--
functions-formatting.html
34.57
KB
-rw-r--r--
functions-geometry.html
19.87
KB
-rw-r--r--
functions-info.html
57.28
KB
-rw-r--r--
functions-json.html
3.72
KB
-rw-r--r--
functions-logical.html
4.56
KB
-rw-r--r--
functions-matching.html
73.95
KB
-rw-r--r--
functions-math.html
19.92
KB
-rw-r--r--
functions-net.html
13.19
KB
-rw-r--r--
functions-range.html
10.6
KB
-rw-r--r--
functions-sequence.html
12.62
KB
-rw-r--r--
functions-srf.html
8.63
KB
-rw-r--r--
functions-string.html
57.67
KB
-rw-r--r--
functions-subquery.html
16
KB
-rw-r--r--
functions-textsearch.html
20.01
KB
-rw-r--r--
functions-trigger.html
4.44
KB
-rw-r--r--
functions-window.html
11.8
KB
-rw-r--r--
functions-xml.html
31.42
KB
-rw-r--r--
functions.html
9.71
KB
-rw-r--r--
fuzzystrmatch.html
7.87
KB
-rw-r--r--
geqo-biblio.html
3.38
KB
-rw-r--r--
geqo-intro.html
4.31
KB
-rw-r--r--
geqo-intro2.html
5.5
KB
-rw-r--r--
geqo-pg-intro.html
8.58
KB
-rw-r--r--
geqo.html
3.53
KB
-rw-r--r--
gin-examples.html
3.24
KB
-rw-r--r--
gin-extensibility.html
14.06
KB
-rw-r--r--
gin-implementation.html
6.41
KB
-rw-r--r--
gin-intro.html
4.55
KB
-rw-r--r--
gin-limit.html
2.75
KB
-rw-r--r--
gin-tips.html
5.58
KB
-rw-r--r--
gin.html
2.86
KB
-rw-r--r--
gist-examples.html
3.66
KB
-rw-r--r--
gist-extensibility.html
23.78
KB
-rw-r--r--
gist-implementation.html
4
KB
-rw-r--r--
gist-intro.html
3.53
KB
-rw-r--r--
gist.html
2.62
KB
-rw-r--r--
git.html
4.46
KB
-rw-r--r--
high-availability.html
7.52
KB
-rw-r--r--
history.html
11.64
KB
-rw-r--r--
hot-standby.html
35.2
KB
-rw-r--r--
hstore.html
22.1
KB
-rw-r--r--
index-catalog.html
7.81
KB
-rw-r--r--
index-cost-estimation.html
9.76
KB
-rw-r--r--
index-functions.html
18.67
KB
-rw-r--r--
index-locking.html
7.86
KB
-rw-r--r--
index-scanning.html
10.46
KB
-rw-r--r--
index-unique-checks.html
8.98
KB
-rw-r--r--
index.html
7.88
KB
-rw-r--r--
indexam.html
5.12
KB
-rw-r--r--
indexes-bitmap-scans.html
6.43
KB
-rw-r--r--
indexes-collations.html
3.55
KB
-rw-r--r--
indexes-examine.html
6.99
KB
-rw-r--r--
indexes-expressional.html
4.7
KB
-rw-r--r--
indexes-intro.html
6.17
KB
-rw-r--r--
indexes-multicolumn.html
6.15
KB
-rw-r--r--
indexes-opclass.html
7.16
KB
-rw-r--r--
indexes-ordering.html
6.33
KB
-rw-r--r--
indexes-partial.html
11.54
KB
-rw-r--r--
indexes-types.html
9.99
KB
-rw-r--r--
indexes-unique.html
3.91
KB
-rw-r--r--
indexes.html
3.53
KB
-rw-r--r--
information-schema.html
10.92
KB
-rw-r--r--
infoschema-administrable-role-...
3.66
KB
-rw-r--r--
infoschema-applicable-roles.ht...
3.88
KB
-rw-r--r--
infoschema-attributes.html
12.51
KB
-rw-r--r--
infoschema-character-sets.html
6.88
KB
-rw-r--r--
infoschema-check-constraint-ro...
4.25
KB
-rw-r--r--
infoschema-check-constraints.h...
3.79
KB
-rw-r--r--
infoschema-collation-character...
4.32
KB
-rw-r--r--
infoschema-collations.html
3.79
KB
-rw-r--r--
infoschema-column-domain-usage...
4.22
KB
-rw-r--r--
infoschema-column-options.html
4.01
KB
-rw-r--r--
infoschema-column-privileges.h...
4.91
KB
-rw-r--r--
infoschema-column-udt-usage.ht...
4.48
KB
-rw-r--r--
infoschema-columns.html
17.21
KB
-rw-r--r--
infoschema-constraint-column-u...
4.76
KB
-rw-r--r--
infoschema-constraint-table-us...
4.66
KB
-rw-r--r--
infoschema-data-type-privilege...
4.97
KB
-rw-r--r--
infoschema-datatypes.html
4.13
KB
-rw-r--r--
infoschema-domain-constraints....
4.55
KB
-rw-r--r--
infoschema-domain-udt-usage.ht...
4.07
KB
-rw-r--r--
infoschema-domains.html
11.1
KB
-rw-r--r--
infoschema-element-types.html
11.11
KB
-rw-r--r--
infoschema-enabled-roles.html
3.69
KB
-rw-r--r--
infoschema-foreign-data-wrappe...
3.82
KB
-rw-r--r--
infoschema-foreign-data-wrappe...
4.13
KB
-rw-r--r--
infoschema-foreign-server-opti...
3.76
KB
-rw-r--r--
infoschema-foreign-servers.htm...
4.46
KB
-rw-r--r--
infoschema-foreign-table-optio...
3.88
KB
-rw-r--r--
infoschema-foreign-tables.html
3.98
KB
-rw-r--r--
infoschema-information-schema-...
3.28
KB
-rw-r--r--
infoschema-key-column-usage.ht...
5.06
KB
-rw-r--r--
infoschema-parameters.html
10.55
KB
-rw-r--r--
infoschema-referential-constra...
5.53
KB
-rw-r--r--
infoschema-role-column-grants....
4.9
KB
-rw-r--r--
infoschema-role-routine-grants...
5.23
KB
-rw-r--r--
infoschema-role-table-grants.h...
5.3
KB
-rw-r--r--
infoschema-role-udt-grants.htm...
4.67
KB
-rw-r--r--
infoschema-role-usage-grants.h...
4.89
KB
-rw-r--r--
infoschema-routine-privileges....
4.91
KB
-rw-r--r--
infoschema-routines.html
22.51
KB
-rw-r--r--
infoschema-schema.html
3.11
KB
-rw-r--r--
infoschema-schemata.html
4.15
KB
-rw-r--r--
infoschema-sequences.html
5.97
KB
-rw-r--r--
infoschema-sql-features.html
4.6
KB
-rw-r--r--
infoschema-sql-implementation-...
4.4
KB
-rw-r--r--
infoschema-sql-languages.html
4.97
KB
-rw-r--r--
infoschema-sql-packages.html
4.08
KB
-rw-r--r--
infoschema-sql-parts.html
3.98
KB
-rw-r--r--
infoschema-sql-sizing-profiles...
4.08
KB
-rw-r--r--
infoschema-sql-sizing.html
4
KB
-rw-r--r--
infoschema-table-constraints.h...
4.8
KB
-rw-r--r--
infoschema-table-privileges.ht...
4.98
KB
-rw-r--r--
infoschema-tables.html
5.82
KB
-rw-r--r--
infoschema-triggered-update-co...
4.45
KB
-rw-r--r--
infoschema-triggers.html
9.23
KB
-rw-r--r--
infoschema-udt-privileges.html
4.4
KB
-rw-r--r--
infoschema-usage-privileges.ht...
5.38
KB
-rw-r--r--
infoschema-user-defined-types....
9.52
KB
-rw-r--r--
infoschema-user-mapping-option...
4.34
KB
-rw-r--r--
infoschema-user-mappings.html
3.74
KB
-rw-r--r--
infoschema-view-column-usage.h...
4.62
KB
-rw-r--r--
infoschema-view-routine-usage....
4.27
KB
-rw-r--r--
infoschema-view-table-usage.ht...
4.29
KB
-rw-r--r--
infoschema-views.html
5.4
KB
-rw-r--r--
install-getsource.html
3.49
KB
-rw-r--r--
install-post.html
7.89
KB
-rw-r--r--
install-procedure.html
45.44
KB
-rw-r--r--
install-requirements.html
14.14
KB
-rw-r--r--
install-short.html
2.8
KB
-rw-r--r--
install-windows-full.html
18.82
KB
-rw-r--r--
install-windows-libpq.html
6.14
KB
-rw-r--r--
install-windows.html
6.46
KB
-rw-r--r--
installation-platform-notes.ht...
38.46
KB
-rw-r--r--
installation.html
4.06
KB
-rw-r--r--
intagg.html
6.11
KB
-rw-r--r--
intarray.html
13.43
KB
-rw-r--r--
internals.html
15.27
KB
-rw-r--r--
intro-whatis.html
3.92
KB
-rw-r--r--
isn.html
13.04
KB
-rw-r--r--
kernel-resources.html
36.94
KB
-rw-r--r--
largeobjects.html
4.57
KB
-rw-r--r--
libpq-async.html
20.53
KB
-rw-r--r--
libpq-build.html
6.22
KB
-rw-r--r--
libpq-cancel.html
6.62
KB
-rw-r--r--
libpq-connect.html
50.05
KB
-rw-r--r--
libpq-control.html
6.13
KB
-rw-r--r--
libpq-copy.html
21.92
KB
-rw-r--r--
libpq-envars.html
9.59
KB
-rw-r--r--
libpq-events.html
22.55
KB
-rw-r--r--
libpq-example.html
15.65
KB
-rw-r--r--
libpq-exec.html
63.36
KB
-rw-r--r--
libpq-fastpath.html
5.98
KB
-rw-r--r--
libpq-ldap.html
5.38
KB
-rw-r--r--
libpq-misc.html
13.49
KB
-rw-r--r--
libpq-notice-processing.html
6.14
KB
-rw-r--r--
libpq-notify.html
6.56
KB
-rw-r--r--
libpq-pgpass.html
4.75
KB
-rw-r--r--
libpq-pgservice.html
3.81
KB
-rw-r--r--
libpq-single-row-mode.html
6.2
KB
-rw-r--r--
libpq-ssl.html
19.5
KB
-rw-r--r--
libpq-status.html
17.28
KB
-rw-r--r--
libpq-threading.html
5.41
KB
-rw-r--r--
libpq.html
7.73
KB
-rw-r--r--
lo-examplesect.html
8.49
KB
-rw-r--r--
lo-funcs.html
4.53
KB
-rw-r--r--
lo-implementation.html
3.27
KB
-rw-r--r--
lo-interfaces.html
14.8
KB
-rw-r--r--
lo-intro.html
3.13
KB
-rw-r--r--
lo.html
6.47
KB
-rw-r--r--
locale.html
13.37
KB
-rw-r--r--
locking-indexes.html
4.25
KB
-rw-r--r--
log-shipping-alternative.html
10.8
KB
-rw-r--r--
logfile-maintenance.html
6.98
KB
-rw-r--r--
ltree.html
26.66
KB
-rw-r--r--
maintenance.html
5.41
KB
-rw-r--r--
manage-ag-config.html
3.66
KB
-rw-r--r--
manage-ag-createdb.html
6.16
KB
-rw-r--r--
manage-ag-dropdb.html
3.52
KB
-rw-r--r--
manage-ag-overview.html
5.02
KB
-rw-r--r--
manage-ag-tablespaces.html
9.03
KB
-rw-r--r--
manage-ag-templatedbs.html
7.97
KB
-rw-r--r--
managing-databases.html
3.2
KB
-rw-r--r--
monitoring-locks.html
3.59
KB
-rw-r--r--
monitoring-ps.html
6.62
KB
-rw-r--r--
monitoring-stats.html
56.7
KB
-rw-r--r--
monitoring.html
4.35
KB
-rw-r--r--
multibyte.html
31.22
KB
-rw-r--r--
mvcc-caveats.html
3.98
KB
-rw-r--r--
mvcc-intro.html
4.45
KB
-rw-r--r--
mvcc.html
4.2
KB
-rw-r--r--
nls-programmer.html
9.84
KB
-rw-r--r--
nls-translator.html
14.18
KB
-rw-r--r--
nls.html
3.06
KB
-rw-r--r--
non-durability.html
4.38
KB
-rw-r--r--
notation.html
4.31
KB
-rw-r--r--
oid2name.html
11.68
KB
-rw-r--r--
overview.html
4
KB
-rw-r--r--
pageinspect.html
7.93
KB
-rw-r--r--
parser-stage.html
7.93
KB
-rw-r--r--
passwordcheck.html
4.68
KB
-rw-r--r--
performance-tips.html
4.4
KB
-rw-r--r--
perm-functions.html
3.26
KB
-rw-r--r--
pgarchivecleanup.html
8.79
KB
-rw-r--r--
pgbench.html
30.11
KB
-rw-r--r--
pgbuffercache.html
7.53
KB
-rw-r--r--
pgcrypto.html
37.89
KB
-rw-r--r--
pgfreespacemap.html
5.11
KB
-rw-r--r--
pgrowlocks.html
5.94
KB
-rw-r--r--
pgstandby.html
14.85
KB
-rw-r--r--
pgstatstatements.html
15.69
KB
-rw-r--r--
pgstattuple.html
9.23
KB
-rw-r--r--
pgtestfsync.html
5.13
KB
-rw-r--r--
pgtesttiming.html
12.18
KB
-rw-r--r--
pgtrgm.html
12.04
KB
-rw-r--r--
pgupgrade.html
24.16
KB
-rw-r--r--
planner-optimizer.html
9.18
KB
-rw-r--r--
planner-stats-details.html
3.2
KB
-rw-r--r--
planner-stats-security.html
5.43
KB
-rw-r--r--
planner-stats.html
8.85
KB
-rw-r--r--
plhandler.html
13.43
KB
-rw-r--r--
plperl-builtins.html
17.85
KB
-rw-r--r--
plperl-data.html
2.81
KB
-rw-r--r--
plperl-funcs.html
13.06
KB
-rw-r--r--
plperl-global.html
4.95
KB
-rw-r--r--
plperl-triggers.html
6.29
KB
-rw-r--r--
plperl-trusted.html
6.55
KB
-rw-r--r--
plperl-under-the-hood.html
8.78
KB
-rw-r--r--
plperl.html
4.81
KB
-rw-r--r--
plpgsql-control-structures.htm...
45.1
KB
-rw-r--r--
plpgsql-cursors.html
24.99
KB
-rw-r--r--
plpgsql-declarations.html
21.24
KB
-rw-r--r--
plpgsql-development-tips.html
9.29
KB
-rw-r--r--
plpgsql-errors-and-messages.ht...
9.86
KB
-rw-r--r--
plpgsql-expressions.html
4.55
KB
-rw-r--r--
plpgsql-implementation.html
17.62
KB
-rw-r--r--
plpgsql-overview.html
8.82
KB
-rw-r--r--
plpgsql-porting.html
26.46
KB
-rw-r--r--
plpgsql-statements.html
31.47
KB
-rw-r--r--
plpgsql-structure.html
8.13
KB
-rw-r--r--
plpgsql-trigger.html
21.8
KB
-rw-r--r--
plpgsql.html
6.8
KB
-rw-r--r--
plpython-data.html
14.3
KB
-rw-r--r--
plpython-database.html
15.05
KB
-rw-r--r--
plpython-do.html
2.71
KB
-rw-r--r--
plpython-envar.html
3.79
KB
-rw-r--r--
plpython-funcs.html
5.35
KB
-rw-r--r--
plpython-python23.html
7.04
KB
-rw-r--r--
plpython-sharing.html
2.96
KB
-rw-r--r--
plpython-subtransaction.html
7.7
KB
-rw-r--r--
plpython-trigger.html
4.95
KB
-rw-r--r--
plpython-util.html
4.98
KB
-rw-r--r--
plpython.html
5.92
KB
-rw-r--r--
pltcl-data.html
2.84
KB
-rw-r--r--
pltcl-dbaccess.html
13.58
KB
-rw-r--r--
pltcl-functions.html
6.03
KB
-rw-r--r--
pltcl-global.html
4.95
KB
-rw-r--r--
pltcl-overview.html
5.16
KB
-rw-r--r--
pltcl-procnames.html
3.15
KB
-rw-r--r--
pltcl-trigger.html
9.23
KB
-rw-r--r--
pltcl-unknown.html
4.96
KB
-rw-r--r--
pltcl.html
3.32
KB
-rw-r--r--
populate.html
16.71
KB
-rw-r--r--
postgres-user.html
3.24
KB
-rw-r--r--
preface.html
4.95
KB
-rw-r--r--
preventing-server-spoofing.htm...
4.5
KB
-rw-r--r--
protocol-changes.html
6.49
KB
-rw-r--r--
protocol-error-fields.html
5.99
KB
-rw-r--r--
protocol-flow.html
45.12
KB
-rw-r--r--
protocol-message-formats.html
39.89
KB
-rw-r--r--
protocol-message-types.html
4.82
KB
-rw-r--r--
protocol-overview.html
9.44
KB
-rw-r--r--
protocol-replication.html
14.32
KB
-rw-r--r--
protocol.html
5.52
KB
-rw-r--r--
queries-limit.html
5.21
KB
-rw-r--r--
queries-order.html
7.2
KB
-rw-r--r--
queries-overview.html
4.95
KB
-rw-r--r--
queries-select-lists.html
9.09
KB
-rw-r--r--
queries-table-expressions.html
38.94
KB
-rw-r--r--
queries-union.html
4.99
KB
-rw-r--r--
queries-values.html
4.81
KB
-rw-r--r--
queries-with.html
20.39
KB
-rw-r--r--
queries.html
4.31
KB
-rw-r--r--
query-path.html
5.34
KB
-rw-r--r--
querytree.html
10.88
KB
-rw-r--r--
rangetypes.html
22.2
KB
-rw-r--r--
recovery-config.html
3.47
KB
-rw-r--r--
recovery-target-settings.html
7.58
KB
-rw-r--r--
reference-client.html
5.96
KB
-rw-r--r--
reference-server.html
3.87
KB
-rw-r--r--
reference.html
22.62
KB
-rw-r--r--
regress-coverage.html
3.25
KB
-rw-r--r--
regress-evaluation.html
12.19
KB
-rw-r--r--
regress-run.html
13.39
KB
-rw-r--r--
regress-variant.html
7.01
KB
-rw-r--r--
regress.html
4.18
KB
-rw-r--r--
release-0-01.html
2.5
KB
-rw-r--r--
release-0-02.html
4.19
KB
-rw-r--r--
release-0-03.html
7.62
KB
-rw-r--r--
release-1-0.html
4.13
KB
-rw-r--r--
release-1-01.html
9.13
KB
-rw-r--r--
release-1-02.html
6.34
KB
-rw-r--r--
release-1-09.html
2.47
KB
-rw-r--r--
release-6-0.html
7.73
KB
-rw-r--r--
release-6-1-1.html
3.63
KB
-rw-r--r--
release-6-1.html
8.81
KB
-rw-r--r--
release-6-2-1.html
4.3
KB
-rw-r--r--
release-6-2.html
8.67
KB
-rw-r--r--
release-6-3-1.html
4.34
KB
-rw-r--r--
release-6-3-2.html
4.06
KB
-rw-r--r--
release-6-3.html
15.93
KB
-rw-r--r--
release-6-4-1.html
3.97
KB
-rw-r--r--
release-6-4-2.html
2.84
KB
-rw-r--r--
release-6-4.html
14.39
KB
-rw-r--r--
release-6-5-1.html
3.75
KB
-rw-r--r--
release-6-5-2.html
4.01
KB
-rw-r--r--
release-6-5-3.html
2.98
KB
-rw-r--r--
release-6-5.html
16.98
KB
-rw-r--r--
release-7-0-1.html
3.83
KB
-rw-r--r--
release-7-0-2.html
2.82
KB
-rw-r--r--
release-7-0-3.html
4.55
KB
-rw-r--r--
release-7-0.html
22.56
KB
-rw-r--r--
release-7-1-1.html
3.19
KB
-rw-r--r--
release-7-1-2.html
2.91
KB
-rw-r--r--
release-7-1-3.html
3.07
KB
-rw-r--r--
release-7-1.html
12.71
KB
-rw-r--r--
release-7-2-1.html
3.92
KB
-rw-r--r--
release-7-2-2.html
3.7
KB
-rw-r--r--
release-7-2-3.html
3.29
KB
-rw-r--r--
release-7-2-4.html
3.5
KB
-rw-r--r--
release-7-2-5.html
3.66
KB
-rw-r--r--
release-7-2-6.html
3.54
KB
-rw-r--r--
release-7-2-7.html
3.64
KB
-rw-r--r--
release-7-2-8.html
3.86
KB
-rw-r--r--
release-7-2.html
26.46
KB
-rw-r--r--
release-7-3-1.html
4.07
KB
-rw-r--r--
release-7-3-10.html
7.32
KB
-rw-r--r--
release-7-3-11.html
4.01
KB
-rw-r--r--
release-7-3-12.html
3.44
KB
-rw-r--r--
release-7-3-13.html
4.51
KB
-rw-r--r--
release-7-3-14.html
3.84
KB
-rw-r--r--
release-7-3-15.html
6.17
KB
-rw-r--r--
release-7-3-16.html
3.34
KB
-rw-r--r--
release-7-3-17.html
3.47
KB
-rw-r--r--
release-7-3-18.html
3.56
KB
-rw-r--r--
release-7-3-19.html
3.6
KB
-rw-r--r--
release-7-3-2.html
5.08
KB
-rw-r--r--
release-7-3-20.html
3.44
KB
-rw-r--r--
release-7-3-21.html
6.07
KB
-rw-r--r--
release-7-3-3.html
10.05
KB
-rw-r--r--
release-7-3-4.html
3.42
KB
-rw-r--r--
release-7-3-5.html
4.39
KB
-rw-r--r--
release-7-3-6.html
4.32
KB
-rw-r--r--
release-7-3-7.html
3.27
KB
-rw-r--r--
release-7-3-8.html
3.49
KB
-rw-r--r--
release-7-3-9.html
3.98
KB
-rw-r--r--
release-7-3.html
32.28
KB
-rw-r--r--
release-7-4-1.html
6.95
KB
-rw-r--r--
release-7-4-10.html
3.72
KB
-rw-r--r--
release-7-4-11.html
4.74
KB
-rw-r--r--
release-7-4-12.html
4.12
KB
-rw-r--r--
release-7-4-13.html
6.8
KB
-rw-r--r--
release-7-4-14.html
3.59
KB
-rw-r--r--
release-7-4-15.html
4.17
KB
-rw-r--r--
release-7-4-16.html
3.88
KB
-rw-r--r--
release-7-4-17.html
3.92
KB
-rw-r--r--
release-7-4-18.html
3.83
KB
-rw-r--r--
release-7-4-19.html
7.07
KB
-rw-r--r--
release-7-4-2.html
8.07
KB
-rw-r--r--
release-7-4-20.html
6.45
KB
-rw-r--r--
release-7-4-21.html
3.83
KB
-rw-r--r--
release-7-4-22.html
3.98
KB
-rw-r--r--
release-7-4-23.html
4.32
KB
-rw-r--r--
release-7-4-24.html
4.19
KB
-rw-r--r--
release-7-4-25.html
4.4
KB
-rw-r--r--
release-7-4-26.html
5.33
KB
-rw-r--r--
release-7-4-27.html
5.04
KB
-rw-r--r--
release-7-4-28.html
5.5
KB
-rw-r--r--
release-7-4-29.html
6.8
KB
-rw-r--r--
release-7-4-3.html
4.51
KB
-rw-r--r--
release-7-4-30.html
6.07
KB
-rw-r--r--
release-7-4-4.html
3.99
KB
-rw-r--r--
release-7-4-5.html
3.12
KB
-rw-r--r--
release-7-4-6.html
4.62
KB
-rw-r--r--
release-7-4-7.html
4.17
KB
-rw-r--r--
release-7-4-8.html
9.92
KB
-rw-r--r--
release-7-4-9.html
5
KB
-rw-r--r--
release-7-4.html
56.03
KB
-rw-r--r--
release-8-0-1.html
4.63
KB
-rw-r--r--
release-8-0-10.html
4.64
KB
-rw-r--r--
release-8-0-11.html
3.88
KB
-rw-r--r--
release-8-0-12.html
3.06
KB
-rw-r--r--
release-8-0-13.html
4.02
KB
-rw-r--r--
release-8-0-14.html
4.41
KB
-rw-r--r--
release-8-0-15.html
8.89
KB
-rw-r--r--
release-8-0-16.html
8.74
KB
-rw-r--r--
release-8-0-17.html
3.83
KB
-rw-r--r--
release-8-0-18.html
5.45
KB
-rw-r--r--
release-8-0-19.html
4.86
KB
-rw-r--r--
release-8-0-2.html
9.34
KB
-rw-r--r--
release-8-0-20.html
4.21
KB
-rw-r--r--
release-8-0-21.html
4.4
KB
-rw-r--r--
release-8-0-22.html
6.29
KB
-rw-r--r--
release-8-0-23.html
5.88
KB
-rw-r--r--
release-8-0-24.html
6.84
KB
-rw-r--r--
release-8-0-25.html
7.25
KB
-rw-r--r--
release-8-0-26.html
7.84
KB
-rw-r--r--
release-8-0-3.html
7.25
KB
-rw-r--r--
release-8-0-4.html
6.52
KB
-rw-r--r--
release-8-0-5.html
4.7
KB
-rw-r--r--
release-8-0-6.html
5.56
KB
-rw-r--r--
release-8-0-7.html
5.77
KB
-rw-r--r--
release-8-0-8.html
7.06
KB
-rw-r--r--
release-8-0-9.html
4.21
KB
-rw-r--r--
release-8-0.html
65.25
KB
-rw-r--r--
release-8-1-1.html
5.33
KB
-rw-r--r--
release-8-1-10.html
4.67
KB
-rw-r--r--
release-8-1-11.html
9.71
KB
-rw-r--r--
release-8-1-12.html
9.12
KB
-rw-r--r--
release-8-1-13.html
4.19
KB
-rw-r--r--
release-8-1-14.html
6.74
KB
-rw-r--r--
release-8-1-15.html
6.13
KB
-rw-r--r--
release-8-1-16.html
5.15
KB
-rw-r--r--
release-8-1-17.html
5.89
KB
-rw-r--r--
release-8-1-18.html
6.29
KB
-rw-r--r--
release-8-1-19.html
6.46
KB
-rw-r--r--
release-8-1-2.html
6.19
KB
-rw-r--r--
release-8-1-20.html
7.13
KB
-rw-r--r--
release-8-1-21.html
7.04
KB
-rw-r--r--
release-8-1-22.html
8.13
KB
-rw-r--r--
release-8-1-23.html
7.75
KB
-rw-r--r--
release-8-1-3.html
6.86
KB
-rw-r--r--
release-8-1-4.html
8.67
KB
-rw-r--r--
release-8-1-5.html
5.35
KB
-rw-r--r--
release-8-1-6.html
5.21
KB
-rw-r--r--
release-8-1-7.html
4.45
KB
-rw-r--r--
release-8-1-8.html
3.04
KB
-rw-r--r--
release-8-1-9.html
4.29
KB
-rw-r--r--
release-8-1.html
60.66
KB
-rw-r--r--
release-8-2-1.html
4.95
KB
-rw-r--r--
release-8-2-10.html
7.99
KB
-rw-r--r--
release-8-2-11.html
6.98
KB
-rw-r--r--
release-8-2-12.html
6.59
KB
-rw-r--r--
release-8-2-13.html
7.18
KB
-rw-r--r--
release-8-2-14.html
7.69
KB
-rw-r--r--
release-8-2-15.html
7.96
KB
-rw-r--r--
release-8-2-16.html
9.08
KB
-rw-r--r--
release-8-2-17.html
8.02
KB
-rw-r--r--
release-8-2-18.html
10.04
KB
-rw-r--r--
release-8-2-19.html
8.39
KB
-rw-r--r--
release-8-2-2.html
5.67
KB
-rw-r--r--
release-8-2-20.html
6.1
KB
-rw-r--r--
release-8-2-21.html
5.46
KB
-rw-r--r--
release-8-2-22.html
9.39
KB
-rw-r--r--
release-8-2-23.html
9.33
KB
-rw-r--r--
release-8-2-3.html
3.02
KB
-rw-r--r--
release-8-2-4.html
5.3
KB
-rw-r--r--
release-8-2-5.html
5.85
KB
-rw-r--r--
release-8-2-6.html
10.3
KB
-rw-r--r--
release-8-2-7.html
9.09
KB
-rw-r--r--
release-8-2-8.html
7.34
KB
-rw-r--r--
release-8-2-9.html
4.18
KB
-rw-r--r--
release-8-2.html
67.77
KB
-rw-r--r--
release-8-3-1.html
10.34
KB
-rw-r--r--
release-8-3-10.html
10.47
KB
-rw-r--r--
release-8-3-11.html
8.75
KB
-rw-r--r--
release-8-3-12.html
11.83
KB
-rw-r--r--
release-8-3-13.html
9.28
KB
-rw-r--r--
release-8-3-14.html
6.1
KB
-rw-r--r--
release-8-3-15.html
6.23
KB
-rw-r--r--
release-8-3-16.html
10.76
KB
-rw-r--r--
release-8-3-17.html
10.34
KB
-rw-r--r--
release-8-3-18.html
11
KB
-rw-r--r--
release-8-3-19.html
8.27
KB
-rw-r--r--
release-8-3-2.html
11.92
KB
-rw-r--r--
release-8-3-20.html
9.03
KB
-rw-r--r--
release-8-3-21.html
4.92
KB
-rw-r--r--
release-8-3-22.html
10.34
KB
-rw-r--r--
release-8-3-23.html
6.14
KB
-rw-r--r--
release-8-3-3.html
4.17
KB
-rw-r--r--
release-8-3-4.html
11.01
KB
-rw-r--r--
release-8-3-5.html
8.49
KB
-rw-r--r--
release-8-3-6.html
8.98
KB
-rw-r--r--
release-8-3-7.html
9.5
KB
-rw-r--r--
release-8-3-8.html
9.04
KB
-rw-r--r--
release-8-3-9.html
9.97
KB
-rw-r--r--
release-8-3.html
68.14
KB
-rw-r--r--
release-8-4-1.html
9.34
KB
-rw-r--r--
release-8-4-10.html
11.65
KB
-rw-r--r--
release-8-4-11.html
13.46
KB
-rw-r--r--
release-8-4-12.html
9.75
KB
-rw-r--r--
release-8-4-13.html
9.49
KB
-rw-r--r--
release-8-4-14.html
5
KB
-rw-r--r--
release-8-4-15.html
10.38
KB
-rw-r--r--
release-8-4-16.html
7.16
KB
-rw-r--r--
release-8-4-17.html
9.35
KB
-rw-r--r--
release-8-4-18.html
6.88
KB
-rw-r--r--
release-8-4-19.html
7.6
KB
-rw-r--r--
release-8-4-2.html
15.33
KB
-rw-r--r--
release-8-4-20.html
15.88
KB
-rw-r--r--
release-8-4-21.html
5.32
KB
-rw-r--r--
release-8-4-22.html
11.04
KB
-rw-r--r--
release-8-4-3.html
13.6
KB
-rw-r--r--
release-8-4-4.html
10.48
KB
-rw-r--r--
release-8-4-5.html
15.56
KB
-rw-r--r--
release-8-4-6.html
10.19
KB
-rw-r--r--
release-8-4-7.html
6.07
KB
-rw-r--r--
release-8-4-8.html
8.64
KB
-rw-r--r--
release-8-4-9.html
14.19
KB
-rw-r--r--
release-8-4.html
85.91
KB
-rw-r--r--
release-9-0-1.html
5.81
KB
-rw-r--r--
release-9-0-10.html
5.56
KB
-rw-r--r--
release-9-0-11.html
12.37
KB
-rw-r--r--
release-9-0-12.html
8.62
KB
-rw-r--r--
release-9-0-13.html
11.4
KB
-rw-r--r--
release-9-0-14.html
8.55
KB
-rw-r--r--
release-9-0-15.html
8.93
KB
-rw-r--r--
release-9-0-16.html
17
KB
-rw-r--r--
release-9-0-17.html
6.19
KB
-rw-r--r--
release-9-0-18.html
11.6
KB
-rw-r--r--
release-9-0-19.html
25.99
KB
-rw-r--r--
release-9-0-2.html
13.32
KB
-rw-r--r--
release-9-0-20.html
15.46
KB
-rw-r--r--
release-9-0-21.html
5.04
KB
-rw-r--r--
release-9-0-22.html
4.22
KB
-rw-r--r--
release-9-0-23.html
15.78
KB
-rw-r--r--
release-9-0-3.html
7.09
KB
-rw-r--r--
release-9-0-4.html
11.08
KB
-rw-r--r--
release-9-0-5.html
17.5
KB
-rw-r--r--
release-9-0-6.html
13.11
KB
-rw-r--r--
release-9-0-7.html
17.67
KB
-rw-r--r--
release-9-0-8.html
10.74
KB
-rw-r--r--
release-9-0-9.html
11.47
KB
-rw-r--r--
release-9-0.html
93.87
KB
-rw-r--r--
release-9-1-1.html
3.58
KB
-rw-r--r--
release-9-1-10.html
10.11
KB
-rw-r--r--
release-9-1-11.html
9.36
KB
-rw-r--r--
release-9-1-12.html
18.12
KB
-rw-r--r--
release-9-1-13.html
6.53
KB
-rw-r--r--
release-9-1-14.html
12.73
KB
-rw-r--r--
release-9-1-15.html
28.29
KB
-rw-r--r--
release-9-1-16.html
18.67
KB
-rw-r--r--
release-9-1-17.html
4.83
KB
-rw-r--r--
release-9-1-18.html
4.01
KB
-rw-r--r--
release-9-1-19.html
17.2
KB
-rw-r--r--
release-9-1-2.html
21.07
KB
-rw-r--r--
release-9-1-20.html
17.13
KB
-rw-r--r--
release-9-1-21.html
7.42
KB
-rw-r--r--
release-9-1-22.html
7.09
KB
-rw-r--r--
release-9-1-23.html
12.36
KB
-rw-r--r--
release-9-1-24.html
8.53
KB
-rw-r--r--
release-9-1-3.html
20.66
KB
-rw-r--r--
release-9-1-4.html
15.64
KB
-rw-r--r--
release-9-1-5.html
13.71
KB
-rw-r--r--
release-9-1-6.html
9.3
KB
-rw-r--r--
release-9-1-7.html
14.59
KB
-rw-r--r--
release-9-1-8.html
9.92
KB
-rw-r--r--
release-9-1-9.html
12.38
KB
-rw-r--r--
release-9-1.html
77.11
KB
-rw-r--r--
release-9-2-1.html
6.94
KB
-rw-r--r--
release-9-2-10.html
31.61
KB
-rw-r--r--
release-9-2-11.html
19.82
KB
-rw-r--r--
release-9-2-12.html
5.01
KB
-rw-r--r--
release-9-2-13.html
4.01
KB
-rw-r--r--
release-9-2-14.html
17.96
KB
-rw-r--r--
release-9-2-15.html
18.17
KB
-rw-r--r--
release-9-2-16.html
7.42
KB
-rw-r--r--
release-9-2-17.html
8
KB
-rw-r--r--
release-9-2-18.html
12.42
KB
-rw-r--r--
release-9-2-19.html
10.27
KB
-rw-r--r--
release-9-2-2.html
22.46
KB
-rw-r--r--
release-9-2-20.html
13.02
KB
-rw-r--r--
release-9-2-21.html
13.87
KB
-rw-r--r--
release-9-2-22.html
15.49
KB
-rw-r--r--
release-9-2-23.html
7.94
KB
-rw-r--r--
release-9-2-24.html
7.69
KB
-rw-r--r--
release-9-2-3.html
13.06
KB
-rw-r--r--
release-9-2-4.html
14.45
KB
-rw-r--r--
release-9-2-5.html
11.72
KB
-rw-r--r--
release-9-2-6.html
11.41
KB
-rw-r--r--
release-9-2-7.html
19.55
KB
-rw-r--r--
release-9-2-8.html
7.2
KB
-rw-r--r--
release-9-2-9.html
15.25
KB
-rw-r--r--
release-9-2.html
77.66
KB
-rw-r--r--
release.html
22.35
KB
-rw-r--r--
resources.html
4.13
KB
-rw-r--r--
role-attributes.html
7.67
KB
-rw-r--r--
role-membership.html
8.19
KB
-rw-r--r--
role-removal.html
5.18
KB
-rw-r--r--
routine-reindex.html
3.54
KB
-rw-r--r--
routine-vacuuming.html
37.13
KB
-rw-r--r--
row-estimation-examples.html
20.28
KB
-rw-r--r--
rowtypes.html
22.86
KB
-rw-r--r--
rule-system.html
4.02
KB
-rw-r--r--
rules-privileges.html
11.39
KB
-rw-r--r--
rules-status.html
4.41
KB
-rw-r--r--
rules-triggers.html
9.25
KB
-rw-r--r--
rules-update.html
31.85
KB
-rw-r--r--
rules-views.html
26.26
KB
-rw-r--r--
rules.html
4.83
KB
-rw-r--r--
runtime-config-autovacuum.html
10.72
KB
-rw-r--r--
runtime-config-client.html
32.05
KB
-rw-r--r--
runtime-config-compatible.html
14.48
KB
-rw-r--r--
runtime-config-connection.html
22.93
KB
-rw-r--r--
runtime-config-custom.html
3.46
KB
-rw-r--r--
runtime-config-developer.html
13.74
KB
-rw-r--r--
runtime-config-error-handling....
3.49
KB
-rw-r--r--
runtime-config-file-locations....
6.81
KB
-rw-r--r--
runtime-config-locks.html
7.46
KB
-rw-r--r--
runtime-config-logging.html
44.38
KB
-rw-r--r--
runtime-config-preset.html
8.51
KB
-rw-r--r--
runtime-config-query.html
24.37
KB
-rw-r--r--
runtime-config-replication.htm...
17.87
KB
-rw-r--r--
runtime-config-resource.html
27.25
KB
-rw-r--r--
runtime-config-short.html
6.53
KB
-rw-r--r--
runtime-config-statistics.html
8.41
KB
-rw-r--r--
runtime-config-wal.html
26.46
KB
-rw-r--r--
runtime-config.html
8.06
KB
-rw-r--r--
runtime.html
5.12
KB
-rw-r--r--
seg.html
15.11
KB
-rw-r--r--
sepgsql.html
30.11
KB
-rw-r--r--
server-programming.html
9.39
KB
-rw-r--r--
server-shutdown.html
6.32
KB
-rw-r--r--
server-start.html
13.88
KB
-rw-r--r--
source-format.html
5.01
KB
-rw-r--r--
source.html
3.98
KB
-rw-r--r--
sourcerepo.html
3.33
KB
-rw-r--r--
spgist-examples.html
2.64
KB
-rw-r--r--
spgist-extensibility.html
30.55
KB
-rw-r--r--
spgist-implementation.html
7.91
KB
-rw-r--r--
spgist-intro.html
4.22
KB
-rw-r--r--
spgist.html
2.9
KB
-rw-r--r--
spi-examples.html
6.07
KB
-rw-r--r--
spi-interface-support.html
3.68
KB
-rw-r--r--
spi-interface.html
5.86
KB
-rw-r--r--
spi-memory.html
6.92
KB
-rw-r--r--
spi-realloc.html
3.54
KB
-rw-r--r--
spi-spi-connect.html
3.96
KB
-rw-r--r--
spi-spi-copytuple.html
3.37
KB
-rw-r--r--
spi-spi-cursor-close.html
3.26
KB
-rw-r--r--
spi-spi-cursor-fetch.html
4.01
KB
-rw-r--r--
spi-spi-cursor-find.html
3.38
KB
-rw-r--r--
spi-spi-cursor-move.html
3.8
KB
-rw-r--r--
spi-spi-cursor-open-with-args....
6.03
KB
-rw-r--r--
spi-spi-cursor-open-with-param...
4.92
KB
-rw-r--r--
spi-spi-cursor-open.html
5.6
KB
-rw-r--r--
spi-spi-exec.html
3.51
KB
-rw-r--r--
spi-spi-execp.html
4.75
KB
-rw-r--r--
spi-spi-execute-plan-with-para...
4.78
KB
-rw-r--r--
spi-spi-execute-plan.html
5.76
KB
-rw-r--r--
spi-spi-execute-with-args.html
6.08
KB
-rw-r--r--
spi-spi-execute.html
12.3
KB
-rw-r--r--
spi-spi-finish.html
3.57
KB
-rw-r--r--
spi-spi-fname.html
3.68
KB
-rw-r--r--
spi-spi-fnumber.html
3.84
KB
-rw-r--r--
spi-spi-freeplan.html
3.42
KB
-rw-r--r--
spi-spi-freetuple.html
3.2
KB
-rw-r--r--
spi-spi-freetupletable.html
3.54
KB
-rw-r--r--
spi-spi-getargcount.html
3.61
KB
-rw-r--r--
spi-spi-getargtypeid.html
4.04
KB
-rw-r--r--
spi-spi-getbinval.html
4.19
KB
-rw-r--r--
spi-spi-getnspname.html
3.39
KB
-rw-r--r--
spi-spi-getrelname.html
3.27
KB
-rw-r--r--
spi-spi-gettype.html
3.63
KB
-rw-r--r--
spi-spi-gettypeid.html
3.63
KB
-rw-r--r--
spi-spi-getvalue.html
4.07
KB
-rw-r--r--
spi-spi-is-cursor-plan.html
4.45
KB
-rw-r--r--
spi-spi-keepplan.html
3.79
KB
-rw-r--r--
spi-spi-modifytuple.html
5.5
KB
-rw-r--r--
spi-spi-palloc.html
3.08
KB
-rw-r--r--
spi-spi-pfree.html
3.2
KB
-rw-r--r--
spi-spi-pop.html
2.68
KB
-rw-r--r--
spi-spi-prepare-cursor.html
4.94
KB
-rw-r--r--
spi-spi-prepare-params.html
4.31
KB
-rw-r--r--
spi-spi-prepare.html
7.48
KB
-rw-r--r--
spi-spi-push.html
3.65
KB
-rw-r--r--
spi-spi-returntuple.html
4
KB
-rw-r--r--
spi-spi-saveplan.html
4.47
KB
-rw-r--r--
spi-spi-scroll-cursor-fetch.ht...
4.7
KB
-rw-r--r--
spi-spi-scroll-cursor-move.htm...
4.78
KB
-rw-r--r--
spi-visibility.html
4.05
KB
-rw-r--r--
spi.html
10.59
KB
-rw-r--r--
sql-abort.html
4.08
KB
-rw-r--r--
sql-alteraggregate.html
5.97
KB
-rw-r--r--
sql-altercollation.html
4.96
KB
-rw-r--r--
sql-alterconversion.html
5.05
KB
-rw-r--r--
sql-alterdatabase.html
8.57
KB
-rw-r--r--
sql-alterdefaultprivileges.htm...
9.19
KB
-rw-r--r--
sql-alterdomain.html
10.85
KB
-rw-r--r--
sql-alterextension.html
11.47
KB
-rw-r--r--
sql-alterforeigndatawrapper.ht...
7.21
KB
-rw-r--r--
sql-alterforeigntable.html
12.41
KB
-rw-r--r--
sql-alterfunction.html
12.54
KB
-rw-r--r--
sql-altergroup.html
5.12
KB
-rw-r--r--
sql-alterindex.html
7.48
KB
-rw-r--r--
sql-alterlanguage.html
3.93
KB
-rw-r--r--
sql-alterlargeobject.html
3.64
KB
-rw-r--r--
sql-alteropclass.html
4.99
KB
-rw-r--r--
sql-alteroperator.html
5.31
KB
-rw-r--r--
sql-alteropfamily.html
13.25
KB
-rw-r--r--
sql-alterrole.html
12.72
KB
-rw-r--r--
sql-alterschema.html
4.21
KB
-rw-r--r--
sql-altersequence.html
12.73
KB
-rw-r--r--
sql-alterserver.html
5.79
KB
-rw-r--r--
sql-altertable.html
42.52
KB
-rw-r--r--
sql-altertablespace.html
5.73
KB
-rw-r--r--
sql-altertrigger.html
4.54
KB
-rw-r--r--
sql-altertsconfig.html
7.94
KB
-rw-r--r--
sql-altertsdictionary.html
6.39
KB
-rw-r--r--
sql-altertsparser.html
4.16
KB
-rw-r--r--
sql-altertstemplate.html
4.12
KB
-rw-r--r--
sql-altertype.html
10.93
KB
-rw-r--r--
sql-alteruser.html
4.61
KB
-rw-r--r--
sql-alterusermapping.html
5.58
KB
-rw-r--r--
sql-alterview.html
6.81
KB
-rw-r--r--
sql-analyze.html
10.42
KB
-rw-r--r--
sql-begin.html
6.54
KB
-rw-r--r--
sql-checkpoint.html
3.67
KB
-rw-r--r--
sql-close.html
4.87
KB
-rw-r--r--
sql-cluster.html
9.18
KB
-rw-r--r--
sql-commands.html
18.37
KB
-rw-r--r--
sql-comment.html
13.48
KB
-rw-r--r--
sql-commit-prepared.html
4.41
KB
-rw-r--r--
sql-commit.html
3.9
KB
-rw-r--r--
sql-copy.html
36.57
KB
-rw-r--r--
sql-createaggregate.html
13.5
KB
-rw-r--r--
sql-createcast.html
19.17
KB
-rw-r--r--
sql-createcollation.html
6.58
KB
-rw-r--r--
sql-createconversion.html
6.38
KB
-rw-r--r--
sql-createdatabase.html
11.85
KB
-rw-r--r--
sql-createdomain.html
8.34
KB
-rw-r--r--
sql-createextension.html
8.87
KB
-rw-r--r--
sql-createforeigndatawrapper.h...
7.87
KB
-rw-r--r--
sql-createforeigntable.html
7.54
KB
-rw-r--r--
sql-createfunction.html
30.35
KB
-rw-r--r--
sql-creategroup.html
3.92
KB
-rw-r--r--
sql-createindex.html
25.33
KB
-rw-r--r--
sql-createlanguage.html
14.54
KB
-rw-r--r--
sql-createopclass.html
12.38
KB
-rw-r--r--
sql-createoperator.html
10.44
KB
-rw-r--r--
sql-createopfamily.html
5.49
KB
-rw-r--r--
sql-createrole.html
18.87
KB
-rw-r--r--
sql-createrule.html
12.36
KB
-rw-r--r--
sql-createschema.html
8.12
KB
-rw-r--r--
sql-createsequence.html
13.54
KB
-rw-r--r--
sql-createserver.html
6.1
KB
-rw-r--r--
sql-createtable.html
57.79
KB
-rw-r--r--
sql-createtableas.html
12.47
KB
-rw-r--r--
sql-createtablespace.html
5.96
KB
-rw-r--r--
sql-createtrigger.html
22.63
KB
-rw-r--r--
sql-createtsconfig.html
5.23
KB
-rw-r--r--
sql-createtsdictionary.html
5.4
KB
-rw-r--r--
sql-createtsparser.html
5.81
KB
-rw-r--r--
sql-createtstemplate.html
5.31
KB
-rw-r--r--
sql-createtype.html
38.54
KB
-rw-r--r--
sql-createuser.html
4.42
KB
-rw-r--r--
sql-createusermapping.html
5.37
KB
-rw-r--r--
sql-createview.html
10.31
KB
-rw-r--r--
sql-deallocate.html
3.7
KB
-rw-r--r--
sql-declare.html
15.04
KB
-rw-r--r--
sql-delete.html
11.5
KB
-rw-r--r--
sql-discard.html
4.21
KB
-rw-r--r--
sql-do.html
5.08
KB
-rw-r--r--
sql-drop-owned.html
4.94
KB
-rw-r--r--
sql-dropaggregate.html
4.45
KB
-rw-r--r--
sql-dropcast.html
4.24
KB
-rw-r--r--
sql-dropcollation.html
4.31
KB
-rw-r--r--
sql-dropconversion.html
4.33
KB
-rw-r--r--
sql-dropdatabase.html
4.24
KB
-rw-r--r--
sql-dropdomain.html
4.16
KB
-rw-r--r--
sql-dropextension.html
4.67
KB
-rw-r--r--
sql-dropforeigndatawrapper.htm...
4.42
KB
-rw-r--r--
sql-dropforeigntable.html
4.45
KB
-rw-r--r--
sql-dropfunction.html
5.7
KB
-rw-r--r--
sql-dropgroup.html
2.98
KB
-rw-r--r--
sql-dropindex.html
5.06
KB
-rw-r--r--
sql-droplanguage.html
4.73
KB
-rw-r--r--
sql-dropopclass.html
5.54
KB
-rw-r--r--
sql-dropoperator.html
5.1
KB
-rw-r--r--
sql-dropopfamily.html
5.16
KB
-rw-r--r--
sql-droprole.html
5.04
KB
-rw-r--r--
sql-droprule.html
4.05
KB
-rw-r--r--
sql-dropschema.html
4.42
KB
-rw-r--r--
sql-dropsequence.html
4.26
KB
-rw-r--r--
sql-dropserver.html
4.17
KB
-rw-r--r--
sql-droptable.html
4.91
KB
-rw-r--r--
sql-droptablespace.html
4.48
KB
-rw-r--r--
sql-droptrigger.html
4.6
KB
-rw-r--r--
sql-droptsconfig.html
4.66
KB
-rw-r--r--
sql-droptsdictionary.html
4.58
KB
-rw-r--r--
sql-droptsparser.html
4.49
KB
-rw-r--r--
sql-droptstemplate.html
4.46
KB
-rw-r--r--
sql-droptype.html
4.36
KB
-rw-r--r--
sql-dropuser.html
3.11
KB
-rw-r--r--
sql-dropusermapping.html
4.57
KB
-rw-r--r--
sql-dropview.html
4.16
KB
-rw-r--r--
sql-end.html
4.06
KB
-rw-r--r--
sql-execute.html
4.95
KB
-rw-r--r--
sql-explain.html
16.69
KB
-rw-r--r--
sql-expressions.html
46.68
KB
-rw-r--r--
sql-fetch.html
13.92
KB
-rw-r--r--
sql-grant.html
28.56
KB
-rw-r--r--
sql-insert.html
12.56
KB
-rw-r--r--
sql-keywords-appendix.html
104.04
KB
-rw-r--r--
sql-listen.html
5.76
KB
-rw-r--r--
sql-load.html
4.11
KB
-rw-r--r--
sql-lock.html
11.59
KB
-rw-r--r--
sql-move.html
4.87
KB
-rw-r--r--
sql-notify.html
10.69
KB
-rw-r--r--
sql-prepare-transaction.html
8.44
KB
-rw-r--r--
sql-prepare.html
8.97
KB
-rw-r--r--
sql-reassign-owned.html
5.22
KB
-rw-r--r--
sql-reindex.html
10.84
KB
-rw-r--r--
sql-release-savepoint.html
4.89
KB
-rw-r--r--
sql-reset.html
4.88
KB
-rw-r--r--
sql-revoke.html
14.53
KB
-rw-r--r--
sql-rollback-prepared.html
4.52
KB
-rw-r--r--
sql-rollback-to.html
6.25
KB
-rw-r--r--
sql-rollback.html
3.9
KB
-rw-r--r--
sql-savepoint.html
5.47
KB
-rw-r--r--
sql-security-label.html
8.67
KB
-rw-r--r--
sql-select.html
77.68
KB
-rw-r--r--
sql-selectinto.html
7.46
KB
-rw-r--r--
sql-set-constraints.html
6.9
KB
-rw-r--r--
sql-set-role.html
6.75
KB
-rw-r--r--
sql-set-session-authorization....
5.92
KB
-rw-r--r--
sql-set-transaction.html
12.4
KB
-rw-r--r--
sql-set.html
11.77
KB
-rw-r--r--
sql-show.html
6.69
KB
-rw-r--r--
sql-start-transaction.html
4.87
KB
-rw-r--r--
sql-syntax-calling-funcs.html
7.89
KB
-rw-r--r--
sql-syntax-lexical.html
42.35
KB
-rw-r--r--
sql-syntax.html
5.3
KB
-rw-r--r--
sql-truncate.html
9.14
KB
-rw-r--r--
sql-unlisten.html
4.81
KB
-rw-r--r--
sql-update.html
15.3
KB
-rw-r--r--
sql-vacuum.html
10.42
KB
-rw-r--r--
sql-values.html
10.39
KB
-rw-r--r--
sql.html
13.25
KB
-rw-r--r--
ssh-tunnels.html
6.12
KB
-rw-r--r--
ssl-tcp.html
13.16
KB
-rw-r--r--
sslinfo.html
7.42
KB
-rw-r--r--
standby-settings.html
5.3
KB
-rw-r--r--
storage-file-layout.html
12.63
KB
-rw-r--r--
storage-fsm.html
3.73
KB
-rw-r--r--
storage-init.html
2.7
KB
-rw-r--r--
storage-page-layout.html
13.57
KB
-rw-r--r--
storage-toast.html
11.21
KB
-rw-r--r--
storage-vm.html
3.46
KB
-rw-r--r--
storage.html
2.88
KB
-rw-r--r--
stylesheet.css
1.5
KB
-rw-r--r--
supported-platforms.html
4.92
KB
-rw-r--r--
tablefunc.html
31.44
KB
-rw-r--r--
tcn.html
4.86
KB
-rw-r--r--
test-parser.html
4.42
KB
-rw-r--r--
textsearch-configuration.html
6.11
KB
-rw-r--r--
textsearch-controls.html
26.33
KB
-rw-r--r--
textsearch-debugging.html
16.82
KB
-rw-r--r--
textsearch-dictionaries.html
30.53
KB
-rw-r--r--
textsearch-features.html
20.81
KB
-rw-r--r--
textsearch-indexes.html
7.21
KB
-rw-r--r--
textsearch-intro.html
18.02
KB
-rw-r--r--
textsearch-limitations.html
3.77
KB
-rw-r--r--
textsearch-migration.html
4.92
KB
-rw-r--r--
textsearch-parsers.html
8.99
KB
-rw-r--r--
textsearch-psql.html
9.13
KB
-rw-r--r--
textsearch-tables.html
9.52
KB
-rw-r--r--
textsearch.html
5.74
KB
-rw-r--r--
transaction-iso.html
26.6
KB
-rw-r--r--
trigger-datachanges.html
4.95
KB
-rw-r--r--
trigger-definition.html
15.14
KB
-rw-r--r--
trigger-example.html
7.57
KB
-rw-r--r--
trigger-interface.html
10.47
KB
-rw-r--r--
triggers.html
3.71
KB
-rw-r--r--
tsearch2.html
9.72
KB
-rw-r--r--
tutorial-accessdb.html
6.88
KB
-rw-r--r--
tutorial-advanced-intro.html
3.26
KB
-rw-r--r--
tutorial-advanced.html
2.79
KB
-rw-r--r--
tutorial-agg.html
7.42
KB
-rw-r--r--
tutorial-arch.html
4.74
KB
-rw-r--r--
tutorial-concepts.html
3.75
KB
-rw-r--r--
tutorial-conclusion.html
2.78
KB
-rw-r--r--
tutorial-createdb.html
8.98
KB
-rw-r--r--
tutorial-delete.html
3.43
KB
-rw-r--r--
tutorial-fk.html
4.32
KB
-rw-r--r--
tutorial-inheritance.html
5.99
KB
-rw-r--r--
tutorial-install.html
4.42
KB
-rw-r--r--
tutorial-join.html
9.46
KB
-rw-r--r--
tutorial-populate.html
4.73
KB
-rw-r--r--
tutorial-select.html
7.84
KB
-rw-r--r--
tutorial-sql-intro.html
4.79
KB
-rw-r--r--
tutorial-sql.html
2.99
KB
-rw-r--r--
tutorial-start.html
2.57
KB
-rw-r--r--
tutorial-table.html
5.57
KB
-rw-r--r--
tutorial-transactions.html
9.71
KB
-rw-r--r--
tutorial-update.html
3.08
KB
-rw-r--r--
tutorial-views.html
3.3
KB
-rw-r--r--
tutorial-window.html
12.19
KB
-rw-r--r--
tutorial.html
5.09
KB
-rw-r--r--
typeconv-func.html
11.88
KB
-rw-r--r--
typeconv-oper.html
14.56
KB
-rw-r--r--
typeconv-overview.html
8.11
KB
-rw-r--r--
typeconv-query.html
5.32
KB
-rw-r--r--
typeconv-union-case.html
6.46
KB
-rw-r--r--
typeconv.html
3.63
KB
-rw-r--r--
unaccent.html
6.58
KB
-rw-r--r--
unsupported-features-sql-stand...
34.29
KB
-rw-r--r--
upgrading.html
12.5
KB
-rw-r--r--
user-manag.html
3.89
KB
-rw-r--r--
using-explain.html
40.84
KB
-rw-r--r--
uuid-ossp.html
7.06
KB
-rw-r--r--
vacuumlo.html
7.37
KB
-rw-r--r--
view-pg-available-extension-ve...
4.53
KB
-rw-r--r--
view-pg-available-extensions.h...
3.85
KB
-rw-r--r--
view-pg-cursors.html
5.54
KB
-rw-r--r--
view-pg-group.html
3.81
KB
-rw-r--r--
view-pg-indexes.html
4.06
KB
-rw-r--r--
view-pg-locks.html
14.11
KB
-rw-r--r--
view-pg-prepared-statements.ht...
4.94
KB
-rw-r--r--
view-pg-prepared-xacts.html
4.8
KB
-rw-r--r--
view-pg-roles.html
5.93
KB
-rw-r--r--
view-pg-rules.html
3.91
KB
-rw-r--r--
view-pg-seclabels.html
5
KB
-rw-r--r--
view-pg-settings.html
10.35
KB
-rw-r--r--
view-pg-shadow.html
5.25
KB
-rw-r--r--
view-pg-stats.html
8.68
KB
-rw-r--r--
view-pg-tables.html
4.72
KB
-rw-r--r--
view-pg-timezone-abbrevs.html
3.77
KB
-rw-r--r--
view-pg-timezone-names.html
4.08
KB
-rw-r--r--
view-pg-user-mappings.html
5.04
KB
-rw-r--r--
view-pg-user.html
4.41
KB
-rw-r--r--
view-pg-views.html
3.76
KB
-rw-r--r--
views-overview.html
6.39
KB
-rw-r--r--
wal-async-commit.html
8.8
KB
-rw-r--r--
wal-configuration.html
14.61
KB
-rw-r--r--
wal-internals.html
6.01
KB
-rw-r--r--
wal-intro.html
5.4
KB
-rw-r--r--
wal-reliability.html
11.21
KB
-rw-r--r--
wal.html
2.86
KB
-rw-r--r--
warm-standby-failover.html
5.96
KB
-rw-r--r--
warm-standby.html
33.83
KB
-rw-r--r--
xaggr.html
9.67
KB
-rw-r--r--
xfunc-c.html
76.68
KB
-rw-r--r--
xfunc-internal.html
3.91
KB
-rw-r--r--
xfunc-overload.html
5.77
KB
-rw-r--r--
xfunc-pl.html
2.92
KB
-rw-r--r--
xfunc-sql.html
37.14
KB
-rw-r--r--
xfunc-volatility.html
9.61
KB
-rw-r--r--
xfunc.html
4.41
KB
-rw-r--r--
xindex.html
43.55
KB
-rw-r--r--
xml2.html
16.5
KB
-rw-r--r--
xoper-optimization.html
22.6
KB
-rw-r--r--
xoper.html
4.72
KB
-rw-r--r--
xplang-install.html
10.87
KB
-rw-r--r--
xplang.html
4.14
KB
-rw-r--r--
xtypes.html
11.83
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : spgist-extensibility.html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> <HTML ><HEAD ><TITLE >Extensibility</TITLE ><META NAME="GENERATOR" CONTENT="Modular DocBook HTML Stylesheet Version 1.79"><LINK REV="MADE" HREF="mailto:pgsql-docs@postgresql.org"><LINK REL="HOME" TITLE="PostgreSQL 9.2.24 Documentation" HREF="index.html"><LINK REL="UP" TITLE="SP-GiST Indexes" HREF="spgist.html"><LINK REL="PREVIOUS" TITLE="Introduction" HREF="spgist-intro.html"><LINK REL="NEXT" TITLE="Implementation" HREF="spgist-implementation.html"><LINK REL="STYLESHEET" TYPE="text/css" HREF="stylesheet.css"><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=ISO-8859-1"><META NAME="creation" CONTENT="2017-11-06T22:43:11"></HEAD ><BODY CLASS="SECT1" ><DIV CLASS="NAVHEADER" ><TABLE SUMMARY="Header navigation table" WIDTH="100%" BORDER="0" CELLPADDING="0" CELLSPACING="0" ><TR ><TH COLSPAN="5" ALIGN="center" VALIGN="bottom" ><A HREF="index.html" >PostgreSQL 9.2.24 Documentation</A ></TH ></TR ><TR ><TD WIDTH="10%" ALIGN="left" VALIGN="top" ><A TITLE="Introduction" HREF="spgist-intro.html" ACCESSKEY="P" >Prev</A ></TD ><TD WIDTH="10%" ALIGN="left" VALIGN="top" ><A HREF="spgist.html" ACCESSKEY="U" >Up</A ></TD ><TD WIDTH="60%" ALIGN="center" VALIGN="bottom" >Chapter 54. SP-GiST Indexes</TD ><TD WIDTH="20%" ALIGN="right" VALIGN="top" ><A TITLE="Implementation" HREF="spgist-implementation.html" ACCESSKEY="N" >Next</A ></TD ></TR ></TABLE ><HR ALIGN="LEFT" WIDTH="100%"></DIV ><DIV CLASS="SECT1" ><H1 CLASS="SECT1" ><A NAME="SPGIST-EXTENSIBILITY" >54.2. Extensibility</A ></H1 ><P > <ACRONYM CLASS="ACRONYM" >SP-GiST</ACRONYM > offers an interface with a high level of abstraction, requiring the access method developer to implement only methods specific to a given data type. The <ACRONYM CLASS="ACRONYM" >SP-GiST</ACRONYM > core is responsible for efficient disk mapping and searching the tree structure. It also takes care of concurrency and logging considerations. </P ><P > Leaf tuples of an <ACRONYM CLASS="ACRONYM" >SP-GiST</ACRONYM > tree contain values of the same data type as the indexed column. Leaf tuples at the root level will always contain the original indexed data value, but leaf tuples at lower levels might contain only a compressed representation, such as a suffix. In that case the operator class support functions must be able to reconstruct the original value using information accumulated from the inner tuples that are passed through to reach the leaf level. </P ><P > Inner tuples are more complex, since they are branching points in the search tree. Each inner tuple contains a set of one or more <I CLASS="FIRSTTERM" >nodes</I >, which represent groups of similar leaf values. A node contains a downlink that leads to either another, lower-level inner tuple, or a short list of leaf tuples that all lie on the same index page. Each node has a <I CLASS="FIRSTTERM" >label</I > that describes it; for example, in a suffix tree the node label could be the next character of the string value. Optionally, an inner tuple can have a <I CLASS="FIRSTTERM" >prefix</I > value that describes all its members. In a suffix tree this could be the common prefix of the represented strings. The prefix value is not necessarily really a prefix, but can be any data needed by the operator class; for example, in a quad-tree it can store the central point that the four quadrants are measured with respect to. A quad-tree inner tuple would then also contain four nodes corresponding to the quadrants around this central point. </P ><P > Some tree algorithms require knowledge of level (or depth) of the current tuple, so the <ACRONYM CLASS="ACRONYM" >SP-GiST</ACRONYM > core provides the possibility for operator classes to manage level counting while descending the tree. There is also support for incrementally reconstructing the represented value when that is needed. </P ><DIV CLASS="NOTE" ><BLOCKQUOTE CLASS="NOTE" ><P ><B >Note: </B > The <ACRONYM CLASS="ACRONYM" >SP-GiST</ACRONYM > core code takes care of null entries. Although <ACRONYM CLASS="ACRONYM" >SP-GiST</ACRONYM > indexes do store entries for nulls in indexed columns, this is hidden from the index operator class code: no null index entries or search conditions will ever be passed to the operator class methods. (It is assumed that <ACRONYM CLASS="ACRONYM" >SP-GiST</ACRONYM > operators are strict and so cannot succeed for null values.) Null values are therefore not discussed further here. </P ></BLOCKQUOTE ></DIV ><P > There are five user-defined methods that an index operator class for <ACRONYM CLASS="ACRONYM" >SP-GiST</ACRONYM > must provide. All five follow the convention of accepting two <TT CLASS="TYPE" >internal</TT > arguments, the first of which is a pointer to a C struct containing input values for the support method, while the second argument is a pointer to a C struct where output values must be placed. Four of the methods just return <TT CLASS="TYPE" >void</TT >, since all their results appear in the output struct; but <CODE CLASS="FUNCTION" >leaf_consistent</CODE > additionally returns a <TT CLASS="TYPE" >boolean</TT > result. The methods must not modify any fields of their input structs. In all cases, the output struct is initialized to zeroes before calling the user-defined method. </P ><P > The five user-defined methods are: </P ><P ></P ><DIV CLASS="VARIABLELIST" ><DL ><DT ><CODE CLASS="FUNCTION" >config</CODE ></DT ><DD ><P > Returns static information about the index implementation, including the data type OIDs of the prefix and node label data types. </P ><P > The <ACRONYM CLASS="ACRONYM" >SQL</ACRONYM > declaration of the function must look like this: </P><PRE CLASS="PROGRAMLISTING" >CREATE FUNCTION my_config(internal, internal) RETURNS void ...</PRE ><P> The first argument is a pointer to a <TT CLASS="STRUCTNAME" >spgConfigIn</TT > C struct, containing input data for the function. The second argument is a pointer to a <TT CLASS="STRUCTNAME" >spgConfigOut</TT > C struct, which the function must fill with result data. </P><PRE CLASS="PROGRAMLISTING" >typedef struct spgConfigIn { Oid attType; /* Data type to be indexed */ } spgConfigIn; typedef struct spgConfigOut { Oid prefixType; /* Data type of inner-tuple prefixes */ Oid labelType; /* Data type of inner-tuple node labels */ bool canReturnData; /* Opclass can reconstruct original data */ bool longValuesOK; /* Opclass can cope with values > 1 page */ } spgConfigOut;</PRE ><P> <TT CLASS="STRUCTFIELD" >attType</TT > is passed in order to support polymorphic index operator classes; for ordinary fixed-data-type operator classes, it will always have the same value and so can be ignored. </P ><P > For operator classes that do not use prefixes, <TT CLASS="STRUCTFIELD" >prefixType</TT > can be set to <TT CLASS="LITERAL" >VOIDOID</TT >. Likewise, for operator classes that do not use node labels, <TT CLASS="STRUCTFIELD" >labelType</TT > can be set to <TT CLASS="LITERAL" >VOIDOID</TT >. <TT CLASS="STRUCTFIELD" >canReturnData</TT > should be set true if the operator class is capable of reconstructing the originally-supplied index value. <TT CLASS="STRUCTFIELD" >longValuesOK</TT > should be set true only when the <TT CLASS="STRUCTFIELD" >attType</TT > is of variable length and the operator class is capable of segmenting long values by repeated suffixing (see <A HREF="spgist-implementation.html#SPGIST-LIMITS" >Section 54.3.1</A >). </P ></DD ><DT ><CODE CLASS="FUNCTION" >choose</CODE ></DT ><DD ><P > Chooses a method for inserting a new value into an inner tuple. </P ><P > The <ACRONYM CLASS="ACRONYM" >SQL</ACRONYM > declaration of the function must look like this: </P><PRE CLASS="PROGRAMLISTING" >CREATE FUNCTION my_choose(internal, internal) RETURNS void ...</PRE ><P> The first argument is a pointer to a <TT CLASS="STRUCTNAME" >spgChooseIn</TT > C struct, containing input data for the function. The second argument is a pointer to a <TT CLASS="STRUCTNAME" >spgChooseOut</TT > C struct, which the function must fill with result data. </P><PRE CLASS="PROGRAMLISTING" >typedef struct spgChooseIn { Datum datum; /* original datum to be indexed */ Datum leafDatum; /* current datum to be stored at leaf */ int level; /* current level (counting from zero) */ /* Data from current inner tuple */ bool allTheSame; /* tuple is marked all-the-same? */ bool hasPrefix; /* tuple has a prefix? */ Datum prefixDatum; /* if so, the prefix value */ int nNodes; /* number of nodes in the inner tuple */ Datum *nodeLabels; /* node label values (NULL if none) */ } spgChooseIn; typedef enum spgChooseResultType { spgMatchNode = 1, /* descend into existing node */ spgAddNode, /* add a node to the inner tuple */ spgSplitTuple /* split inner tuple (change its prefix) */ } spgChooseResultType; typedef struct spgChooseOut { spgChooseResultType resultType; /* action code, see above */ union { struct /* results for spgMatchNode */ { int nodeN; /* descend to this node (index from 0) */ int levelAdd; /* increment level by this much */ Datum restDatum; /* new leaf datum */ } matchNode; struct /* results for spgAddNode */ { Datum nodeLabel; /* new node's label */ int nodeN; /* where to insert it (index from 0) */ } addNode; struct /* results for spgSplitTuple */ { /* Info to form new inner tuple with one node */ bool prefixHasPrefix; /* tuple should have a prefix? */ Datum prefixPrefixDatum; /* if so, its value */ Datum nodeLabel; /* node's label */ /* Info to form new lower-level inner tuple with all old nodes */ bool postfixHasPrefix; /* tuple should have a prefix? */ Datum postfixPrefixDatum; /* if so, its value */ } splitTuple; } result; } spgChooseOut;</PRE ><P> <TT CLASS="STRUCTFIELD" >datum</TT > is the original datum that was to be inserted into the index. <TT CLASS="STRUCTFIELD" >leafDatum</TT > is initially the same as <TT CLASS="STRUCTFIELD" >datum</TT >, but can change at lower levels of the tree if the <CODE CLASS="FUNCTION" >choose</CODE > or <CODE CLASS="FUNCTION" >picksplit</CODE > methods change it. When the insertion search reaches a leaf page, the current value of <TT CLASS="STRUCTFIELD" >leafDatum</TT > is what will be stored in the newly created leaf tuple. <TT CLASS="STRUCTFIELD" >level</TT > is the current inner tuple's level, starting at zero for the root level. <TT CLASS="STRUCTFIELD" >allTheSame</TT > is true if the current inner tuple is marked as containing multiple equivalent nodes (see <A HREF="spgist-implementation.html#SPGIST-ALL-THE-SAME" >Section 54.3.3</A >). <TT CLASS="STRUCTFIELD" >hasPrefix</TT > is true if the current inner tuple contains a prefix; if so, <TT CLASS="STRUCTFIELD" >prefixDatum</TT > is its value. <TT CLASS="STRUCTFIELD" >nNodes</TT > is the number of child nodes contained in the inner tuple, and <TT CLASS="STRUCTFIELD" >nodeLabels</TT > is an array of their label values, or NULL if there are no labels. </P ><P > The <CODE CLASS="FUNCTION" >choose</CODE > function can determine either that the new value matches one of the existing child nodes, or that a new child node must be added, or that the new value is inconsistent with the tuple prefix and so the inner tuple must be split to create a less restrictive prefix. </P ><P > If the new value matches one of the existing child nodes, set <TT CLASS="STRUCTFIELD" >resultType</TT > to <TT CLASS="LITERAL" >spgMatchNode</TT >. Set <TT CLASS="STRUCTFIELD" >nodeN</TT > to the index (from zero) of that node in the node array. Set <TT CLASS="STRUCTFIELD" >levelAdd</TT > to the increment in <TT CLASS="STRUCTFIELD" >level</TT > caused by descending through that node, or leave it as zero if the operator class does not use levels. Set <TT CLASS="STRUCTFIELD" >restDatum</TT > to equal <TT CLASS="STRUCTFIELD" >datum</TT > if the operator class does not modify datums from one level to the next, or otherwise set it to the modified value to be used as <TT CLASS="STRUCTFIELD" >leafDatum</TT > at the next level. </P ><P > If a new child node must be added, set <TT CLASS="STRUCTFIELD" >resultType</TT > to <TT CLASS="LITERAL" >spgAddNode</TT >. Set <TT CLASS="STRUCTFIELD" >nodeLabel</TT > to the label to be used for the new node, and set <TT CLASS="STRUCTFIELD" >nodeN</TT > to the index (from zero) at which to insert the node in the node array. After the node has been added, the <CODE CLASS="FUNCTION" >choose</CODE > function will be called again with the modified inner tuple; that call should result in an <TT CLASS="LITERAL" >spgMatchNode</TT > result. </P ><P > If the new value is inconsistent with the tuple prefix, set <TT CLASS="STRUCTFIELD" >resultType</TT > to <TT CLASS="LITERAL" >spgSplitTuple</TT >. This action moves all the existing nodes into a new lower-level inner tuple, and replaces the existing inner tuple with a tuple having a single node that links to the new lower-level inner tuple. Set <TT CLASS="STRUCTFIELD" >prefixHasPrefix</TT > to indicate whether the new upper tuple should have a prefix, and if so set <TT CLASS="STRUCTFIELD" >prefixPrefixDatum</TT > to the prefix value. This new prefix value must be sufficiently less restrictive than the original to accept the new value to be indexed, and it should be no longer than the original prefix. Set <TT CLASS="STRUCTFIELD" >nodeLabel</TT > to the label to be used for the node that will point to the new lower-level inner tuple. Set <TT CLASS="STRUCTFIELD" >postfixHasPrefix</TT > to indicate whether the new lower-level inner tuple should have a prefix, and if so set <TT CLASS="STRUCTFIELD" >postfixPrefixDatum</TT > to the prefix value. The combination of these two prefixes and the additional label must have the same meaning as the original prefix, because there is no opportunity to alter the node labels that are moved to the new lower-level tuple, nor to change any child index entries. After the node has been split, the <CODE CLASS="FUNCTION" >choose</CODE > function will be called again with the replacement inner tuple. That call will usually result in an <TT CLASS="LITERAL" >spgAddNode</TT > result, since presumably the node label added in the split step will not match the new value; so after that, there will be a third call that finally returns <TT CLASS="LITERAL" >spgMatchNode</TT > and allows the insertion to descend to the leaf level. </P ></DD ><DT ><CODE CLASS="FUNCTION" >picksplit</CODE ></DT ><DD ><P > Decides how to create a new inner tuple over a set of leaf tuples. </P ><P > The <ACRONYM CLASS="ACRONYM" >SQL</ACRONYM > declaration of the function must look like this: </P><PRE CLASS="PROGRAMLISTING" >CREATE FUNCTION my_picksplit(internal, internal) RETURNS void ...</PRE ><P> The first argument is a pointer to a <TT CLASS="STRUCTNAME" >spgPickSplitIn</TT > C struct, containing input data for the function. The second argument is a pointer to a <TT CLASS="STRUCTNAME" >spgPickSplitOut</TT > C struct, which the function must fill with result data. </P><PRE CLASS="PROGRAMLISTING" >typedef struct spgPickSplitIn { int nTuples; /* number of leaf tuples */ Datum *datums; /* their datums (array of length nTuples) */ int level; /* current level (counting from zero) */ } spgPickSplitIn; typedef struct spgPickSplitOut { bool hasPrefix; /* new inner tuple should have a prefix? */ Datum prefixDatum; /* if so, its value */ int nNodes; /* number of nodes for new inner tuple */ Datum *nodeLabels; /* their labels (or NULL for no labels) */ int *mapTuplesToNodes; /* node index for each leaf tuple */ Datum *leafTupleDatums; /* datum to store in each new leaf tuple */ } spgPickSplitOut;</PRE ><P> <TT CLASS="STRUCTFIELD" >nTuples</TT > is the number of leaf tuples provided. <TT CLASS="STRUCTFIELD" >datums</TT > is an array of their datum values. <TT CLASS="STRUCTFIELD" >level</TT > is the current level that all the leaf tuples share, which will become the level of the new inner tuple. </P ><P > Set <TT CLASS="STRUCTFIELD" >hasPrefix</TT > to indicate whether the new inner tuple should have a prefix, and if so set <TT CLASS="STRUCTFIELD" >prefixDatum</TT > to the prefix value. Set <TT CLASS="STRUCTFIELD" >nNodes</TT > to indicate the number of nodes that the new inner tuple will contain, and set <TT CLASS="STRUCTFIELD" >nodeLabels</TT > to an array of their label values. (If the nodes do not require labels, set <TT CLASS="STRUCTFIELD" >nodeLabels</TT > to NULL; see <A HREF="spgist-implementation.html#SPGIST-NULL-LABELS" >Section 54.3.2</A > for details.) Set <TT CLASS="STRUCTFIELD" >mapTuplesToNodes</TT > to an array that gives the index (from zero) of the node that each leaf tuple should be assigned to. Set <TT CLASS="STRUCTFIELD" >leafTupleDatums</TT > to an array of the values to be stored in the new leaf tuples (these will be the same as the input <TT CLASS="STRUCTFIELD" >datums</TT > if the operator class does not modify datums from one level to the next). Note that the <CODE CLASS="FUNCTION" >picksplit</CODE > function is responsible for palloc'ing the <TT CLASS="STRUCTFIELD" >nodeLabels</TT >, <TT CLASS="STRUCTFIELD" >mapTuplesToNodes</TT > and <TT CLASS="STRUCTFIELD" >leafTupleDatums</TT > arrays. </P ><P > If more than one leaf tuple is supplied, it is expected that the <CODE CLASS="FUNCTION" >picksplit</CODE > function will classify them into more than one node; otherwise it is not possible to split the leaf tuples across multiple pages, which is the ultimate purpose of this operation. Therefore, if the <CODE CLASS="FUNCTION" >picksplit</CODE > function ends up placing all the leaf tuples in the same node, the core SP-GiST code will override that decision and generate an inner tuple in which the leaf tuples are assigned at random to several identically-labeled nodes. Such a tuple is marked <TT CLASS="LITERAL" >allTheSame</TT > to signify that this has happened. The <CODE CLASS="FUNCTION" >choose</CODE > and <CODE CLASS="FUNCTION" >inner_consistent</CODE > functions must take suitable care with such inner tuples. See <A HREF="spgist-implementation.html#SPGIST-ALL-THE-SAME" >Section 54.3.3</A > for more information. </P ><P > <CODE CLASS="FUNCTION" >picksplit</CODE > can be applied to a single leaf tuple only in the case that the <CODE CLASS="FUNCTION" >config</CODE > function set <TT CLASS="STRUCTFIELD" >longValuesOK</TT > to true and a larger-than-a-page input value has been supplied. In this case the point of the operation is to strip off a prefix and produce a new, shorter leaf datum value. The call will be repeated until a leaf datum short enough to fit on a page has been produced. See <A HREF="spgist-implementation.html#SPGIST-LIMITS" >Section 54.3.1</A > for more information. </P ></DD ><DT ><CODE CLASS="FUNCTION" >inner_consistent</CODE ></DT ><DD ><P > Returns set of nodes (branches) to follow during tree search. </P ><P > The <ACRONYM CLASS="ACRONYM" >SQL</ACRONYM > declaration of the function must look like this: </P><PRE CLASS="PROGRAMLISTING" >CREATE FUNCTION my_inner_consistent(internal, internal) RETURNS void ...</PRE ><P> The first argument is a pointer to a <TT CLASS="STRUCTNAME" >spgInnerConsistentIn</TT > C struct, containing input data for the function. The second argument is a pointer to a <TT CLASS="STRUCTNAME" >spgInnerConsistentOut</TT > C struct, which the function must fill with result data. </P><PRE CLASS="PROGRAMLISTING" >typedef struct spgInnerConsistentIn { ScanKey scankeys; /* array of operators and comparison values */ int nkeys; /* length of array */ Datum reconstructedValue; /* value reconstructed at parent */ int level; /* current level (counting from zero) */ bool returnData; /* original data must be returned? */ /* Data from current inner tuple */ bool allTheSame; /* tuple is marked all-the-same? */ bool hasPrefix; /* tuple has a prefix? */ Datum prefixDatum; /* if so, the prefix value */ int nNodes; /* number of nodes in the inner tuple */ Datum *nodeLabels; /* node label values (NULL if none) */ } spgInnerConsistentIn; typedef struct spgInnerConsistentOut { int nNodes; /* number of child nodes to be visited */ int *nodeNumbers; /* their indexes in the node array */ int *levelAdds; /* increment level by this much for each */ Datum *reconstructedValues; /* associated reconstructed values */ } spgInnerConsistentOut;</PRE ><P> The array <TT CLASS="STRUCTFIELD" >scankeys</TT >, of length <TT CLASS="STRUCTFIELD" >nkeys</TT >, describes the index search condition(s). These conditions are combined with AND — only index entries that satisfy all of them are interesting. (Note that <TT CLASS="STRUCTFIELD" >nkeys</TT > = 0 implies that all index entries satisfy the query.) Usually the consistent function only cares about the <TT CLASS="STRUCTFIELD" >sk_strategy</TT > and <TT CLASS="STRUCTFIELD" >sk_argument</TT > fields of each array entry, which respectively give the indexable operator and comparison value. In particular it is not necessary to check <TT CLASS="STRUCTFIELD" >sk_flags</TT > to see if the comparison value is NULL, because the SP-GiST core code will filter out such conditions. <TT CLASS="STRUCTFIELD" >reconstructedValue</TT > is the value reconstructed for the parent tuple; it is <TT CLASS="LITERAL" >(Datum) 0</TT > at the root level or if the <CODE CLASS="FUNCTION" >inner_consistent</CODE > function did not provide a value at the parent level. <TT CLASS="STRUCTFIELD" >level</TT > is the current inner tuple's level, starting at zero for the root level. <TT CLASS="STRUCTFIELD" >returnData</TT > is <TT CLASS="LITERAL" >true</TT > if reconstructed data is required for this query; this will only be so if the <CODE CLASS="FUNCTION" >config</CODE > function asserted <TT CLASS="STRUCTFIELD" >canReturnData</TT >. <TT CLASS="STRUCTFIELD" >allTheSame</TT > is true if the current inner tuple is marked <SPAN CLASS="QUOTE" >"all-the-same"</SPAN >; in this case all the nodes have the same label (if any) and so either all or none of them match the query (see <A HREF="spgist-implementation.html#SPGIST-ALL-THE-SAME" >Section 54.3.3</A >). <TT CLASS="STRUCTFIELD" >hasPrefix</TT > is true if the current inner tuple contains a prefix; if so, <TT CLASS="STRUCTFIELD" >prefixDatum</TT > is its value. <TT CLASS="STRUCTFIELD" >nNodes</TT > is the number of child nodes contained in the inner tuple, and <TT CLASS="STRUCTFIELD" >nodeLabels</TT > is an array of their label values, or NULL if the nodes do not have labels. </P ><P > <TT CLASS="STRUCTFIELD" >nNodes</TT > must be set to the number of child nodes that need to be visited by the search, and <TT CLASS="STRUCTFIELD" >nodeNumbers</TT > must be set to an array of their indexes. If the operator class keeps track of levels, set <TT CLASS="STRUCTFIELD" >levelAdds</TT > to an array of the level increments required when descending to each node to be visited. (Often these increments will be the same for all the nodes, but that's not necessarily so, so an array is used.) If value reconstruction is needed, set <TT CLASS="STRUCTFIELD" >reconstructedValues</TT > to an array of the values reconstructed for each child node to be visited; otherwise, leave <TT CLASS="STRUCTFIELD" >reconstructedValues</TT > as NULL. Note that the <CODE CLASS="FUNCTION" >inner_consistent</CODE > function is responsible for palloc'ing the <TT CLASS="STRUCTFIELD" >nodeNumbers</TT >, <TT CLASS="STRUCTFIELD" >levelAdds</TT > and <TT CLASS="STRUCTFIELD" >reconstructedValues</TT > arrays. </P ></DD ><DT ><CODE CLASS="FUNCTION" >leaf_consistent</CODE ></DT ><DD ><P > Returns true if a leaf tuple satisfies a query. </P ><P > The <ACRONYM CLASS="ACRONYM" >SQL</ACRONYM > declaration of the function must look like this: </P><PRE CLASS="PROGRAMLISTING" >CREATE FUNCTION my_leaf_consistent(internal, internal) RETURNS bool ...</PRE ><P> The first argument is a pointer to a <TT CLASS="STRUCTNAME" >spgLeafConsistentIn</TT > C struct, containing input data for the function. The second argument is a pointer to a <TT CLASS="STRUCTNAME" >spgLeafConsistentOut</TT > C struct, which the function must fill with result data. </P><PRE CLASS="PROGRAMLISTING" >typedef struct spgLeafConsistentIn { ScanKey scankeys; /* array of operators and comparison values */ int nkeys; /* length of array */ Datum reconstructedValue; /* value reconstructed at parent */ int level; /* current level (counting from zero) */ bool returnData; /* original data must be returned? */ Datum leafDatum; /* datum in leaf tuple */ } spgLeafConsistentIn; typedef struct spgLeafConsistentOut { Datum leafValue; /* reconstructed original data, if any */ bool recheck; /* set true if operator must be rechecked */ } spgLeafConsistentOut;</PRE ><P> The array <TT CLASS="STRUCTFIELD" >scankeys</TT >, of length <TT CLASS="STRUCTFIELD" >nkeys</TT >, describes the index search condition(s). These conditions are combined with AND — only index entries that satisfy all of them satisfy the query. (Note that <TT CLASS="STRUCTFIELD" >nkeys</TT > = 0 implies that all index entries satisfy the query.) Usually the consistent function only cares about the <TT CLASS="STRUCTFIELD" >sk_strategy</TT > and <TT CLASS="STRUCTFIELD" >sk_argument</TT > fields of each array entry, which respectively give the indexable operator and comparison value. In particular it is not necessary to check <TT CLASS="STRUCTFIELD" >sk_flags</TT > to see if the comparison value is NULL, because the SP-GiST core code will filter out such conditions. <TT CLASS="STRUCTFIELD" >reconstructedValue</TT > is the value reconstructed for the parent tuple; it is <TT CLASS="LITERAL" >(Datum) 0</TT > at the root level or if the <CODE CLASS="FUNCTION" >inner_consistent</CODE > function did not provide a value at the parent level. <TT CLASS="STRUCTFIELD" >level</TT > is the current leaf tuple's level, starting at zero for the root level. <TT CLASS="STRUCTFIELD" >returnData</TT > is <TT CLASS="LITERAL" >true</TT > if reconstructed data is required for this query; this will only be so if the <CODE CLASS="FUNCTION" >config</CODE > function asserted <TT CLASS="STRUCTFIELD" >canReturnData</TT >. <TT CLASS="STRUCTFIELD" >leafDatum</TT > is the key value stored in the current leaf tuple. </P ><P > The function must return <TT CLASS="LITERAL" >true</TT > if the leaf tuple matches the query, or <TT CLASS="LITERAL" >false</TT > if not. In the <TT CLASS="LITERAL" >true</TT > case, if <TT CLASS="STRUCTFIELD" >returnData</TT > is <TT CLASS="LITERAL" >true</TT > then <TT CLASS="STRUCTFIELD" >leafValue</TT > must be set to the value originally supplied to be indexed for this leaf tuple. Also, <TT CLASS="STRUCTFIELD" >recheck</TT > may be set to <TT CLASS="LITERAL" >true</TT > if the match is uncertain and so the operator(s) must be re-applied to the actual heap tuple to verify the match. </P ></DD ></DL ></DIV ><P > All the SP-GiST support methods are normally called in a short-lived memory context; that is, <TT CLASS="VARNAME" >CurrentMemoryContext</TT > will be reset after processing of each tuple. It is therefore not very important to worry about pfree'ing everything you palloc. (The <CODE CLASS="FUNCTION" >config</CODE > method is an exception: it should try to avoid leaking memory. But usually the <CODE CLASS="FUNCTION" >config</CODE > method need do nothing but assign constants into the passed parameter struct.) </P ><P > If the indexed column is of a collatable data type, the index collation will be passed to all the support methods, using the standard <CODE CLASS="FUNCTION" >PG_GET_COLLATION()</CODE > mechanism. </P ></DIV ><DIV CLASS="NAVFOOTER" ><HR ALIGN="LEFT" WIDTH="100%"><TABLE SUMMARY="Footer navigation table" WIDTH="100%" BORDER="0" CELLPADDING="0" CELLSPACING="0" ><TR ><TD WIDTH="33%" ALIGN="left" VALIGN="top" ><A HREF="spgist-intro.html" ACCESSKEY="P" >Prev</A ></TD ><TD WIDTH="34%" ALIGN="center" VALIGN="top" ><A HREF="index.html" ACCESSKEY="H" >Home</A ></TD ><TD WIDTH="33%" ALIGN="right" VALIGN="top" ><A HREF="spgist-implementation.html" ACCESSKEY="N" >Next</A ></TD ></TR ><TR ><TD WIDTH="33%" ALIGN="left" VALIGN="top" >Introduction</TD ><TD WIDTH="34%" ALIGN="center" VALIGN="top" ><A HREF="spgist.html" ACCESSKEY="U" >Up</A ></TD ><TD WIDTH="33%" ALIGN="right" VALIGN="top" >Implementation</TD ></TR ></TABLE ></DIV ></BODY ></HTML >
Close