Abstract
Conditional tables have been identified long ago as a way to capture unknown or incomplete information. However, queries over conditional tables have never been allowed to involve column functions such as aggregates. In this paper, the theory of conditional tables is extended in this direction, and it is shown that a strong representation system exists which has the closure property that the result of an aggregate query over a conditional table can be again represented by a conditional table. It turns out, however, that the number of tuples in a conditional table representing the result of an aggregate query may grow exponentially in the number of variables in the table. This phenomenon is analyzed in detail, and tight upper and lower bounds concerning the number of tuples contained in the result of an aggregate query are given. Finally, representation techniques are sketched that approximate aggregation results in tables of reasonable size.
Similar content being viewed by others
References
Abiteboul, S. (1999). Onviews andXML. In Proc. 18thACMSIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Philadelphia, Pensylvania, USA (pp. 1–9).
Abiteboul, S., Hull, R., and Vianu, V. (1995). Foundations of Databases. Reading, MA: Addison-Wesley.
Chamberlin, D. (1998). A Complete Guide to DB2 Universal Database. San Mateo, CA: Morgan Kaufmann.
Grahne, G. (1991). The Problem of Incomplete Information in Relational Databases. Vol. 554 in Lecture Notes in Computer Science. Berlin: Springer-Verlag.
Gray, J., Bosworth, A., Layman, A., and Pirahesh, H. (1996). Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab, and Sub-Total. In Proc. 12th International Conference on Data Engineering, New Orleans, Louisiana (pp. 152–159).
Gupta, A., Harinarayan, V., and Quass, D. (1995). Aggregate-Query Processing in Data Warehousing Environments. In Proc. 21st International Conference on Very Large Data Bases, Zurich, Switzerland (pp. 358–369).
Gupta, A. and Mumick, I.S. (1995). Maintenance of Materialized Views: Problems, Techniques, and Applications. Data Engineering Bulletin, 18(2), 3–18.
Gupta, A., Mumick, I.S., and Subrahmanian, V.S. (1993). Maintaining Views Incrementally. In P. Buneman and S. Jajodia (Eds.), Proc. ACM SIGMOD International Conference on Management of Data, New York (pp. 157–166). ACM Press.
Imielinski, T. and Lipski, W.J. (1984). Incomplete Information in Relational Databases. Journal of the ACM, 31(4), 761–791.
Laurent, D., Lechtenbörger, J., Spyratos, N., and Vossen, G. (1999). Complements for DataWarehouses. In Proc. 15th IEEE International Conference on Data Engineering, Sydney, Australia (pp. 490–499).
Quass, D., Gupta, A., Mumick, I.S., and Widom, J. (1996). MakingViews Self-Maintainable for DataWarehousing. In Proc. 4th International Conference on Parallel and Distributed Information Systems, Brüssel (pp. 158-169). IEEE Computer Society Press.
Shu, H. (1997). View Maintenance Using Conditional Tables. In Proc. 5th International Conference on Deductive and Object-Oriented Databases, Montreux, Switzerland (pp. 67–84).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lechtenbörger, J., Shu, H. & Vossen, G. Aggregate Queries Over Conditional Tables. Journal of Intelligent Information Systems 19, 343–362 (2002). https://doi.org/10.1023/A:1020197923385
Issue Date:
DOI: https://doi.org/10.1023/A:1020197923385