{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:53:48Z","timestamp":1743054828409,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258374"},{"type":"electronic","value":"9783642258381"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25838-1_2","type":"book-chapter","created":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T11:44:19Z","timestamp":1328787859000},"page":"27-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Concise and Exact Representation of Data Cubes"],"prefix":"10.1007","author":[{"given":"Hanen","family":"Brahmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tarek","family":"Hamrouni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riadh","family":"Ben Messaoud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadok","family":"Ben Yahia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,10]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of the ACM-SIGMOD International Conference on Management of Data, Washington, USA, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"2_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB 1994), Santiago, Chile, pp. 478\u2013499 (1994)"},{"key":"2_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic - CL 2000","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 972\u2013986. Springer, Heidelberg (2000)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Ben Messaoud, R., Rabas\u00e9da, S.L., Boussaid, O., Missaoui, R.: Enhanced Mining of Association Rules from Data Cubes. In: Proceedings of the 9th ACM International Workshop on Data Warehousing and OLAP, Arlington, Virginia, USA, pp. 11\u201318 (2006)","DOI":"10.1145\/1183512.1183517"},{"issue":"4","key":"2_CR5","doi-asserted-by":"crossref","first-page":"633","DOI":"10.3233\/IDA-2009-0384","volume":"13","author":"S. Ben Yahia","year":"2009","unstructured":"Ben Yahia, S., Gasmi, G., Mephu Nguifo, E.: A New Generic Basis of Factual and Implicative Association Rules. Intelligent Data Analysis (IDA)\u00a013(4), 633\u2013656 (2009)","journal-title":"Intelligent Data Analysis (IDA)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Beyer, K., Ramakrishnan, R.: Bottom-Up Computation of Sparse and Iceberg CUBEs. In: Proceedings of the 1999 ACM-SIGMOD International Conference on Management of Data (SIGMOD 1999), Philadelphia, Pennsylvania, USA, pp. 359\u2013370 (1999)","DOI":"10.1145\/304182.304214"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-03348-3_9","volume-title":"Advanced Data Mining and Applications","author":"H. Brahmi","year":"2009","unstructured":"Brahmi, H., Hamrouni, T., Ben Messaoud, R., Ben Yahia, S.: Closed Non Derivable Data Cubes Based on Non Derivable Minimal Generators. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds.) ADMA 2009. LNCS, vol.\u00a05678, pp. 55\u201366. Springer, Heidelberg (2009)"},{"key":"2_CR8","unstructured":"Brahmi, H., Hamrouni, T., Messaoud, R.B., Yahia, S.B.: CND-Cube: Nouvelle Repr\u00e9sentation Concise Sans Perte d\u2019Information d\u2019un Cube de Donn\u00e9es. In: Proceedings of the French-Speaking Conference on Knowledge Extraction and Management (EGC 2010), Hammamet, Tunisia, pp. 261\u2013272 (2010)"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10618-006-0054-6","volume":"14","author":"T. Calders","year":"2007","unstructured":"Calders, T., Goethals, B.: Non-Derivable Itemset Mining. Data Mining and Knowledge Discovery\u00a014(1), 171\u2013206 (2007)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Casali, A., Cicchetti, R., Lakhal, L.: Cube Lattices: A Framework for Multidimensional Data Mining. In: Proceedings of the 3rd SIAM International Conference on Data Mining, San Francisco, USA, pp. 304\u2013308 (2003a)","DOI":"10.1137\/1.9781611972733.35"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Casali, A., Cicchetti, R., Lakhal, L.: Extracting Semantics from Data Cubes using Cube Transversals and Closures. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, USA, pp. 69\u201378 (2003b)","DOI":"10.1145\/956750.956762"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-0-387-87431-9_7","volume":"3","author":"A. Casali","year":"2009","unstructured":"Casali, A., Cicchetti, R., Lakhal, L.: Closed Cubes Lattices. Annals of Information Systems\u00a03, 145\u2013165 (2009a); Special Issue on New Trends in Data Warehousing and Data Analysis","journal-title":"Annals of Information Systems"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.4018\/jdwm.2009010102","volume":"4","author":"A. Casali","year":"2009","unstructured":"Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L., Novelli, N.: Lossless Reduction of Datacubes Using Partitions. International Journal of Data Warehousing and Mining (IJDWM)\u00a04(1), 18\u201335 (2009b)","journal-title":"International Journal of Data Warehousing and Mining (IJDWM)"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/248603.248616","volume":"26","author":"S. Chaudhuri","year":"1997","unstructured":"Chaudhuri, S., Dayal, U.: An Overview of Data Warehousing and OLAP Technology. SIGMOD Record\u00a026(1), 65\u201374 (1997)","journal-title":"SIGMOD Record"},{"key":"2_CR15","unstructured":"Galambos, J., Simonelli, I.: Bonferroni-type Inequalities with Applications. Springer (2000)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer (1999)","DOI":"10.1007\/978-3-642-59830-2"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009726021843","volume":"1","author":"J. Gray","year":"1997","unstructured":"Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M.: Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab, and Sub Totals. Data Mining and Knowledge Discovery\u00a01(1), 29\u201353 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2_CR18","unstructured":"Ji, L., Tan, K.-L., Tung, A.K.H.: Mining Frequent Closed Cubes in 3D Datasets. In: Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB 2006), Seoul, Korea, pp. 811\u2013822 (2006)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L., Pei, J., Han, J.: Quotient Cube: How to Summarize the Semantics of a Data Cube. In: CAiSE 2002 and VLDB 2002, pp. 778\u2013789 (2002)","DOI":"10.1016\/B978-155860869-6\/50074-3"},{"key":"2_CR20","unstructured":"Morfonios, K., Ioannidis, Y.E.: Cure for Cubes: Cubing Using a ROLAP Engine. In: Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, pp. 379\u2013390 (2006)"},{"key":"2_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/11871637_61","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"J. Muhonen","year":"2006","unstructured":"Muhonen, J., Toivonen, H.: Closed Non-Derivable Itemsets. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 601\u2013608. Springer, Heidelberg (2006)"},{"key":"2_CR22","unstructured":"Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L.: Cube Ferm\u00e9s\/ Quotients \u00c9mergents. In: Proceedings of the French-Speaking Conference on Knowledge Extraction and Management (EGC 2010), Hammamet, Tunisia, pp. 285\u2013296 (2010)"},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules Using Closed Itemset Lattices. Journal of Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Journal of Information Systems"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Pedersen, T., Jensen, C., Dyreson, C.: Supporting Imprecision in Multidimensional Databases Using Granularities. In: Proceedings of the 11th International Conference on Scientific and Statistical Database Management (SSDBM 1999), Cleveland, Ohio, USA, pp. 90\u2013101 (1999)","DOI":"10.1109\/SSDM.1999.787624"},{"key":"2_CR25","unstructured":"Ross, K., Srivastava, D.: Fast Computation of Sparse Data Cubes. In: Proceedings of the 23rd International Conference on Very Large Databases (VLDB 1997), Athens, Greece, pp. 116\u2013125 (1997)"},{"key":"2_CR26","unstructured":"Shao, Z., Han, J., Xin, D.: MM-Cubing: Computing Iceberg Cubes by Factorizing the Lattice Space. In: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), Washington, DC, USA, pp. 213\u2013222 (2004)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Sismanis, Y., Deligiannakis, A., Roussopoulos, N., Kotidis, Y.: Dwarf: Shrinking the Petacube. In: Proceedings of the 2002 ACM-SIGMOD International Conference on Management of Data (SIGMOD 2002), Madison, USA, pp. 464\u2013475 (2002)","DOI":"10.1145\/564691.564745"},{"issue":"42","key":"2_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"2","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing Iceberg Concept Lattices with Titanic. Journal on Knowledge and Data Engineering (KDE)\u00a02(42), 189\u2013222 (2002)","journal-title":"Journal on Knowledge and Data Engineering (KDE)"},{"key":"2_CR29","unstructured":"Wang, M., Iyer, B.: Efficient Roll-Up and Drill-Down Analysis in Relational Databases. In: Proceedings of the Workshop on Research Issues on Data Mining and Knowledge Discovery (SIGMOD 1997), Tucson, Arizona, pp. 39\u201343 (1997)"},{"key":"2_CR30","unstructured":"Wang, W., Lu, H., Feng, J., Yu, J.: Condensed Cube: An Effective Approach to Reducing Data Cube Size. In: Proceedings of the 18th International Conference on Data Engineering (ICDE 2002), San Jose, USA, pp. 213\u2013222 (2002)"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Xin, D., Han, J., Li, X., Wah, B.: Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration. In: Proceedings of the 29th International Conference on Very Large Data Bases (VLDB 2003), Berlin, Germany, pp. 476\u2013487 (2003)","DOI":"10.1016\/B978-012722442-8\/50049-5"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Yannis, S., Nick, R.: The Polynomial Complexity of Fully Materialized Coalesced Cubes. In: Proceedings of the 13th International Conference on Very Large Data Bases, Toronto, Canada, pp. 540\u2013551 (2004)","DOI":"10.1016\/B978-012088469-8.50049-8"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Deshpande, P., Naughton, J.: An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. In: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data (SIGMOD 1997), Tucson, Arizona, United States, pp. 159\u2013170 (1997)","DOI":"10.1145\/253262.253288"}],"container-title":["Studies in Computational Intelligence","Advances in Knowledge Discovery and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25838-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T03:29:23Z","timestamp":1742441363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-25838-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258374","9783642258381"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25838-1_2","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"10 February 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}