Abstract
The containment and equivalence for aggregate queries and positive relational nonaggregate queries were evaluated. The expressivity of logics that extend first-order logic by aggregation was studied. The problem of determining satisfiability of a conjunction of aggregation constraints was considered. It was discussed how determining equivalence among aggregate queries differs from determining equivalence among nonaggregate queries. The problem of characterizing equivalence of aggregate queries, by comparing this problem to the corresponding one for nonaggregate queries.
| Original language | English |
|---|---|
| Pages (from-to) | 77-85 |
| Number of pages | 9 |
| Journal | SIGMOD Record |
| Volume | 34 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 2005 |
| Externally published | Yes |