Abstract
We introduce a new constraint domain, aggregation constraints, which is useful in database query languages, and in constraint logic programming languages that incorporate aggregate functions. We study the fundamental problem of checking if a conjunction of aggregation constraints is solvable, and present undecidability results for many different classes of aggregation constraints. We describe a complete and minimal axiomatization of the class of aggregation constraints over finite multisets of reals, which permits a natural reduction from the class of aggregation constraints to the class of mixed integer/real, non-linear arithmetic constraints. We then present a polynomial-time algorithm that directly checks for solvability of a useful class of aggregation constraints, where the reduction-based approach does not lead to efficient checks for solvability.
Preview
Unable to display preview. Download preview PDF.
References
A. Y. Levy, I. S. Mumick, and Y. Sagiv. Query optimization by predicate movearound. In Proceedings of the International Conference on Very Large Databases, Santiago, Chile, Sept. 1994.
K. Marriott and P. J. Stuckey. Semantics of constraint logic programs with optimization. Letters on Programming Languages and Systems, 1994.
I. S. Mumick, H. Pirahesh, and R. Ramakrishnan. Duplicates and aggregates in deductive databases. In Proceedings of the Sixteenth International Conference on Very Large Databases, Aug. 1990.
A. Schrijver. Theory of Linear and Integer Programming. Discrete Mathematics and Optimization. Wiley-Interscience, 1986.
P. J. Stuckey and S. Sudarshan. Compiling query constraints. In Proceedings of the ACM Symposium on Principles of Database Systems, May 1994.
S. Sudarshan and R. Ramakrishnan. Aggregation and relevance in deductive databases. In Proceedings of the Seventeenth International Conference on Very Large Databases, Sept. 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ross, K.A., Srivastava, D., Stuckey, P.J., Sudarshan, S. (1994). Foundations of aggregation constraints. In: Borning, A. (eds) Principles and Practice of Constraint Programming. PPCP 1994. Lecture Notes in Computer Science, vol 874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58601-6_101
Download citation
DOI: https://doi.org/10.1007/3-540-58601-6_101
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58601-2
Online ISBN: 978-3-540-49032-6
eBook Packages: Springer Book Archive