{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:57:29Z","timestamp":1750309049267,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":30,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3216122.3216129","type":"proceedings-article","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T16:26:42Z","timestamp":1531240002000},"page":"148-156","source":"Crossref","is-referenced-by-count":0,"title":["The Inverse Tree-OLAP Problem"],"prefix":"10.1145","author":[{"given":"Domenico","family":"Sacc\u00e0","sequence":"first","affiliation":[{"name":"University of Calabria, Rende, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edoardo","family":"Serra","sequence":"additional","affiliation":[{"name":"Boise State University, Boise, ID, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Cuzzocrea","sequence":"additional","affiliation":[{"name":"University of Trieste and ICAR-CNR, Trieste, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3216122.3216129-1","doi-asserted-by":"crossref","unstructured":"Rakesh Agrawal, Tomasz Imielinski, and Arun N. Swami. 1993. Mining Association Rules between Sets of Items in Large Databases. In SIGMOD Conference, Peter Buneman and Sushil Jajodia (Eds.). ACM Press, 207--216.","DOI":"10.1145\/170035.170072"},{"key":"key-10.1145\/3216122.3216129-2","doi-asserted-by":"crossref","unstructured":"Arvind Arasu, Raghav Kaushik, and Jian Li. 2011. Data generation using declarative constraints. In Proceedings of the 2011 international conference on Management of data (SIGMOD '11). ACM, New York, NY, USA, 685--696.","DOI":"10.1145\/1989323.1989395"},{"key":"key-10.1145\/3216122.3216129-3","doi-asserted-by":"crossref","unstructured":"Catriel Beeri and Moshe Y. Vardi. 1990. Polynomial-time implication problems for unary inclusion dependencies. J. of the ACM 37 (1990), 15--46.","DOI":"10.1145\/78935.78937"},{"key":"key-10.1145\/3216122.3216129-4","doi-asserted-by":"crossref","unstructured":"Carsten Binnig, Donald Kossmann, Eric Lo, and M. Tamer Özsu. 2007. QAGen: generating query-aware test databases. In Proceedings of the 2007 ACM SIGMOD international conference on Management of data (SIGMOD '07). ACM, New York, NY, USA, 341--352.","DOI":"10.1145\/1247480.1247520"},{"key":"key-10.1145\/3216122.3216129-5","unstructured":"Toon Calders. 2007. The complexity of satisfying constraints on databases of transactions. Acta Inf. 44, 7-8 (2007), 591--624."},{"key":"key-10.1145\/3216122.3216129-6","doi-asserted-by":"crossref","unstructured":"Rick Cattell. 2010. Scalable SQL and NoSQL data stores. SIGMOD Record 39, 4 (2010), 12--27.","DOI":"10.1145\/1978915.1978919"},{"key":"key-10.1145\/3216122.3216129-7","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri and Umeshwar Dayal. 1997. An Overview of Data Warehousing and OLAP Technology. SIGMOD Record 26, 1 (1997), 65--74.","DOI":"10.1145\/248603.248616"},{"key":"key-10.1145\/3216122.3216129-8","unstructured":"George B. Dantzig and Mukund N. Thapa. 2006. Linear Programming 2: Theory and Extensions. Springer-Verlag."},{"key":"key-10.1145\/3216122.3216129-9","doi-asserted-by":"crossref","unstructured":"Jeffrey Dean and Sanjay Ghemawat. 2008. MapReduce: simplified data processing on large clusters. Commun. ACM 51, 1 (Jan. 2008), 107--113. https:\/\/doi.org\/10.1145\/1327452.1327492","DOI":"10.1145\/1327452.1327492"},{"key":"key-10.1145\/3216122.3216129-10","doi-asserted-by":"crossref","unstructured":"Ronald Fagin, Phokion G. Kolaitis, Renee J. Miller, and Lucian Popa. 2003. Data Exchange: Semantics and Query Answering. In In ICDT. 207--224.","DOI":"10.1007\/3-540-36285-1_14"},{"key":"key-10.1145\/3216122.3216129-11","unstructured":"Matteo Golfarelli, Dario Maio, and Stefano Rizzi. 1998. The Dimensional Fact Model: A Conceptual Model for Data Warehouses. Int. J. Cooperative Inf. Syst. 7, 2-3 (1998), 215--247."},{"key":"key-10.1145\/3216122.3216129-12","unstructured":"Matteo Golfarelli and Stefano Rizzi. 2009. Data Warehouse Design: Modern Principles and Methodologies. Mac Graw Hill."},{"key":"key-10.1145\/3216122.3216129-13","doi-asserted-by":"crossref","unstructured":"Bernardo Cuenca Grau, Ian Horrocks, Boris Motik, Bijan Parsia, Peter Patel-Schneider, and Ulrike Sattler. 2008. OWL 2: The next step for OWL. Journal of Web Semantics: Science, Services and Agents on the World Wide Web 6, 4 (2008), 309--322.","DOI":"10.1016\/j.websem.2008.05.001"},{"key":"key-10.1145\/3216122.3216129-14","doi-asserted-by":"crossref","unstructured":"Antonella Guzzo, Luigi Moccia, Domenico Saccà, and Edoardo Serra. 2013. Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs. TKDD 7, 4 (2013), 18:1--18:39. https:\/\/doi.org\/10.1145\/2541268.2541271","DOI":"10.1145\/2541268.2541271"},{"key":"key-10.1145\/3216122.3216129-15","doi-asserted-by":"crossref","unstructured":"Jiawei Han, Hong Cheng, Dong Xin, and Xifeng Yan. 2007. Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15, 1 (2007), 55--86.","DOI":"10.1007\/s10618-006-0059-1"},{"key":"key-10.1145\/3216122.3216129-16","unstructured":"Ralph Kimball. 1996. The Data Warehouse Toolkit: Practical Techniques for Building Dimensional Data Warehouses. John Wiley & Sons."},{"key":"key-10.1145\/3216122.3216129-17","doi-asserted-by":"crossref","unstructured":"Eric Lo, Nick Cheng, and Wing-Kai Hon. 2010. Generating databases for query workloads. Proc. VLDB Endow. 3 (September 2010), 848--859. Issue 1--2. http:\/\/dl.acm.org\/citation.cfm?id=1920841.1920950","DOI":"10.14778\/1920841.1920950"},{"key":"key-10.1145\/3216122.3216129-18","unstructured":"Svetlana Mansmann, Nafees Ur Rehman, Andreas Weiler, and Marc H. Scholl. 2012. Discovering OLAP dimensions in semi-structured data, See [25], 9--16."},{"key":"key-10.1145\/3216122.3216129-19","unstructured":"T. Mielikainen. 2003. On inverse frequent set mining. In Proc. of 2nd Workshop on Privacy Preserving Data Mining (PPDM), IEEE Computer Society (Ed.). 18--23."},{"key":"key-10.1145\/3216122.3216129-20","doi-asserted-by":"crossref","unstructured":"Bernd Neumayr, Stefan Anderlik, and Michael Schrefl. 2012. Towards ontology-based OLAP: datalog-based reasoning over multidimensional ontologies, See [25], 41--48.","DOI":"10.1145\/2390045.2390053"},{"key":"key-10.1145\/3216122.3216129-21","unstructured":"Christos H. Papadimitriou. 1994. Computational complexity. Addison-Wesley, Reading, Massachusetts."},{"key":"key-10.1145\/3216122.3216129-22","doi-asserted-by":"crossref","unstructured":"Ganesh Ramesh, William Maniatty, and Mohammed Javeed Zaki. 2003. Feasible itemset distributions in data mining: theory and application. In PODS. 284--295.","DOI":"10.1145\/773153.773181"},{"key":"key-10.1145\/3216122.3216129-23","doi-asserted-by":"crossref","unstructured":"Riccardo Rosati. 2006. On the Decidability and Finite Controllability of Query Processing in Databases with Incomplete Information. In PODS. 356--365.","DOI":"10.1145\/1142351.1142404"},{"key":"key-10.1145\/3216122.3216129-24","unstructured":"Domenico Saccà, Edoardo Serra, and Antonella Guzzo. 2012. Count Constraints and the Inverse OLAP Problem: Definition, Complexity and a Step toward Aggregate Data Exchange. In FoIKS. 352--369."},{"key":"key-10.1145\/3216122.3216129-25","unstructured":"Il-Yeol Song and Matteo Golfarelli (Eds.). 2012. DOLAP 2012, ACM 15th International Workshop on Data Warehousing and OLAP, Maui, HI, USA, November 2, 2012, Proceedings. ACM."},{"key":"key-10.1145\/3216122.3216129-26","unstructured":"Tommi Syrjänen. 2009. 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."},{"key":"key-10.1145\/3216122.3216129-27","unstructured":"Stephan Tobies. 2001. Complexity Results and Practical Algorithms for Logics in Knowledge Representation. CoRR cs.LO\/0106031 (2001). http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr0106.html#cs-LO-0106031"},{"key":"key-10.1145\/3216122.3216129-28","unstructured":"Gerhard Weikum. 2013. Where's the Data in the Big Data Wave?. Website. ACM Sigmod BLOG: http:\/\/wp.sigmod.org\/?p=786."},{"key":"key-10.1145\/3216122.3216129-29","doi-asserted-by":"crossref","unstructured":"Xintao Wu, Ying Wu, Yongge Wang, and Yingjiu Li. 2005. Privacy Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining. In Proc. 5th SIAM International Conference on Data Mining.","DOI":"10.1137\/1.9781611972757.10"},{"key":"key-10.1145\/3216122.3216129-30","doi-asserted-by":"crossref","unstructured":"Xubo Zhang and Z. Meral Ozsoyoglu. 1997. Implication and referential constraints: A new formal reasoning. IEEE Trans. on Knowledge and Data Engineering 9 (1997), 894--910.","DOI":"10.1109\/69.649315"}],"event":{"number":"22","sponsor":["Concordia University"],"acronym":"IDEAS 2018","name":"the 22nd International Database Engineering & Applications Symposium","start":{"date-parts":[[2018,6,18]]},"location":"Villa San Giovanni, Italy","end":{"date-parts":[[2018,6,20]]}},"container-title":["Proceedings of the 22nd International Database Engineering & Applications Symposium on - IDEAS 2018"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3216122.3216129","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3216129&ftid=1986367&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:29:34Z","timestamp":1750285774000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3216122.3216129"}},"subtitle":["Definitions, Models, Complexity Analysis, and a Possible Solution"],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1145\/3216122.3216129","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}