diff options
| author | Tom Lane <tgl@sss.pgh.pa.us> | 2011-12-17 16:41:16 -0500 |
|---|---|---|
| committer | Tom Lane <tgl@sss.pgh.pa.us> | 2011-12-17 16:42:30 -0500 |
| commit | 8daeb5ddd698f661eb118f8e874e7c68cfd6ae09 (patch) | |
| tree | 765599b73e45a6ca5529398489f31a534ab1924e /src/backend/access/common/reloptions.c | |
| parent | 19fc0fe3ae7861a8b0d3ab8b67bd01fde33bf2da (diff) | |
Add SP-GiST (space-partitioned GiST) index access method.
SP-GiST is comparable to GiST in flexibility, but supports non-balanced
partitioned search structures rather than balanced trees. As described at
PGCon 2011, this new indexing structure can beat GiST in both index build
time and query speed for search problems that it is well matched to.
There are a number of areas that could still use improvement, but at this
point the code seems committable.
Teodor Sigaev and Oleg Bartunov, with considerable revisions by Tom Lane
Diffstat (limited to 'src/backend/access/common/reloptions.c')
| -rw-r--r-- | src/backend/access/common/reloptions.c | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/src/backend/access/common/reloptions.c b/src/backend/access/common/reloptions.c index 240e178b3b4..100172fa4ac 100644 --- a/src/backend/access/common/reloptions.c +++ b/src/backend/access/common/reloptions.c @@ -19,6 +19,7 @@ #include "access/hash.h" #include "access/nbtree.h" #include "access/reloptions.h" +#include "access/spgist.h" #include "catalog/pg_type.h" #include "commands/defrem.h" #include "commands/tablespace.h" @@ -106,6 +107,14 @@ static relopt_int intRelOpts[] = }, { { + "fillfactor", + "Packs spgist index pages only to this percentage", + RELOPT_KIND_SPGIST + }, + SPGIST_DEFAULT_FILLFACTOR, SPGIST_MIN_FILLFACTOR, 100 + }, + { + { "autovacuum_vacuum_threshold", "Minimum number of tuple updates or deletes prior to vacuum", RELOPT_KIND_HEAP | RELOPT_KIND_TOAST |