Equivalences Among Aggregate Queries with Negation

Simple item page
dc.creatorCohen, Sara
dc.creatorNutt, Werner
dc.creatorSagiv, Yehoshua
dc.date2002-10-29
dc.date2002-10-30
dc.date.accessioned2026-07-07T03:18:57Z
dc.date.available2026-07-07T03:18:57Z
dc.descriptionQuery equivalence is investigated for disjunctive aggregate queries with negated subgoals, constants and comparisons. A full characterization of equivalence is given for the aggregation functions count, max, sum, prod, toptwo and parity. A related problem is that of determining, for a given natural number N, whether two given queries are equivalent over all databases with at most N constants. We call this problem bounded equivalence. A complete characterization of decidability of bounded equivalence is given. In particular, it is shown that this problem is decidable for all the above aggregation functions as well as for count distinct and average. For quasilinear queries (i.e., queries where predicates that occur positively are not repeated) it is shown that equivalence can be decided in polynomial time for the aggregation functions count, max, sum, parity, prod, toptwo and average. A similar result holds for count distinct provided that a few additional conditions hold. The results are couched in terms of abstract characteristics of aggregation functions, and new proof techniques are used. Finally, the results above also imply that equivalence, under bag-set semantics, is decidable for non-aggregate queries with negation.
dc.description28 pages
dc.identifierhttps://arxiv.org/abs/cs/0210028
dc.identifierhttp://arxiv.org/abs/cs/0210028
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31327
dc.subjectDatabases
dc.subjectLogic in Computer Science
dc.subjectF.4.1;H.2.3;H.2.4
dc.titleEquivalences Among Aggregate Queries with Negation
dc.typetext

Files

Collections

arXiv