Abstract
A typical problem in database theory is to verify whether there exists a relation (or database) instance satisfying a number of given dependency constraints. This problem has recently received a renewed deal of interest within the context of data exchange, but the issue of handling constraints on aggregate data has not been much investigated so far, notwithstanding the relevance of aggregate operations in exchange systems. This paper introduces count constraints that require the results of given count operations on a relation to be within a certain range. Count constraints are defined by a suitable extension of first order predicate calculus, based on set terms, and they are then used in a new decisional problem, the Inverse OLAP: given a star schema, does there exist a relation instance satisfying a set of given count constraints? The new problem turns out to be NEXP complete under various conditions: program complexity, data complexity and combined complexity. Count constraints can be also used into a data exchange system context, where data from the source database are transferred to the target database using aggregate operations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Afrati, F.N., Kolaitis, P.G.: Answering aggregate queries in data exchange. In: PODS, pp. 129–138 (2008)
Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: SIGMOD Conference, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: ACM SIGMOD, pp. 439–450 (2000)
Arasu, A., Kaushik, R., Li, J.: Data generation using declarative constraints. In: Proceedings of the 2011 International Conference on Management of Data, SIGMOD 2011, pp. 685–696. ACM, New York (2011)
Arenas, M., Barcel, P., Fagin, R., Libkin, L.: Locally consistent transformations and query answering in data exchange. In: PODS 2004, pp. 229–240 (2004)
Beeri, C., Vardi, M.Y.: Polynomial-time implication problems for unary inclusion dependencies. J. of the ACM 37, 15–46 (1990)
Binnig, C., Kossmann, D., Lo, E., Özsu, M.T.: Qagen: generating query-aware test databases. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of data, SIGMOD 2007, pp. 341–352. ACM, New York (2007)
Calders, T.: Computational complexity of itemset frequency satisfiability. In: PODS, pp. 143–154 (2004)
Calders, T.: The complexity of satisfying constraints on databases of transactions. Acta Inf. 44(7-8), 591–624 (2007)
Chaudhuri, S., Dayal, U.: An overview of data warehousing and olap technology. SIGMOD Record 26(1), 65–74 (1997)
Cosmadakis, S.S., Kanellakis, P.C., Vardi, M.Y.: Polynomial-time implication problems for unary inclusion dependencies. J. of the ACM 37, 15–46 (1990)
Faber, W., Pfeifer, G., Leone, N., Dell’Armi, T., Ielpa, G.: Design and implementation of aggregate functions in the dlv system. TPLP 8(5-6), 545–580 (2008)
Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data Exchange: Semantics and Query Answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207–224. Springer, Heidelberg (2002)
Fagin, R., Kolaitis, P.G., Popa, L.: Data exchange: getting to the core. ACM Trans. Database Syst. 30(1), 174–210 (2005)
Golfarelli, M., Rizzi, S.: Data Warehouse Design: Modern Principles and Methodologies. Mac Graw Hill (2009)
Guzzo, A., Moccia, L., Saccà, D., Serra, E.: Solving inverse frequent itemset mining with infrequency constraint via large-scale linear programs (2011), http://sacca.deis.unical.it/#view=object&format=object&id=981/gid=160
Kolaitis, P.G., Papadimitriou, C.H.: Why not negation by fixpoint? In: PODS, pp. 231–239 (1988)
Lenzerini, M.: Data integration: A theoretical perspective. In: PODS, pp. 233–246 (2002)
Lo, E., Cheng, N., Hon, W.-K.: Generating databases for query workloads. Proc. VLDB Endow. 3, 848–859 (2010)
Mielikainen, T.: On inverse frequent set mining. In: Proc. of 2nd Workshop on Privacy Preserving Data Mining (PPDM), pp. 18–23. I. C. Society (2003)
Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1994)
Papadimitriou, C.H., Yannakakis, M.: A note on succinct representations of graphs. Information and Control 71(3), 181–185 (1986)
Ramesh, G., Maniatty, W., Zaki, M.J.: Feasible itemset distributions in data mining: theory and application. In: PODS, pp. 284–295 (2003)
Rosati, R.: On the decidability and finite controllability of query processing in databases with incomplete information. In: PODS, pp. 356–365 (2006)
Saccà, D., Guzzo, A., Serra, E.: Appendix to this paper (2012), http://sacca.deis.unical.it/#view=object&format=object&id=960/gid=160
Syrjänen, T.: Logic Programs and Cardinality Constraints: Theory and Practice. Doctoral dissertation, TKK Dissertations in Information and Computer Science TKK-ICS-D12, Helsinki University of Technology, Department of Information and Computer Science (2009)
Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: STOC, pp. 137–146 (1982)
Wu, X., Wu, Y., Wang, Y., Li, Y.: Privacy aware market basket data set generation: A feasible approach for inverse frequent set mining. In: Proc. 5th SIAM International Conference on Data Mining (2005)
Zhang, X., Ozsoyoglu, Z.M.: Implication and referential constraints: A new formal reasoning. IEEE Trans. on Knowledge and Data Engineering 9, 894–910 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saccà, D., Serra, E., Guzzo, A. (2012). Count Constraints and the Inverse OLAP Problem: Definition, Complexity and a Step toward Aggregate Data Exchange. In: Lukasiewicz, T., Sali, A. (eds) Foundations of Information and Knowledge Systems. FoIKS 2012. Lecture Notes in Computer Science, vol 7153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28472-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-28472-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28471-7
Online ISBN: 978-3-642-28472-4
eBook Packages: Computer ScienceComputer Science (R0)