DBScholar

Back to papers

Deciding Equivalences among Aggregate Queries

Summary: Characterizes equivalence of conjunctive aggregate queries with comparisons for min, max, count, count-distinct, and sum via dominance mappings (min/max), CQ-set equivalence (count-distinct), and isomorphism for bag-set/count, covering many sum cases. All characterizations are PSPACE-decidable; linear (no repeated predicates) queries admit PTIME algorithms; sum with both comparisons and constants requires a more elaborate criterion. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1147
Venue
PODS
Year
1998
Pagerank
8.8882317e-05
Overall Rank
2,238 | 84.65%
DOI
10.1145/275487.275512

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{nutt_pods98,
        address = {New York, NY, USA},
        series = {{PODS} '98},
        title = {{Deciding Equivalences among Aggregate Queries}},
        url = {https://dl.acm.org/doi/10.1145/275487.275512},
        doi = {10.1145/275487.275512},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Nutt, Werner and Sagiv, Yehoshua and Shurin, Sara},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers