'\" t .\" Title: CREATE AGGREGATE .\" Author: The PostgreSQL Global Development Group .\" Generator: DocBook XSL Stylesheets vsnapshot .\" Date: 2022 .\" Manual: PostgreSQL 14.5 Documentation .\" Source: PostgreSQL 14.5 .\" Language: English .\" .TH "CREATE AGGREGATE" "7" "2022" "PostgreSQL 14.5" "PostgreSQL 14.5 Documentation" .\" ----------------------------------------------------------------- .\" * Define some portability stuff .\" ----------------------------------------------------------------- .\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ .\" http://bugs.debian.org/507673 .\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html .\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ .ie \n(.g .ds Aq \(aq .el .ds Aq ' .\" ----------------------------------------------------------------- .\" * set default formatting .\" ----------------------------------------------------------------- .\" disable hyphenation .nh .\" disable justification (adjust text to left margin only) .ad l .\" ----------------------------------------------------------------- .\" * MAIN CONTENT STARTS HERE * .\" ----------------------------------------------------------------- .SH "NAME" CREATE_AGGREGATE \- define a new aggregate function .SH "SYNOPSIS" .sp .nf CREATE [ OR REPLACE ] AGGREGATE \fIname\fR ( [ \fIargmode\fR ] [ \fIargname\fR ] \fIarg_data_type\fR [ , \&.\&.\&. ] ) ( SFUNC = \fIsfunc\fR, STYPE = \fIstate_data_type\fR [ , SSPACE = \fIstate_data_size\fR ] [ , FINALFUNC = \fIffunc\fR ] [ , FINALFUNC_EXTRA ] [ , FINALFUNC_MODIFY = { READ_ONLY | SHAREABLE | READ_WRITE } ] [ , COMBINEFUNC = \fIcombinefunc\fR ] [ , SERIALFUNC = \fIserialfunc\fR ] [ , DESERIALFUNC = \fIdeserialfunc\fR ] [ , INITCOND = \fIinitial_condition\fR ] [ , MSFUNC = \fImsfunc\fR ] [ , MINVFUNC = \fIminvfunc\fR ] [ , MSTYPE = \fImstate_data_type\fR ] [ , MSSPACE = \fImstate_data_size\fR ] [ , MFINALFUNC = \fImffunc\fR ] [ , MFINALFUNC_EXTRA ] [ , MFINALFUNC_MODIFY = { READ_ONLY | SHAREABLE | READ_WRITE } ] [ , MINITCOND = \fIminitial_condition\fR ] [ , SORTOP = \fIsort_operator\fR ] [ , PARALLEL = { SAFE | RESTRICTED | UNSAFE } ] ) CREATE [ OR REPLACE ] AGGREGATE \fIname\fR ( [ [ \fIargmode\fR ] [ \fIargname\fR ] \fIarg_data_type\fR [ , \&.\&.\&. ] ] ORDER BY [ \fIargmode\fR ] [ \fIargname\fR ] \fIarg_data_type\fR [ , \&.\&.\&. ] ) ( SFUNC = \fIsfunc\fR, STYPE = \fIstate_data_type\fR [ , SSPACE = \fIstate_data_size\fR ] [ , FINALFUNC = \fIffunc\fR ] [ , FINALFUNC_EXTRA ] [ , FINALFUNC_MODIFY = { READ_ONLY | SHAREABLE | READ_WRITE } ] [ , INITCOND = \fIinitial_condition\fR ] [ , PARALLEL = { SAFE | RESTRICTED | UNSAFE } ] [ , HYPOTHETICAL ] ) or the old syntax CREATE [ OR REPLACE ] AGGREGATE \fIname\fR ( BASETYPE = \fIbase_type\fR, SFUNC = \fIsfunc\fR, STYPE = \fIstate_data_type\fR [ , SSPACE = \fIstate_data_size\fR ] [ , FINALFUNC = \fIffunc\fR ] [ , FINALFUNC_EXTRA ] [ , FINALFUNC_MODIFY = { READ_ONLY | SHAREABLE | READ_WRITE } ] [ , COMBINEFUNC = \fIcombinefunc\fR ] [ , SERIALFUNC = \fIserialfunc\fR ] [ , DESERIALFUNC = \fIdeserialfunc\fR ] [ , INITCOND = \fIinitial_condition\fR ] [ , MSFUNC = \fImsfunc\fR ] [ , MINVFUNC = \fIminvfunc\fR ] [ , MSTYPE = \fImstate_data_type\fR ] [ , MSSPACE = \fImstate_data_size\fR ] [ , MFINALFUNC = \fImffunc\fR ] [ , MFINALFUNC_EXTRA ] [ , MFINALFUNC_MODIFY = { READ_ONLY | SHAREABLE | READ_WRITE } ] [ , MINITCOND = \fIminitial_condition\fR ] [ , SORTOP = \fIsort_operator\fR ] ) .fi .SH "DESCRIPTION" .PP \fBCREATE AGGREGATE\fR defines a new aggregate function\&. \fBCREATE OR REPLACE AGGREGATE\fR will either define a new aggregate function or replace an existing definition\&. Some basic and commonly\-used aggregate functions are included with the distribution; they are documented in Section\ \&9.21\&. If one defines new types or needs an aggregate function not already provided, then \fBCREATE AGGREGATE\fR can be used to provide the desired features\&. .PP When replacing an existing definition, the argument types, result type, and number of direct arguments may not be changed\&. Also, the new definition must be of the same kind (ordinary aggregate, ordered\-set aggregate, or hypothetical\-set aggregate) as the old one\&. .PP If a schema name is given (for example, CREATE AGGREGATE myschema\&.myagg \&.\&.\&.) then the aggregate function is created in the specified schema\&. Otherwise it is created in the current schema\&. .PP An aggregate function is identified by its name and input data type(s)\&. Two aggregates in the same schema can have the same name if they operate on different input types\&. The name and input data type(s) of an aggregate must also be distinct from the name and input data type(s) of every ordinary function in the same schema\&. This behavior is identical to overloading of ordinary function names (see CREATE FUNCTION (\fBCREATE_FUNCTION\fR(7)))\&. .PP A simple aggregate function is made from one or two ordinary functions: a state transition function \fIsfunc\fR, and an optional final calculation function \fIffunc\fR\&. These are used as follows: .sp .if n \{\ .RS 4 .\} .nf \fIsfunc\fR( internal\-state, next\-data\-values ) \-\-\-> next\-internal\-state \fIffunc\fR( internal\-state ) \-\-\-> aggregate\-value .fi .if n \{\ .RE .\} .PP PostgreSQL creates a temporary variable of data type \fIstype\fR to hold the current internal state of the aggregate\&. At each input row, the aggregate argument value(s) are calculated and the state transition function is invoked with the current state value and the new argument value(s) to calculate a new internal state value\&. After all the rows have been processed, the final function is invoked once to calculate the aggregate\*(Aqs return value\&. If there is no final function then the ending state value is returned as\-is\&. .PP An aggregate function can provide an initial condition, that is, an initial value for the internal state value\&. This is specified and stored in the database as a value of type text, but it must be a valid external representation of a constant of the state value data type\&. If it is not supplied then the state value starts out null\&. .PP If the state transition function is declared \(lqstrict\(rq, then it cannot be called with null inputs\&. With such a transition function, aggregate execution behaves as follows\&. Rows with any null input values are ignored (the function is not called and the previous state value is retained)\&. If the initial state value is null, then at the first row with all\-nonnull input values, the first argument value replaces the state value, and the transition function is invoked at each subsequent row with all\-nonnull input values\&. This is handy for implementing aggregates like \fBmax\fR\&. Note that this behavior is only available when \fIstate_data_type\fR is the same as the first \fIarg_data_type\fR\&. When these types are different, you must supply a nonnull initial condition or use a nonstrict transition function\&. .PP If the state transition function is not strict, then it will be called unconditionally at each input row, and must deal with null inputs and null state values for itself\&. This allows the aggregate author to have full control over the aggregate\*(Aqs handling of null values\&. .PP If the final function is declared \(lqstrict\(rq, then it will not be called when the ending state value is null; instead a null result will be returned automatically\&. (Of course this is just the normal behavior of strict functions\&.) In any case the final function has the option of returning a null value\&. For example, the final function for \fBavg\fR returns null when it sees there were zero input rows\&. .PP Sometimes it is useful to declare the final function as taking not just the state value, but extra parameters corresponding to the aggregate\*(Aqs input values\&. The main reason for doing this is if the final function is polymorphic and the state value\*(Aqs data type would be inadequate to pin down the result type\&. These extra parameters are always passed as NULL (and so the final function must not be strict when the FINALFUNC_EXTRA option is used), but nonetheless they are valid parameters\&. The final function could for example make use of \fBget_fn_expr_argtype\fR to identify the actual argument type in the current call\&. .PP An aggregate can optionally support moving\-aggregate mode, as described in Section\ \&38.12.1\&. This requires specifying the MSFUNC, MINVFUNC, and MSTYPE parameters, and optionally the MSSPACE, MFINALFUNC, MFINALFUNC_EXTRA, MFINALFUNC_MODIFY, and MINITCOND parameters\&. Except for MINVFUNC, these parameters work like the corresponding simple\-aggregate parameters without M; they define a separate implementation of the aggregate that includes an inverse transition function\&. .PP The syntax with ORDER BY in the parameter list creates a special type of aggregate called an ordered\-set aggregate; or if HYPOTHETICAL is specified, then a hypothetical\-set aggregate is created\&. These aggregates operate over groups of sorted values in order\-dependent ways, so that specification of an input sort order is an essential part of a call\&. Also, they can have direct arguments, which are arguments that are evaluated only once per aggregation rather than once per input row\&. Hypothetical\-set aggregates are a subclass of ordered\-set aggregates in which some of the direct arguments are required to match, in number and data types, the aggregated argument columns\&. This allows the values of those direct arguments to be added to the collection of aggregate\-input rows as an additional \(lqhypothetical\(rq row\&. .PP An aggregate can optionally support partial aggregation, as described in Section\ \&38.12.4\&. This requires specifying the COMBINEFUNC parameter\&. If the \fIstate_data_type\fR is internal, it\*(Aqs usually also appropriate to provide the SERIALFUNC and DESERIALFUNC parameters so that parallel aggregation is possible\&. Note that the aggregate must also be marked PARALLEL SAFE to enable parallel aggregation\&. .PP Aggregates that behave like \fBMIN\fR or \fBMAX\fR can sometimes be optimized by looking into an index instead of scanning every input row\&. If this aggregate can be so optimized, indicate it by specifying a sort operator\&. The basic requirement is that the aggregate must yield the first element in the sort ordering induced by the operator; in other words: .sp .if n \{\ .RS 4 .\} .nf SELECT agg(col) FROM tab; .fi .if n \{\ .RE .\} .sp must be equivalent to: .sp .if n \{\ .RS 4 .\} .nf SELECT col FROM tab ORDER BY col USING sortop LIMIT 1; .fi .if n \{\ .RE .\} .sp Further assumptions are that the aggregate ignores null inputs, and that it delivers a null result if and only if there were no non\-null inputs\&. Ordinarily, a data type\*(Aqs < operator is the proper sort operator for \fBMIN\fR, and > is the proper sort operator for \fBMAX\fR\&. Note that the optimization will never actually take effect unless the specified operator is the \(lqless than\(rq or \(lqgreater than\(rq strategy member of a B\-tree index operator class\&. .PP To be able to create an aggregate function, you must have USAGE privilege on the argument types, the state type(s), and the return type, as well as EXECUTE privilege on the supporting functions\&. .SH "PARAMETERS" .PP \fIname\fR .RS 4 The name (optionally schema\-qualified) of the aggregate function to create\&. .RE .PP \fIargmode\fR .RS 4 The mode of an argument: IN or VARIADIC\&. (Aggregate functions do not support OUT arguments\&.) If omitted, the default is IN\&. Only the last argument can be marked VARIADIC\&. .RE .PP \fIargname\fR .RS 4 The name of an argument\&. This is currently only useful for documentation purposes\&. If omitted, the argument has no name\&. .RE .PP \fIarg_data_type\fR .RS 4 An input data type on which this aggregate function operates\&. To create a zero\-argument aggregate function, write * in place of the list of argument specifications\&. (An example of such an aggregate is \fBcount(*)\fR\&.) .RE .PP \fIbase_type\fR .RS 4 In the old syntax for \fBCREATE AGGREGATE\fR, the input data type is specified by a basetype parameter rather than being written next to the aggregate name\&. Note that this syntax allows only one input parameter\&. To define a zero\-argument aggregate function with this syntax, specify the basetype as "ANY" (not *)\&. Ordered\-set aggregates cannot be defined with the old syntax\&. .RE .PP \fIsfunc\fR .RS 4 The name of the state transition function to be called for each input row\&. For a normal \fIN\fR\-argument aggregate function, the \fIsfunc\fR must take \fIN\fR+1 arguments, the first being of type \fIstate_data_type\fR and the rest matching the declared input data type(s) of the aggregate\&. The function must return a value of type \fIstate_data_type\fR\&. This function takes the current state value and the current input data value(s), and returns the next state value\&. .sp For ordered\-set (including hypothetical\-set) aggregates, the state transition function receives only the current state value and the aggregated arguments, not the direct arguments\&. Otherwise it is the same\&. .RE .PP \fIstate_data_type\fR .RS 4 The data type for the aggregate\*(Aqs state value\&. .RE .PP \fIstate_data_size\fR .RS 4 The approximate average size (in bytes) of the aggregate\*(Aqs state value\&. If this parameter is omitted or is zero, a default estimate is used based on the \fIstate_data_type\fR\&. The planner uses this value to estimate the memory required for a grouped aggregate query\&. .RE .PP \fIffunc\fR .RS 4 The name of the final function called to compute the aggregate\*(Aqs result after all input rows have been traversed\&. For a normal aggregate, this function must take a single argument of type \fIstate_data_type\fR\&. The return data type of the aggregate is defined as the return type of this function\&. If \fIffunc\fR is not specified, then the ending state value is used as the aggregate\*(Aqs result, and the return type is \fIstate_data_type\fR\&. .sp For ordered\-set (including hypothetical\-set) aggregates, the final function receives not only the final state value, but also the values of all the direct arguments\&. .sp If FINALFUNC_EXTRA is specified, then in addition to the final state value and any direct arguments, the final function receives extra NULL values corresponding to the aggregate\*(Aqs regular (aggregated) arguments\&. This is mainly useful to allow correct resolution of the aggregate result type when a polymorphic aggregate is being defined\&. .RE .PP FINALFUNC_MODIFY = { READ_ONLY | SHAREABLE | READ_WRITE } .RS 4 This option specifies whether the final function is a pure function that does not modify its arguments\&. READ_ONLY indicates it does not; the other two values indicate that it may change the transition state value\&. See Notes below for more detail\&. The default is READ_ONLY, except for ordered\-set aggregates, for which the default is READ_WRITE\&. .RE .PP \fIcombinefunc\fR .RS 4 The \fIcombinefunc\fR function may optionally be specified to allow the aggregate function to support partial aggregation\&. If provided, the \fIcombinefunc\fR must combine two \fIstate_data_type\fR values, each containing the result of aggregation over some subset of the input values, to produce a new \fIstate_data_type\fR that represents the result of aggregating over both sets of inputs\&. This function can be thought of as an \fIsfunc\fR, where instead of acting upon an individual input row and adding it to the running aggregate state, it adds another aggregate state to the running state\&. .sp The \fIcombinefunc\fR must be declared as taking two arguments of the \fIstate_data_type\fR and returning a value of the \fIstate_data_type\fR\&. Optionally this function may be \(lqstrict\(rq\&. In this case the function will not be called when either of the input states are null; the other state will be taken as the correct result\&. .sp For aggregate functions whose \fIstate_data_type\fR is internal, the \fIcombinefunc\fR must not be strict\&. In this case the \fIcombinefunc\fR must ensure that null states are handled correctly and that the state being returned is properly stored in the aggregate memory context\&. .RE .PP \fIserialfunc\fR .RS 4 An aggregate function whose \fIstate_data_type\fR is internal can participate in parallel aggregation only if it has a \fIserialfunc\fR function, which must serialize the aggregate state into a bytea value for transmission to another process\&. This function must take a single argument of type internal and return type bytea\&. A corresponding \fIdeserialfunc\fR is also required\&. .RE .PP \fIdeserialfunc\fR .RS 4 Deserialize a previously serialized aggregate state back into \fIstate_data_type\fR\&. This function must take two arguments of types bytea and internal, and produce a result of type internal\&. (Note: the second, internal argument is unused, but is required for type safety reasons\&.) .RE .PP \fIinitial_condition\fR .RS 4 The initial setting for the state value\&. This must be a string constant in the form accepted for the data type \fIstate_data_type\fR\&. If not specified, the state value starts out null\&. .RE .PP \fImsfunc\fR .RS 4 The name of the forward state transition function to be called for each input row in moving\-aggregate mode\&. This is exactly like the regular transition function, except that its first argument and result are of type \fImstate_data_type\fR, which might be different from \fIstate_data_type\fR\&. .RE .PP \fIminvfunc\fR .RS 4 The name of the inverse state transition function to be used in moving\-aggregate mode\&. This function has the same argument and result types as \fImsfunc\fR, but it is used to remove a value from the current aggregate state, rather than add a value to it\&. The inverse transition function must have the same strictness attribute as the forward state transition function\&. .RE .PP \fImstate_data_type\fR .RS 4 The data type for the aggregate\*(Aqs state value, when using moving\-aggregate mode\&. .RE .PP \fImstate_data_size\fR .RS 4 The approximate average size (in bytes) of the aggregate\*(Aqs state value, when using moving\-aggregate mode\&. This works the same as \fIstate_data_size\fR\&. .RE .PP \fImffunc\fR .RS 4 The name of the final function called to compute the aggregate\*(Aqs result after all input rows have been traversed, when using moving\-aggregate mode\&. This works the same as \fIffunc\fR, except that its first argument\*(Aqs type is \fImstate_data_type\fR and extra dummy arguments are specified by writing MFINALFUNC_EXTRA\&. The aggregate result type determined by \fImffunc\fR or \fImstate_data_type\fR must match that determined by the aggregate\*(Aqs regular implementation\&. .RE .PP MFINALFUNC_MODIFY = { READ_ONLY | SHAREABLE | READ_WRITE } .RS 4 This option is like FINALFUNC_MODIFY, but it describes the behavior of the moving\-aggregate final function\&. .RE .PP \fIminitial_condition\fR .RS 4 The initial setting for the state value, when using moving\-aggregate mode\&. This works the same as \fIinitial_condition\fR\&. .RE .PP \fIsort_operator\fR .RS 4 The associated sort operator for a \fBMIN\fR\- or \fBMAX\fR\-like aggregate\&. This is just an operator name (possibly schema\-qualified)\&. The operator is assumed to have the same input data types as the aggregate (which must be a single\-argument normal aggregate)\&. .RE .PP PARALLEL = { SAFE | RESTRICTED | UNSAFE } .RS 4 The meanings of PARALLEL SAFE, PARALLEL RESTRICTED, and PARALLEL UNSAFE are the same as in \fBCREATE FUNCTION\fR\&. An aggregate will not be considered for parallelization if it is marked PARALLEL UNSAFE (which is the default!) or PARALLEL RESTRICTED\&. Note that the parallel\-safety markings of the aggregate\*(Aqs support functions are not consulted by the planner, only the marking of the aggregate itself\&. .RE .PP HYPOTHETICAL .RS 4 For ordered\-set aggregates only, this flag specifies that the aggregate arguments are to be processed according to the requirements for hypothetical\-set aggregates: that is, the last few direct arguments must match the data types of the aggregated (WITHIN GROUP) arguments\&. The HYPOTHETICAL flag has no effect on run\-time behavior, only on parse\-time resolution of the data types and collations of the aggregate\*(Aqs arguments\&. .RE .PP The parameters of \fBCREATE AGGREGATE\fR can be written in any order, not just the order illustrated above\&. .SH "NOTES" .PP In parameters that specify support function names, you can write a schema name if needed, for example SFUNC = public\&.sum\&. Do not write argument types there, however \(em the argument types of the support functions are determined from other parameters\&. .PP Ordinarily, PostgreSQL functions are expected to be true functions that do not modify their input values\&. However, an aggregate transition function, \fIwhen used in the context of an aggregate\fR, is allowed to cheat and modify its transition\-state argument in place\&. This can provide substantial performance benefits compared to making a fresh copy of the transition state each time\&. .PP Likewise, while an aggregate final function is normally expected not to modify its input values, sometimes it is impractical to avoid modifying the transition\-state argument\&. Such behavior must be declared using the FINALFUNC_MODIFY parameter\&. The READ_WRITE value indicates that the final function modifies the transition state in unspecified ways\&. This value prevents use of the aggregate as a window function, and it also prevents merging of transition states for aggregate calls that share the same input values and transition functions\&. The SHAREABLE value indicates that the transition function cannot be applied after the final function, but multiple final\-function calls can be performed on the ending transition state value\&. This value prevents use of the aggregate as a window function, but it allows merging of transition states\&. (That is, the optimization of interest here is not applying the same final function repeatedly, but applying different final functions to the same ending transition state value\&. This is allowed as long as none of the final functions are marked READ_WRITE\&.) .PP If an aggregate supports moving\-aggregate mode, it will improve calculation efficiency when the aggregate is used as a window function for a window with moving frame start (that is, a frame start mode other than UNBOUNDED PRECEDING)\&. Conceptually, the forward transition function adds input values to the aggregate\*(Aqs state when they enter the window frame from the bottom, and the inverse transition function removes them again when they leave the frame at the top\&. So, when values are removed, they are always removed in the same order they were added\&. Whenever the inverse transition function is invoked, it will thus receive the earliest added but not yet removed argument value(s)\&. The inverse transition function can assume that at least one row will remain in the current state after it removes the oldest row\&. (When this would not be the case, the window function mechanism simply starts a fresh aggregation, rather than using the inverse transition function\&.) .PP The forward transition function for moving\-aggregate mode is not allowed to return NULL as the new state value\&. If the inverse transition function returns NULL, this is taken as an indication that the inverse function cannot reverse the state calculation for this particular input, and so the aggregate calculation will be redone from scratch for the current frame starting position\&. This convention allows moving\-aggregate mode to be used in situations where there are some infrequent cases that are impractical to reverse out of the running state value\&. .PP If no moving\-aggregate implementation is supplied, the aggregate can still be used with moving frames, but PostgreSQL will recompute the whole aggregation whenever the start of the frame moves\&. Note that whether or not the aggregate supports moving\-aggregate mode, PostgreSQL can handle a moving frame end without recalculation; this is done by continuing to add new values to the aggregate\*(Aqs state\&. This is why use of an aggregate as a window function requires that the final function be read\-only: it must not damage the aggregate\*(Aqs state value, so that the aggregation can be continued even after an aggregate result value has been obtained for one set of frame boundaries\&. .PP The syntax for ordered\-set aggregates allows VARIADIC to be specified for both the last direct parameter and the last aggregated (WITHIN GROUP) parameter\&. However, the current implementation restricts use of VARIADIC in two ways\&. First, ordered\-set aggregates can only use VARIADIC "any", not other variadic array types\&. Second, if the last direct parameter is VARIADIC "any", then there can be only one aggregated parameter and it must also be VARIADIC "any"\&. (In the representation used in the system catalogs, these two parameters are merged into a single VARIADIC "any" item, since pg_proc cannot represent functions with more than one VARIADIC parameter\&.) If the aggregate is a hypothetical\-set aggregate, the direct arguments that match the VARIADIC "any" parameter are the hypothetical ones; any preceding parameters represent additional direct arguments that are not constrained to match the aggregated arguments\&. .PP Currently, ordered\-set aggregates do not need to support moving\-aggregate mode, since they cannot be used as window functions\&. .PP Partial (including parallel) aggregation is currently not supported for ordered\-set aggregates\&. Also, it will never be used for aggregate calls that include DISTINCT or ORDER BY clauses, since those semantics cannot be supported during partial aggregation\&. .SH "EXAMPLES" .PP See Section\ \&38.12\&. .SH "COMPATIBILITY" .PP \fBCREATE AGGREGATE\fR is a PostgreSQL language extension\&. The SQL standard does not provide for user\-defined aggregate functions\&. .SH "SEE ALSO" ALTER AGGREGATE (\fBALTER_AGGREGATE\fR(7)), DROP AGGREGATE (\fBDROP_AGGREGATE\fR(7))