DBScholar

Back to papers

Querying Aggregate Data

Summary: FO over reals with polynomial arithmetic and count/iterated sum/product aggregates: expressive, tractable data complexity, and quantifier elimination holds. Define “isomorphism modulo a product” to characterize aggregate-view equivalence; show NP‑completeness of that test and of complete count‑view rewriting, and give arithmetic-based rewritings to recover counts for automatic aggregation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1171
Venue
PODS
Year
1999
Pagerank
8.7766218e-05
Overall Rank
2,305 | 84.19%
DOI
10.1145/303976.303994

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{grumbach_pods99,
        address = {New York, NY, USA},
        series = {{PODS} '99},
        title = {{Querying Aggregate Data}},
        url = {https://dl.acm.org/doi/10.1145/303976.303994},
        doi = {10.1145/303976.303994},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Grumbach, Stéphane and Rafanelli, Maurizio and Tininini, Leonardo},
        year = {1999}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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