{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:55:35Z","timestamp":1725544535039},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332923"},{"type":"electronic","value":"9783540332930"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11733492_7","type":"book-chapter","created":{"date-parts":[[2006,3,4]],"date-time":"2006-03-04T06:29:53Z","timestamp":1141453793000},"page":"104-123","source":"Crossref","is-referenced-by-count":4,"title":["Towards Mining Frequent Queries in Star Schemes"],"prefix":"10.1007","author":[{"given":"Tao-Yuan","family":"Jen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Spyratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oumar","family":"Sy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 309\u2013328. AAAI-MIT Press (1996)"},{"key":"7_CR2","first-page":"580","volume-title":"IFIP Congress","author":"W.W. Armstrong","year":"1974","unstructured":"Armstrong, W.W.: Dependency structures of data base relationships. In: IFIP Congress, pp. 580\u2013583. North-Holland, Amsterdam (1974)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Casali, A., Cichetti, R., Lakhal, L.: Extracting semantics from data cubes using cube transversals and closures. In: ACM KDD, pp. 69\u201378 (2003)","DOI":"10.1145\/956750.956762"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3540635149_40","volume-title":"Inductive Logic Programming","author":"L. Dehaspe","year":"1997","unstructured":"Dehaspe, L., De Raedt, L.: Mining association rules in multiple relations. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297, pp. 125\u2013132. Springer, Heidelberg (1997)"},{"key":"7_CR5","unstructured":"Diop, C.T.: Etude et mise en oeuvre des aspects itratifs de l\u2019extraction de rgles d\u2019association dans une base de donnes. PhD thesis, Universit de Tours, France (2003)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-45876-X_9","volume-title":"Advances in Database Technology - EDBT 2002","author":"C.T. Diop","year":"2002","unstructured":"Diop, C.T., Giacometti, A., Laurent, D., Spyratos, N.: Composition of mining contexts for efficient extraction of association rules. In: Jensen, C.S., Jeffery, K., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, pp. 106\u2013123. Springer, Heidelberg (2002)"},{"key":"7_CR7","unstructured":"Faye, A., Giacometti, A., Laurent, D., Spyratos, N.: Mining rules in databases with multiple tables: Problems and perspectives. In: 3rd International Conference on Computing Anticipatory Systems (CASYS) (1999)"},{"key":"7_CR8","unstructured":"Giacometti, A., Laurent, D., Diop, C.T., Spyratos, N.: Mining from views: An incremental approach. International Journal Information Theories & Applications 9 (See also RR LI\/E3i, Univ. de Tours) (2002)"},{"key":"7_CR9","unstructured":"Goethals, B.: Mining queries (unpublished paper). In: Workshop on inductive databases and constraint based mining (2004), Available at \n                    \n                      http:\/\/www.informatik.unifreiburg.de\/~ml\/IDB\/talks\/Goethalsslides.pdf"},{"key":"7_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45728-3_10","volume-title":"Pattern Detection and Discovery","author":"B. Goethals","year":"2002","unstructured":"Goethals, B., Van den Bussche, J.: Relational association rules: getting warmer. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery. LNCS (LNAI), vol.\u00a02447, pp. 125\u2013139. Springer, Heidelberg (2002)"},{"key":"7_CR11","unstructured":"Han, J., Fu, Y., Wang, W., Koperski, K., Zaiane, O.: Dmql: A data mining query language for relational databases. In: SIGMOD-DMKD 1996, pp. 27\u201334 (1996)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery\u00a08, 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"5","key":"7_CR13","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1080\/0020716031000079509","volume":"80","author":"D. Laurent","year":"2003","unstructured":"Laurent, D., Luong, V.P., Spyratos, N.: Querying weak instances under extension chase semantics. Intl. Journal of Comp. Mathematics\u00a080(5), 591\u2013613 (2003)","journal-title":"Intl. Journal of Comp. Mathematics"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0306-4379(02)00021-2","volume":"28","author":"M. Levene","year":"2003","unstructured":"Levene, M., Loizou, G.: Why is the snowflake schema a good data warehouse design? Information Systems\u00a028(3), 225\u2013240 (2003)","journal-title":"Information Systems"},{"key":"7_CR15","first-page":"275","volume":"9","author":"R. Meo","year":"1997","unstructured":"Meo, R., Psaila, G., Ceri, S.: An extension to sql for mining association rules. Data Mining and Knowledge Discovery\u00a09, 275\u2013300 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"7_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-39804-2_42","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"T. Turmeaux","year":"2003","unstructured":"Turmeaux, T., Salleb, A., Vrain, C., Cassard, D.: Learning characteristic rules relying on quantified paths. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 471\u2013482. Springer, Heidelberg (2003)"},{"key":"7_CR17","unstructured":"Ullman, J.D.: Principles of Databases and Knowledge-Base Systems, vol.\u00a01. Computer Science Press (1988)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Inductive Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11733492_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T00:21:52Z","timestamp":1552350112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11733492_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332923","9783540332930"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11733492_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}