Show simple item record

dc.contributor.authorCohen, S
dc.contributor.authorNutt, W
dc.contributor.authorSagiv, Y
dc.descriptionArticle No. 5en_US
dc.description.abstractEquivalence of aggregate queries is investigated for the class of conjunctive queries with comparisons and the aggregate operators count, count-distinct, min, max, and sum. Essentially, this class contains unnested SQL queries with the above aggregate operators, with a where clause consisting of a conjunction of comparisons, and without a having clause. The comparisons are either interpreted over a domain with a dense order (like the rationals) or with a discrete order (like the integers). Characterizations of equivalence differ for the two cases. For queries with either max or min, equivalence is characterized in terms of dominance mappings, which can be viewed as a generalization of containment mappings. For queries with the count-distinct operator, a sufficient condition for equivalence is given in terms of equivalence of conjunctive queries under set semantics. For some special cases, it is shown that this condition is also necessary. For conjunctive queries with comparisons but without aggregation, equivalence under bag-set semantics is characterized in terms of isomorphism. This characterization essentially remains the same also for queries with the count operator. Moreover, this characterization also applies to queries with the sum operator if the queries have either constants or comparisons, but not both. In the general case (i.e., both comparisons andconstants), the characterization of the equivalence of queries with the sum operator is more elaborate. All the characterizations given in the paper are decidable in polynomial space.en_US
dc.publisherAssociation for Computing Machineryen_US
dc.titleDeciding equivalences among conjunctive aggregate queriesen_US
dc.journal.titleJournal- ACM

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record