{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:00:50Z","timestamp":1725562850665},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152504"},{"type":"electronic","value":"9783642152511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15251-1_18","type":"book-chapter","created":{"date-parts":[[2010,8,12]],"date-time":"2010-08-12T10:55:45Z","timestamp":1281610545000},"page":"225-239","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Computation of Frequent Queries in a Star Schema"],"prefix":"10.1007","author":[{"given":"Cheikh Tidiane","family":"Dieng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao-Yuan","family":"Jen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining. MIT Press, Cambridge (1996)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Inductive Logic Programming","author":"L. Dehaspe","year":"1997","unstructured":"Dehaspe, L., Raedt, L.D.: Mining association rules in multiple relations. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297. Springer, Heidelberg (1997)"},{"key":"18_CR3","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. Diop","year":"2002","unstructured":"Diop, C., 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, p. 106. Springer, Heidelberg (2002)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Esposito, R., Meo, R., Botta, M.: Answering constraint-based mining queries on itemsets using previous materialized results. J. of Intelligent Information Systems\u00a026(1) (2006)","DOI":"10.1007\/s10844-006-5453-z"},{"key":"18_CR5","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., den Bussche, J.V.: Relational association rules: getting warmer. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery. LNCS (LNAI), vol.\u00a02447, p. 125. Springer, Heidelberg (2002)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Goethals, B., Hoekx, E., den Bussche, J.V.: Mining tree queries in a graph. In: 11th ACM SIGKDD Intl. Conference on Knowledge Discovery and Data Mining, KDD (2005)","DOI":"10.1145\/1081870.1081881"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Goethals, B., Page, W.L., Mannila, H.: Mining association rules of simple conjunctive queries. In: SIAM (2008)","DOI":"10.1137\/1.9781611972788.9"},{"key":"18_CR8","unstructured":"Han, J., Fu, Y., Wang, W., Koperski, K., Zaiane, O.: Dmql: A data mining query language for relational databases. In: SIGMOD-DMKD 1996 (1996)"},{"key":"18_CR9","volume-title":"EDBT 2008","author":"T.-Y. Jen","year":"2008","unstructured":"Jen, T.-Y., Laurent, D., Spyratos, N.: Mining all frequent selection-projection queries from a relational table. In: EDBT 2008. ACM Press, New York (2008)"},{"key":"18_CR10","unstructured":"Jen, T.-Y., Laurent, D., Spyratos, N.: Mining Frequent Queries in Relational Databases. In: IDEAS. ACM Press, New York (2009)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/11733492_7","volume-title":"Knowledge Discovery in Inductive Databases","author":"T.-Y. Jen","year":"2006","unstructured":"Jen, T.-Y., Laurent, D., Spyratos, N., Sy, O.: Towards mining frequent queries in star schemes. In: Bonchi, F., Boulicaut, J.-F. (eds.) KDID 2005. LNCS, vol.\u00a03933, pp. 104\u2013123. Springer, Heidelberg (2006)"},{"key":"18_CR12","unstructured":"Meo, R., Psaila, G., Ceri, S.: An extension to sql for mining association rules. Data Mining and Knowledge Discovery\u00a09 (1997)"},{"key":"18_CR13","volume-title":"Principles of Databases and Knowledge-Base Systems","author":"J. Ullman","year":"1988","unstructured":"Ullman, J.: Principles of Databases and Knowledge-Base Systems. Comp. Sc. Press, Rockville (1988)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15251-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:03:56Z","timestamp":1606169036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15251-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152504","9783642152511"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15251-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}