Abstract
The problem of rewriting aggregate queries using views is studied for conjunctive queries with arbitrary aggregation functions and built-in predicates. Two types of queries over views are introduced for rewriting aggregate queries: pure candidates and aggregate candidates. Pure candidates can be used to rewrite arbitrary aggregate queries. Aggregate candidates can be used to rewrite queries containing aggregate functions definable in terms of a commutative-semigroup operation. For both types of candidates (as well as for several relaxations of these candidates), the unfolding property holds. This allows characterizations for query equivalence to be used to determine whether a candidate is a rewriting of a query. The complexity of the rewriting-existence problem is also studied and upper and lower complexity bounds are given.
| Original language | English |
|---|---|
| Pages (from-to) | 672-715 |
| Number of pages | 44 |
| Journal | ACM Transactions on Database Systems |
| Volume | 31 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2006 |
| Externally published | Yes |
Keywords
- Query equivalence
- Query rewriting
- View usability