Imprecise data in databases were originally denoted as null values, which represent the meaning of ''values unknown at present.'' More generally, a partial value corresponds to a finite set of possible values for an attribute in which exactly one of the values is the ''true'' value. In this paper, we define a set of extended aggregate operations, namely sum, average, count, maximum, and minimum, which can be applied to an attribute containing partial values. Two types of aggregate operators are considered: scalar aggregates and aggregate functions. We study the properties of the aggregate operations and develop efficient algorithms for count, maximum and minimum. However, for sum and average, we point out that in general it takes exponential time complexity to do the computations.
