Authors
Sara Cohen, Werner Nutt, Yehoshua Sagiv
Publication date
2002/12/16
Book
International Conference on Database Theory
Pages
111-125
Publisher
Springer Berlin Heidelberg
Description
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.
Total citations
2004200520062007200820092010201120122013201420152016201720182019202020212022202326631632615221211
Scholar articles
S Cohen, W Nutt, Y Sagiv - International Conference on Database Theory, 2002