mirror of
https://github.com/postgres/postgres.git
synced 2025-12-21 05:21:08 +03:00
Add temporal PRIMARY KEY and UNIQUE constraints
Add WITHOUT OVERLAPS clause to PRIMARY KEY and UNIQUE constraints. These are backed by GiST indexes instead of B-tree indexes, since they are essentially exclusion constraints with = for the scalar parts of the key and && for the temporal part. Author: Paul A. Jungwirth <pj@illuminatedcomputing.com> Reviewed-by: Peter Eisentraut <peter@eisentraut.org> Reviewed-by: jian he <jian.universality@gmail.com> Discussion: https://www.postgresql.org/message-id/flat/CA+renyUApHgSZF9-nd-a0+OPGharLQLO=mDHcY4_qQ0+noCUVg@mail.gmail.com
This commit is contained in:
@@ -1070,3 +1070,32 @@ gist_stratnum_identity(PG_FUNCTION_ARGS)
|
||||
|
||||
PG_RETURN_UINT16(strat);
|
||||
}
|
||||
|
||||
/*
|
||||
* Returns the opclass's private stratnum used for the given strategy.
|
||||
*
|
||||
* Calls the opclass's GIST_STRATNUM_PROC support function, if any,
|
||||
* and returns the result.
|
||||
* Returns InvalidStrategy if the function is not defined.
|
||||
*/
|
||||
StrategyNumber
|
||||
GistTranslateStratnum(Oid opclass, StrategyNumber strat)
|
||||
{
|
||||
Oid opfamily;
|
||||
Oid opcintype;
|
||||
Oid funcid;
|
||||
Datum result;
|
||||
|
||||
/* Look up the opclass family and input datatype. */
|
||||
if (!get_opclass_opfamily_and_input_type(opclass, &opfamily, &opcintype))
|
||||
return InvalidStrategy;
|
||||
|
||||
/* Check whether the function is provided. */
|
||||
funcid = get_opfamily_proc(opfamily, opcintype, opcintype, GIST_STRATNUM_PROC);
|
||||
if (!OidIsValid(funcid))
|
||||
return InvalidStrategy;
|
||||
|
||||
/* Ask the translation function */
|
||||
result = OidFunctionCall1Coll(funcid, InvalidOid, UInt16GetDatum(strat));
|
||||
return DatumGetUInt16(result);
|
||||
}
|
||||
|
||||
@@ -2141,6 +2141,7 @@ StoreRelCheck(Relation rel, const char *ccname, Node *expr,
|
||||
is_local, /* conislocal */
|
||||
inhcount, /* coninhcount */
|
||||
is_no_inherit, /* connoinherit */
|
||||
false, /* conwithoutoverlaps */
|
||||
is_internal); /* internally constructed? */
|
||||
|
||||
pfree(ccbin);
|
||||
@@ -2191,6 +2192,7 @@ StoreRelNotNull(Relation rel, const char *nnname, AttrNumber attnum,
|
||||
is_local,
|
||||
inhcount,
|
||||
is_no_inherit,
|
||||
false, /* conwithoutoverlaps */
|
||||
false);
|
||||
return constrOid;
|
||||
}
|
||||
|
||||
@@ -1904,6 +1904,7 @@ index_concurrently_set_dead(Oid heapId, Oid indexId)
|
||||
* INDEX_CONSTR_CREATE_UPDATE_INDEX: update the pg_index row
|
||||
* INDEX_CONSTR_CREATE_REMOVE_OLD_DEPS: remove existing dependencies
|
||||
* of index on table's columns
|
||||
* INDEX_CONSTR_CREATE_WITHOUT_OVERLAPS: constraint uses WITHOUT OVERLAPS
|
||||
* allow_system_table_mods: allow table to be a system catalog
|
||||
* is_internal: index is constructed due to internal process
|
||||
*/
|
||||
@@ -1927,11 +1928,13 @@ index_constraint_create(Relation heapRelation,
|
||||
bool mark_as_primary;
|
||||
bool islocal;
|
||||
bool noinherit;
|
||||
bool is_without_overlaps;
|
||||
int inhcount;
|
||||
|
||||
deferrable = (constr_flags & INDEX_CONSTR_CREATE_DEFERRABLE) != 0;
|
||||
initdeferred = (constr_flags & INDEX_CONSTR_CREATE_INIT_DEFERRED) != 0;
|
||||
mark_as_primary = (constr_flags & INDEX_CONSTR_CREATE_MARK_AS_PRIMARY) != 0;
|
||||
is_without_overlaps = (constr_flags & INDEX_CONSTR_CREATE_WITHOUT_OVERLAPS) != 0;
|
||||
|
||||
/* constraint creation support doesn't work while bootstrapping */
|
||||
Assert(!IsBootstrapProcessingMode());
|
||||
@@ -2008,6 +2011,7 @@ index_constraint_create(Relation heapRelation,
|
||||
islocal,
|
||||
inhcount,
|
||||
noinherit,
|
||||
is_without_overlaps,
|
||||
is_internal);
|
||||
|
||||
/*
|
||||
|
||||
@@ -78,6 +78,7 @@ CreateConstraintEntry(const char *constraintName,
|
||||
bool conIsLocal,
|
||||
int conInhCount,
|
||||
bool conNoInherit,
|
||||
bool conWithoutOverlaps,
|
||||
bool is_internal)
|
||||
{
|
||||
Relation conDesc;
|
||||
@@ -193,6 +194,7 @@ CreateConstraintEntry(const char *constraintName,
|
||||
values[Anum_pg_constraint_conislocal - 1] = BoolGetDatum(conIsLocal);
|
||||
values[Anum_pg_constraint_coninhcount - 1] = Int16GetDatum(conInhCount);
|
||||
values[Anum_pg_constraint_connoinherit - 1] = BoolGetDatum(conNoInherit);
|
||||
values[Anum_pg_constraint_conwithoutoverlaps - 1] = BoolGetDatum(conWithoutOverlaps);
|
||||
|
||||
if (conkeyArray)
|
||||
values[Anum_pg_constraint_conkey - 1] = PointerGetDatum(conkeyArray);
|
||||
|
||||
@@ -16,6 +16,7 @@
|
||||
#include "postgres.h"
|
||||
|
||||
#include "access/amapi.h"
|
||||
#include "access/gist.h"
|
||||
#include "access/heapam.h"
|
||||
#include "access/htup_details.h"
|
||||
#include "access/reloptions.h"
|
||||
@@ -86,6 +87,7 @@ static void ComputeIndexAttrs(IndexInfo *indexInfo,
|
||||
Oid accessMethodId,
|
||||
bool amcanorder,
|
||||
bool isconstraint,
|
||||
bool iswithoutoverlaps,
|
||||
Oid ddl_userid,
|
||||
int ddl_sec_context,
|
||||
int *ddl_save_nestlevel);
|
||||
@@ -144,6 +146,7 @@ typedef struct ReindexErrorInfo
|
||||
* to index on.
|
||||
* 'exclusionOpNames': list of names of exclusion-constraint operators,
|
||||
* or NIL if not an exclusion constraint.
|
||||
* 'isWithoutOverlaps': true iff this index has a WITHOUT OVERLAPS clause.
|
||||
*
|
||||
* This is tailored to the needs of ALTER TABLE ALTER TYPE, which recreates
|
||||
* any indexes that depended on a changing column from their pg_get_indexdef
|
||||
@@ -173,7 +176,8 @@ bool
|
||||
CheckIndexCompatible(Oid oldId,
|
||||
const char *accessMethodName,
|
||||
const List *attributeList,
|
||||
const List *exclusionOpNames)
|
||||
const List *exclusionOpNames,
|
||||
bool isWithoutOverlaps)
|
||||
{
|
||||
bool isconstraint;
|
||||
Oid *typeIds;
|
||||
@@ -248,8 +252,8 @@ CheckIndexCompatible(Oid oldId,
|
||||
coloptions, attributeList,
|
||||
exclusionOpNames, relationId,
|
||||
accessMethodName, accessMethodId,
|
||||
amcanorder, isconstraint, InvalidOid, 0, NULL);
|
||||
|
||||
amcanorder, isconstraint, isWithoutOverlaps, InvalidOid,
|
||||
0, NULL);
|
||||
|
||||
/* Get the soon-obsolete pg_index tuple. */
|
||||
tuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(oldId));
|
||||
@@ -559,6 +563,7 @@ DefineIndex(Oid tableId,
|
||||
bool amcanorder;
|
||||
bool amissummarizing;
|
||||
amoptions_function amoptions;
|
||||
bool exclusion;
|
||||
bool partitioned;
|
||||
bool safe_index;
|
||||
Datum reloptions;
|
||||
@@ -677,6 +682,12 @@ DefineIndex(Oid tableId,
|
||||
|
||||
namespaceId = RelationGetNamespace(rel);
|
||||
|
||||
/*
|
||||
* It has exclusion constraint behavior if it's an EXCLUDE constraint or a
|
||||
* temporal PRIMARY KEY/UNIQUE constraint
|
||||
*/
|
||||
exclusion = stmt->excludeOpNames || stmt->iswithoutoverlaps;
|
||||
|
||||
/* Ensure that it makes sense to index this kind of relation */
|
||||
switch (rel->rd_rel->relkind)
|
||||
{
|
||||
@@ -845,7 +856,7 @@ DefineIndex(Oid tableId,
|
||||
pgstat_progress_update_param(PROGRESS_CREATEIDX_ACCESS_METHOD_OID,
|
||||
accessMethodId);
|
||||
|
||||
if (stmt->unique && !amRoutine->amcanunique)
|
||||
if (stmt->unique && !stmt->iswithoutoverlaps && !amRoutine->amcanunique)
|
||||
ereport(ERROR,
|
||||
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
||||
errmsg("access method \"%s\" does not support unique indexes",
|
||||
@@ -860,7 +871,7 @@ DefineIndex(Oid tableId,
|
||||
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
||||
errmsg("access method \"%s\" does not support multicolumn indexes",
|
||||
accessMethodName)));
|
||||
if (stmt->excludeOpNames && amRoutine->amgettuple == NULL)
|
||||
if (exclusion && amRoutine->amgettuple == NULL)
|
||||
ereport(ERROR,
|
||||
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
||||
errmsg("access method \"%s\" does not support exclusion constraints",
|
||||
@@ -913,8 +924,9 @@ DefineIndex(Oid tableId,
|
||||
coloptions, allIndexParams,
|
||||
stmt->excludeOpNames, tableId,
|
||||
accessMethodName, accessMethodId,
|
||||
amcanorder, stmt->isconstraint, root_save_userid,
|
||||
root_save_sec_context, &root_save_nestlevel);
|
||||
amcanorder, stmt->isconstraint, stmt->iswithoutoverlaps,
|
||||
root_save_userid, root_save_sec_context,
|
||||
&root_save_nestlevel);
|
||||
|
||||
/*
|
||||
* Extra checks when creating a PRIMARY KEY index.
|
||||
@@ -932,7 +944,7 @@ DefineIndex(Oid tableId,
|
||||
* We could lift this limitation if we had global indexes, but those have
|
||||
* their own problems, so this is a useful feature combination.
|
||||
*/
|
||||
if (partitioned && (stmt->unique || stmt->excludeOpNames))
|
||||
if (partitioned && (stmt->unique || exclusion))
|
||||
{
|
||||
PartitionKey key = RelationGetPartitionKey(rel);
|
||||
const char *constraint_type;
|
||||
@@ -986,10 +998,10 @@ DefineIndex(Oid tableId,
|
||||
* associated with index columns, too. We know what to do with
|
||||
* btree opclasses; if there are ever any other index types that
|
||||
* support unique indexes, this logic will need extension. But if
|
||||
* we have an exclusion constraint, it already knows the
|
||||
* operators, so we don't have to infer them.
|
||||
* we have an exclusion constraint (or a temporal PK), it already
|
||||
* knows the operators, so we don't have to infer them.
|
||||
*/
|
||||
if (stmt->unique && accessMethodId != BTREE_AM_OID)
|
||||
if (stmt->unique && !stmt->iswithoutoverlaps && accessMethodId != BTREE_AM_OID)
|
||||
ereport(ERROR,
|
||||
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
||||
errmsg("cannot match partition key to an index using access method \"%s\"",
|
||||
@@ -1028,12 +1040,12 @@ DefineIndex(Oid tableId,
|
||||
{
|
||||
Oid idx_eqop = InvalidOid;
|
||||
|
||||
if (stmt->unique)
|
||||
if (stmt->unique && !stmt->iswithoutoverlaps)
|
||||
idx_eqop = get_opfamily_member(idx_opfamily,
|
||||
idx_opcintype,
|
||||
idx_opcintype,
|
||||
BTEqualStrategyNumber);
|
||||
else if (stmt->excludeOpNames)
|
||||
else if (exclusion)
|
||||
idx_eqop = indexInfo->ii_ExclusionOps[j];
|
||||
Assert(idx_eqop);
|
||||
|
||||
@@ -1042,7 +1054,7 @@ DefineIndex(Oid tableId,
|
||||
found = true;
|
||||
break;
|
||||
}
|
||||
else if (stmt->excludeOpNames)
|
||||
else if (exclusion)
|
||||
{
|
||||
/*
|
||||
* We found a match, but it's not an equality
|
||||
@@ -1186,6 +1198,8 @@ DefineIndex(Oid tableId,
|
||||
constr_flags |= INDEX_CONSTR_CREATE_DEFERRABLE;
|
||||
if (stmt->initdeferred)
|
||||
constr_flags |= INDEX_CONSTR_CREATE_INIT_DEFERRED;
|
||||
if (stmt->iswithoutoverlaps)
|
||||
constr_flags |= INDEX_CONSTR_CREATE_WITHOUT_OVERLAPS;
|
||||
|
||||
indexRelationId =
|
||||
index_create(rel, indexRelationName, indexRelationId, parentIndexId,
|
||||
@@ -1850,6 +1864,7 @@ ComputeIndexAttrs(IndexInfo *indexInfo,
|
||||
Oid accessMethodId,
|
||||
bool amcanorder,
|
||||
bool isconstraint,
|
||||
bool iswithoutoverlaps,
|
||||
Oid ddl_userid,
|
||||
int ddl_sec_context,
|
||||
int *ddl_save_nestlevel)
|
||||
@@ -1873,6 +1888,14 @@ ComputeIndexAttrs(IndexInfo *indexInfo,
|
||||
else
|
||||
nextExclOp = NULL;
|
||||
|
||||
/* exclusionOpNames can be non-NIL if we are creating a partition */
|
||||
if (iswithoutoverlaps && exclusionOpNames == NIL)
|
||||
{
|
||||
indexInfo->ii_ExclusionOps = palloc_array(Oid, nkeycols);
|
||||
indexInfo->ii_ExclusionProcs = palloc_array(Oid, nkeycols);
|
||||
indexInfo->ii_ExclusionStrats = palloc_array(uint16, nkeycols);
|
||||
}
|
||||
|
||||
if (OidIsValid(ddl_userid))
|
||||
GetUserIdAndSecContext(&save_userid, &save_sec_context);
|
||||
|
||||
@@ -2149,6 +2172,21 @@ ComputeIndexAttrs(IndexInfo *indexInfo,
|
||||
indexInfo->ii_ExclusionStrats[attn] = strat;
|
||||
nextExclOp = lnext(exclusionOpNames, nextExclOp);
|
||||
}
|
||||
else if (iswithoutoverlaps)
|
||||
{
|
||||
StrategyNumber strat;
|
||||
Oid opid;
|
||||
|
||||
if (attn == nkeycols - 1)
|
||||
strat = RTOverlapStrategyNumber;
|
||||
else
|
||||
strat = RTEqualStrategyNumber;
|
||||
GetOperatorFromWellKnownStrategy(opclassOids[attn], atttype,
|
||||
&opid, &strat);
|
||||
indexInfo->ii_ExclusionOps[attn] = opid;
|
||||
indexInfo->ii_ExclusionProcs[attn] = get_opcode(opid);
|
||||
indexInfo->ii_ExclusionStrats[attn] = strat;
|
||||
}
|
||||
|
||||
/*
|
||||
* Set up the per-column options (indoption field). For now, this is
|
||||
@@ -2379,6 +2417,83 @@ GetDefaultOpClass(Oid type_id, Oid am_id)
|
||||
return InvalidOid;
|
||||
}
|
||||
|
||||
/*
|
||||
* GetOperatorFromWellKnownStrategy
|
||||
*
|
||||
* opclass - the opclass to use
|
||||
* atttype - the type to ask about
|
||||
* opid - holds the operator we found
|
||||
* strat - holds the input and output strategy number
|
||||
*
|
||||
* Finds an operator from a "well-known" strategy number. This is used for
|
||||
* temporal index constraints (and other temporal features) to look up
|
||||
* equality and overlaps operators, since the strategy numbers for non-btree
|
||||
* indexams need not follow any fixed scheme. We ask an opclass support
|
||||
* function to translate from the well-known number to the internal value. If
|
||||
* the function isn't defined or it gives no result, we return
|
||||
* InvalidStrategy.
|
||||
*/
|
||||
void
|
||||
GetOperatorFromWellKnownStrategy(Oid opclass, Oid atttype,
|
||||
Oid *opid, StrategyNumber *strat)
|
||||
{
|
||||
Oid opfamily;
|
||||
Oid opcintype;
|
||||
StrategyNumber instrat = *strat;
|
||||
|
||||
Assert(instrat == RTEqualStrategyNumber || instrat == RTOverlapStrategyNumber);
|
||||
|
||||
*opid = InvalidOid;
|
||||
|
||||
if (get_opclass_opfamily_and_input_type(opclass, &opfamily, &opcintype))
|
||||
{
|
||||
/*
|
||||
* Ask the opclass to translate to its internal stratnum
|
||||
*
|
||||
* For now we only need GiST support, but this could support other
|
||||
* indexams if we wanted.
|
||||
*/
|
||||
*strat = GistTranslateStratnum(opclass, instrat);
|
||||
if (*strat == InvalidStrategy)
|
||||
{
|
||||
HeapTuple tuple;
|
||||
|
||||
tuple = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
|
||||
if (!HeapTupleIsValid(tuple))
|
||||
elog(ERROR, "cache lookup failed for operator class %u", opclass);
|
||||
|
||||
ereport(ERROR,
|
||||
errcode(ERRCODE_UNDEFINED_OBJECT),
|
||||
instrat == RTEqualStrategyNumber ?
|
||||
errmsg("could not identify an equality operator for type %s", format_type_be(atttype)) :
|
||||
errmsg("could not identify an overlaps operator for type %s", format_type_be(atttype)),
|
||||
errdetail("Could not translate strategy number %d for operator class \"%s\" for access method \"%s\".",
|
||||
instrat, NameStr(((Form_pg_opclass) GETSTRUCT(tuple))->opcname), "gist"));
|
||||
|
||||
ReleaseSysCache(tuple);
|
||||
}
|
||||
|
||||
*opid = get_opfamily_member(opfamily, opcintype, opcintype, *strat);
|
||||
}
|
||||
|
||||
if (!OidIsValid(*opid))
|
||||
{
|
||||
HeapTuple tuple;
|
||||
|
||||
tuple = SearchSysCache1(OPFAMILYOID, ObjectIdGetDatum(opfamily));
|
||||
if (!HeapTupleIsValid(tuple))
|
||||
elog(ERROR, "cache lookup failed for operator family %u", opfamily);
|
||||
|
||||
ereport(ERROR,
|
||||
errcode(ERRCODE_UNDEFINED_OBJECT),
|
||||
instrat == RTEqualStrategyNumber ?
|
||||
errmsg("could not identify an equality operator for type %s", format_type_be(atttype)) :
|
||||
errmsg("could not identify an overlaps operator for type %s", format_type_be(atttype)),
|
||||
errdetail("There is no suitable operator in operator family \"%s\" for access method \"%s\".",
|
||||
NameStr(((Form_pg_opfamily) GETSTRUCT(tuple))->opfname), "gist"));
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* makeObjectName()
|
||||
*
|
||||
|
||||
@@ -10340,6 +10340,7 @@ addFkRecurseReferenced(List **wqueue, Constraint *fkconstraint, Relation rel,
|
||||
conislocal, /* islocal */
|
||||
coninhcount, /* inhcount */
|
||||
connoinherit, /* conNoInherit */
|
||||
false, /* conWithoutOverlaps */
|
||||
false); /* is_internal */
|
||||
|
||||
ObjectAddressSet(address, ConstraintRelationId, constrOid);
|
||||
@@ -10638,6 +10639,7 @@ addFkRecurseReferencing(List **wqueue, Constraint *fkconstraint, Relation rel,
|
||||
false,
|
||||
1,
|
||||
false,
|
||||
false, /* conWithoutOverlaps */
|
||||
false);
|
||||
|
||||
/*
|
||||
@@ -11143,6 +11145,7 @@ CloneFkReferencing(List **wqueue, Relation parentRel, Relation partRel)
|
||||
false, /* islocal */
|
||||
1, /* inhcount */
|
||||
false, /* conNoInherit */
|
||||
false, /* conWithoutOverlaps */
|
||||
true);
|
||||
|
||||
/* Set up partition dependencies for the new constraint */
|
||||
@@ -14556,7 +14559,8 @@ TryReuseIndex(Oid oldId, IndexStmt *stmt)
|
||||
if (CheckIndexCompatible(oldId,
|
||||
stmt->accessMethod,
|
||||
stmt->indexParams,
|
||||
stmt->excludeOpNames))
|
||||
stmt->excludeOpNames,
|
||||
stmt->iswithoutoverlaps))
|
||||
{
|
||||
Relation irel = index_open(oldId, NoLock);
|
||||
|
||||
|
||||
@@ -841,6 +841,7 @@ CreateTriggerFiringOn(CreateTrigStmt *stmt, const char *queryString,
|
||||
true, /* islocal */
|
||||
0, /* inhcount */
|
||||
true, /* noinherit */
|
||||
false, /* conwithoutoverlaps */
|
||||
isInternal); /* is_internal */
|
||||
}
|
||||
|
||||
|
||||
@@ -3544,6 +3544,7 @@ domainAddConstraint(Oid domainOid, Oid domainNamespace, Oid baseTypeOid,
|
||||
true, /* is local */
|
||||
0, /* inhcount */
|
||||
false, /* connoinherit */
|
||||
false, /* conwithoutoverlaps */
|
||||
false); /* is_internal */
|
||||
if (constrAddr)
|
||||
ObjectAddressSet(*constrAddr, ConstraintRelationId, ccoid);
|
||||
|
||||
@@ -756,6 +756,7 @@ _outConstraint(StringInfo str, const Constraint *node)
|
||||
case CONSTR_PRIMARY:
|
||||
appendStringInfoString(str, "PRIMARY_KEY");
|
||||
WRITE_NODE_FIELD(keys);
|
||||
WRITE_BOOL_FIELD(without_overlaps);
|
||||
WRITE_NODE_FIELD(including);
|
||||
WRITE_NODE_FIELD(options);
|
||||
WRITE_STRING_FIELD(indexname);
|
||||
@@ -768,6 +769,7 @@ _outConstraint(StringInfo str, const Constraint *node)
|
||||
appendStringInfoString(str, "UNIQUE");
|
||||
WRITE_BOOL_FIELD(nulls_not_distinct);
|
||||
WRITE_NODE_FIELD(keys);
|
||||
WRITE_BOOL_FIELD(without_overlaps);
|
||||
WRITE_NODE_FIELD(including);
|
||||
WRITE_NODE_FIELD(options);
|
||||
WRITE_STRING_FIELD(indexname);
|
||||
|
||||
@@ -427,6 +427,7 @@ _readConstraint(void)
|
||||
|
||||
case CONSTR_PRIMARY:
|
||||
READ_NODE_FIELD(keys);
|
||||
READ_BOOL_FIELD(without_overlaps);
|
||||
READ_NODE_FIELD(including);
|
||||
READ_NODE_FIELD(options);
|
||||
READ_STRING_FIELD(indexname);
|
||||
@@ -438,6 +439,7 @@ _readConstraint(void)
|
||||
case CONSTR_UNIQUE:
|
||||
READ_BOOL_FIELD(nulls_not_distinct);
|
||||
READ_NODE_FIELD(keys);
|
||||
READ_BOOL_FIELD(without_overlaps);
|
||||
READ_NODE_FIELD(including);
|
||||
READ_NODE_FIELD(options);
|
||||
READ_STRING_FIELD(indexname);
|
||||
|
||||
@@ -529,7 +529,7 @@ static Node *makeRecursiveViewSelect(char *relname, List *aliases, Node *query);
|
||||
columnref in_expr having_clause func_table xmltable array_expr
|
||||
OptWhereClause operator_def_arg
|
||||
%type <list> rowsfrom_item rowsfrom_list opt_col_def_list
|
||||
%type <boolean> opt_ordinality
|
||||
%type <boolean> opt_ordinality opt_without_overlaps
|
||||
%type <list> ExclusionConstraintList ExclusionConstraintElem
|
||||
%type <list> func_arg_list func_arg_list_opt
|
||||
%type <node> func_arg_expr
|
||||
@@ -4133,7 +4133,7 @@ ConstraintElem:
|
||||
n->initially_valid = true;
|
||||
$$ = (Node *) n;
|
||||
}
|
||||
| UNIQUE opt_unique_null_treatment '(' columnList ')' opt_c_include opt_definition OptConsTableSpace
|
||||
| UNIQUE opt_unique_null_treatment '(' columnList opt_without_overlaps ')' opt_c_include opt_definition OptConsTableSpace
|
||||
ConstraintAttributeSpec
|
||||
{
|
||||
Constraint *n = makeNode(Constraint);
|
||||
@@ -4142,11 +4142,12 @@ ConstraintElem:
|
||||
n->location = @1;
|
||||
n->nulls_not_distinct = !$2;
|
||||
n->keys = $4;
|
||||
n->including = $6;
|
||||
n->options = $7;
|
||||
n->without_overlaps = $5;
|
||||
n->including = $7;
|
||||
n->options = $8;
|
||||
n->indexname = NULL;
|
||||
n->indexspace = $8;
|
||||
processCASbits($9, @9, "UNIQUE",
|
||||
n->indexspace = $9;
|
||||
processCASbits($10, @10, "UNIQUE",
|
||||
&n->deferrable, &n->initdeferred, NULL,
|
||||
NULL, yyscanner);
|
||||
$$ = (Node *) n;
|
||||
@@ -4167,7 +4168,7 @@ ConstraintElem:
|
||||
NULL, yyscanner);
|
||||
$$ = (Node *) n;
|
||||
}
|
||||
| PRIMARY KEY '(' columnList ')' opt_c_include opt_definition OptConsTableSpace
|
||||
| PRIMARY KEY '(' columnList opt_without_overlaps ')' opt_c_include opt_definition OptConsTableSpace
|
||||
ConstraintAttributeSpec
|
||||
{
|
||||
Constraint *n = makeNode(Constraint);
|
||||
@@ -4175,11 +4176,12 @@ ConstraintElem:
|
||||
n->contype = CONSTR_PRIMARY;
|
||||
n->location = @1;
|
||||
n->keys = $4;
|
||||
n->including = $6;
|
||||
n->options = $7;
|
||||
n->without_overlaps = $5;
|
||||
n->including = $7;
|
||||
n->options = $8;
|
||||
n->indexname = NULL;
|
||||
n->indexspace = $8;
|
||||
processCASbits($9, @9, "PRIMARY KEY",
|
||||
n->indexspace = $9;
|
||||
processCASbits($10, @10, "PRIMARY KEY",
|
||||
&n->deferrable, &n->initdeferred, NULL,
|
||||
NULL, yyscanner);
|
||||
$$ = (Node *) n;
|
||||
@@ -4247,6 +4249,11 @@ opt_no_inherit: NO INHERIT { $$ = true; }
|
||||
| /* EMPTY */ { $$ = false; }
|
||||
;
|
||||
|
||||
opt_without_overlaps:
|
||||
WITHOUT OVERLAPS { $$ = true; }
|
||||
| /*EMPTY*/ { $$ = false; }
|
||||
;
|
||||
|
||||
opt_column_list:
|
||||
'(' columnList ')' { $$ = $2; }
|
||||
| /*EMPTY*/ { $$ = NIL; }
|
||||
|
||||
@@ -1716,6 +1716,7 @@ generateClonedIndexStmt(RangeVar *heapRel, Relation source_idx,
|
||||
index->unique = idxrec->indisunique;
|
||||
index->nulls_not_distinct = idxrec->indnullsnotdistinct;
|
||||
index->primary = idxrec->indisprimary;
|
||||
index->iswithoutoverlaps = (idxrec->indisprimary || idxrec->indisunique) && idxrec->indisexclusion;
|
||||
index->transformed = true; /* don't need transformIndexStmt */
|
||||
index->concurrent = false;
|
||||
index->if_not_exists = false;
|
||||
@@ -1765,7 +1766,9 @@ generateClonedIndexStmt(RangeVar *heapRel, Relation source_idx,
|
||||
int nElems;
|
||||
int i;
|
||||
|
||||
Assert(conrec->contype == CONSTRAINT_EXCLUSION);
|
||||
Assert(conrec->contype == CONSTRAINT_EXCLUSION ||
|
||||
(index->iswithoutoverlaps &&
|
||||
(conrec->contype == CONSTRAINT_PRIMARY || conrec->contype == CONSTRAINT_UNIQUE)));
|
||||
/* Extract operator OIDs from the pg_constraint tuple */
|
||||
datum = SysCacheGetAttrNotNull(CONSTROID, ht_constr,
|
||||
Anum_pg_constraint_conexclop);
|
||||
@@ -2305,6 +2308,7 @@ transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt)
|
||||
}
|
||||
index->nulls_not_distinct = constraint->nulls_not_distinct;
|
||||
index->isconstraint = true;
|
||||
index->iswithoutoverlaps = constraint->without_overlaps;
|
||||
index->deferrable = constraint->deferrable;
|
||||
index->initdeferred = constraint->initdeferred;
|
||||
|
||||
@@ -2397,6 +2401,11 @@ transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt)
|
||||
errmsg("index \"%s\" is not valid", index_name),
|
||||
parser_errposition(cxt->pstate, constraint->location)));
|
||||
|
||||
/*
|
||||
* Today we forbid non-unique indexes, but we could permit GiST
|
||||
* indexes whose last entry is a range type and use that to create a
|
||||
* WITHOUT OVERLAPS constraint (i.e. a temporal constraint).
|
||||
*/
|
||||
if (!index_form->indisunique)
|
||||
ereport(ERROR,
|
||||
(errcode(ERRCODE_WRONG_OBJECT_TYPE),
|
||||
@@ -2673,6 +2682,23 @@ transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt)
|
||||
notnullcmds = lappend(notnullcmds, notnullcmd);
|
||||
}
|
||||
}
|
||||
|
||||
if (constraint->without_overlaps)
|
||||
{
|
||||
/*
|
||||
* This enforces that there is at least one equality column
|
||||
* besides the WITHOUT OVERLAPS columns. This is per SQL
|
||||
* standard. XXX Do we need this?
|
||||
*/
|
||||
if (list_length(constraint->keys) < 2)
|
||||
ereport(ERROR,
|
||||
errcode(ERRCODE_SYNTAX_ERROR),
|
||||
errmsg("constraint using WITHOUT OVERLAPS needs at least two columns"));
|
||||
|
||||
/* WITHOUT OVERLAPS requires a GiST index */
|
||||
index->accessMethod = "gist";
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
/*
|
||||
|
||||
@@ -2380,6 +2380,8 @@ pg_get_constraintdef_worker(Oid constraintId, bool fullCommand,
|
||||
Anum_pg_constraint_conkey);
|
||||
|
||||
keyatts = decompile_column_index_array(val, conForm->conrelid, &buf);
|
||||
if (conForm->conwithoutoverlaps)
|
||||
appendStringInfoString(&buf, " WITHOUT OVERLAPS");
|
||||
|
||||
appendStringInfoChar(&buf, ')');
|
||||
|
||||
|
||||
18
src/backend/utils/cache/relcache.c
vendored
18
src/backend/utils/cache/relcache.c
vendored
@@ -5568,11 +5568,14 @@ RelationGetIdentityKeyBitmap(Relation relation)
|
||||
/*
|
||||
* RelationGetExclusionInfo -- get info about index's exclusion constraint
|
||||
*
|
||||
* This should be called only for an index that is known to have an
|
||||
* associated exclusion constraint. It returns arrays (palloc'd in caller's
|
||||
* context) of the exclusion operator OIDs, their underlying functions'
|
||||
* OIDs, and their strategy numbers in the index's opclasses. We cache
|
||||
* all this information since it requires a fair amount of work to get.
|
||||
* This should be called only for an index that is known to have an associated
|
||||
* exclusion constraint or primary key/unique constraint using WITHOUT
|
||||
* OVERLAPS.
|
||||
|
||||
* It returns arrays (palloc'd in caller's context) of the exclusion operator
|
||||
* OIDs, their underlying functions' OIDs, and their strategy numbers in the
|
||||
* index's opclasses. We cache all this information since it requires a fair
|
||||
* amount of work to get.
|
||||
*/
|
||||
void
|
||||
RelationGetExclusionInfo(Relation indexRelation,
|
||||
@@ -5636,7 +5639,10 @@ RelationGetExclusionInfo(Relation indexRelation,
|
||||
int nelem;
|
||||
|
||||
/* We want the exclusion constraint owning the index */
|
||||
if (conform->contype != CONSTRAINT_EXCLUSION ||
|
||||
if ((conform->contype != CONSTRAINT_EXCLUSION &&
|
||||
!(conform->conwithoutoverlaps && (
|
||||
conform->contype == CONSTRAINT_PRIMARY
|
||||
|| conform->contype == CONSTRAINT_UNIQUE))) ||
|
||||
conform->conindid != RelationGetRelid(indexRelation))
|
||||
continue;
|
||||
|
||||
|
||||
Reference in New Issue
Block a user