Containment of aggregate queries

Sara Cohen; Werner Nutt; Yehoshua Sagiv

doi:10.1007/3-540-36285-1_8

Containment of aggregate queries

Sara Cohen^*, Werner Nutt, Yehoshua Sagiv

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

26 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Diego Calvanese, Maurizio Lenzerini, Rajeev Motwani
Publisher	Springer Verlag
Pages	111-125
Number of pages	15
ISBN (Electronic)	3540003231, 9783540003236
DOIs	https://doi.org/10.1007/3-540-36285-1_8
State	Published - 2003

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2572
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/3-540-36285-1_8

Cite this

Cohen, S., Nutt, W., & Sagiv, Y. (2003). Containment of aggregate queries. In D. Calvanese, M. Lenzerini, & R. Motwani (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 111-125). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2572). Springer Verlag. https://doi.org/10.1007/3-540-36285-1_8

Cohen, Sara ; Nutt, Werner ; Sagiv, Yehoshua. / Containment of aggregate queries. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Diego Calvanese ; Maurizio Lenzerini ; Rajeev Motwani. Springer Verlag, 2003. pp. 111-125 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{858cdf7626434f40a058cdcfcc25311f,

title = "Containment of aggregate queries",

abstract = "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.",

author = "Sara Cohen and Werner Nutt and Yehoshua Sagiv",

year = "2003",

doi = "10.1007/3-540-36285-1_8",

language = "אנגלית",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "111--125",

editor = "Diego Calvanese and Maurizio Lenzerini and Rajeev Motwani",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "גרמניה",

}

Cohen, S, Nutt, W & Sagiv, Y 2003, Containment of aggregate queries. in D Calvanese, M Lenzerini & R Motwani (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2572, Springer Verlag, pp. 111-125. https://doi.org/10.1007/3-540-36285-1_8

Containment of aggregate queries. / Cohen, Sara; Nutt, Werner; Sagiv, Yehoshua.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Diego Calvanese; Maurizio Lenzerini; Rajeev Motwani. Springer Verlag, 2003. p. 111-125 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2572).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Containment of aggregate queries

AU - Cohen, Sara

AU - Nutt, Werner

AU - Sagiv, Yehoshua

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35248861537&partnerID=8YFLogxK

U2 - 10.1007/3-540-36285-1_8

DO - 10.1007/3-540-36285-1_8

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:35248861537

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 111

EP - 125

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Calvanese, Diego

A2 - Lenzerini, Maurizio

A2 - Motwani, Rajeev

PB - Springer Verlag

ER -

Cohen S, Nutt W, Sagiv Y. Containment of aggregate queries. In Calvanese D, Lenzerini M, Motwani R, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 111-125. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-36285-1_8

Containment of aggregate queries

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this