Containment of aggregate queries

Sara Cohen, Werner Nutt, Yehoshua Sagiv

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

26 Citations (Scopus)


The problem of deciding containment of aggregate queries is investigated. Containment is reduced to equivalence for queries with expandable aggregation functions. Many common aggregation functions, such as max, cntd (count distinct), count, sum, avg, median and stdev (standard deviation) are shown to be expandable. It is shown that even in the presence of integrity constraints, containment can be reduced to equivalence. For conjunctive count and sum-queries, simpler characterizations for containment are given, that do not require checking equivalence. These results are built upon in order to solve the problem of finding maximally-contained sets of rewritings for conjunctive count-queries. © Springer-Verlag Berlin Heidelberg 2003.

Original languageEnglish
Title of host publicationDatabase Theory — ICDT 2003
Subtitle of host publication9th International Conference Siena, Italy, January 8–10, 2003 Proceedings
Number of pages15
ISBN (Electronic)978-3-540-36285-2
Publication statusPublished - 2003
Event9th International Conference on Database Theory - Siena, Italy
Duration: 8 Jan 200310 Jan 2003

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conference9th International Conference on Database Theory
Abbreviated titleICDT 2003


Dive into the research topics of 'Containment of aggregate queries'. Together they form a unique fingerprint.

Cite this