Count constraints and the inverse OLAP problem: Definition, complexity and a step toward aggregate data exchange

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7153 LNCS, Issue , 2012, Pages 352-369

  Saccà, Domenico ^a   Serra, Edoardo ^a   Guzzo, Antonella ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Count Constraints; Data Exchange; Database Integrity Check; Inverse Data Mining; NEXP; OLAP; Star Schema

Indexed keywords

COUNT CONSTRAINTS; DATABASE INTEGRITY CHECK; NEXP; OLAP; STAR SCHEMA;

DATABASE SYSTEMS; ELECTRONIC DATA INTERCHANGE; INVERSE PROBLEMS; STARS;

AGGREGATES;

EID: 84858017008     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28472-4_20     Document Type: Conference Paper

References (29)

1. Afrati, F.N., Kolaitis, P.G.: Answering aggregate queries in data exchange. In: PODS, pp. 129-138 (2008)
2. Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: SIGMOD Conference, pp. 207-216 (1993)
3. Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: ACM SIGMOD, pp. 439-450 (2000)
4. 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)
5. Arenas, M., Barcel, P., Fagin, R., Libkin, L.: Locally consistent transformations and query answering in data exchange. In: PODS 2004, pp. 229-240 (2004)
6. Beeri, C., Vardi, M.Y.: Polynomial-time implication problems for unary inclusion dependencies. J. of the ACM 37, 15-46 (1990)
7. 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)
8. Calders, T.: Computational complexity of itemset frequency satisfiability. In: PODS, pp. 143-154 (2004)
9. Calders, T.: The complexity of satisfying constraints on databases of transactions. Acta Inf. 44(7-8), 591-624 (2007)
10. Chaudhuri, S., Dayal, U.: An overview of data warehousing and olap technology. SIGMOD Record 26(1), 65-74 (1997)
11. 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)
12. 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)
13. 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)
14. Fagin, R., Kolaitis, P.G., Popa, L.: Data exchange: getting to the core. ACM Trans. Database Syst. 30(1), 174-210 (2005)
15. Golfarelli, M., Rizzi, S.: Data Warehouse Design: Modern Principles and Methodologies. Mac Graw Hill (2009)
16. 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
17. Kolaitis, P.G., Papadimitriou, C.H.: Why not negation by fixpoint? In: PODS, pp. 231-239 (1988)
18. Lenzerini, M.: Data integration: A theoretical perspective. In: PODS, pp. 233-246 (2002)
19. Lo, E., Cheng, N., Hon, W.-K.: Generating databases for query workloads. Proc. VLDB Endow. 3, 848-859 (2010)
20. 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)
21. Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1994)
22. Papadimitriou, C.H., Yannakakis, M.: A note on succinct representations of graphs. Information and Control 71(3), 181-185 (1986)
23. Ramesh, G., Maniatty, W., Zaki, M.J.: Feasible itemset distributions in data mining: theory and application. In: PODS, pp. 284-295 (2003)
24. Rosati, R.: On the decidability and finite controllability of query processing in databases with incomplete information. In: PODS, pp. 356-365 (2006)
25. Saccà, D., Guzzo, A., Serra, E.: Appendix to this paper (2012), http://sacca.deis.unical.it/#view=object&format=object&id=960/gid=160
26. 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)
27. Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: STOC, pp. 137-146 (1982)
28. 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)
29. Zhang, X., Ozsoyoglu, Z.M.: Implication and referential constraints: A new formal reasoning. IEEE Trans. on Knowledge and Data Engineering 9, 894-910 (1997)