{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:57:28Z","timestamp":1648943848110},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,5,17]],"date-time":"2012-05-17T00:00:00Z","timestamp":1337212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s00778-012-0277-7","type":"journal-article","created":{"date-parts":[[2012,5,16]],"date-time":"2012-05-16T13:42:54Z","timestamp":1337175774000},"page":"125-150","source":"Crossref","is-referenced-by-count":3,"title":["Mining frequent conjunctive queries using functional and inclusion dependencies"],"prefix":"10.1007","volume":"22","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"}]},{"given":"Nicolas","family":"Spyratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,17]]},"reference":[{"key":"277_CR1","first-page":"309","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: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (Eds.) Advances in Knowledge Discovery and Data Mining., pp. 309\u2013328. AAAI-MIT Press, Manlo Park, CA (1996)"},{"key":"277_CR2","unstructured":"Armstrong, W.: Dependency structures of data base relationships. In: IFIP Congress, pp. 580\u2013583. North Holland (1974)"},{"key":"277_CR3","doi-asserted-by":"crossref","unstructured":"Bohannon, P., Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for data cleaning. In: ICDE, pp. 746\u2013755 (2007)","DOI":"10.1109\/ICDE.2007.367920"},{"issue":"1","key":"277_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0022-0000(84)90075-8","volume":"28","author":"M.A. Casanova","year":"1984","unstructured":"Casanova M.A., Fagin R., Papadimitriou C.H.: Inclusion dependencies and their interaction with functional dependencies. J. Comput. Syst. Sci. 28(1), 29\u201359 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"277_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10844-007-0048-x","volume":"32","author":"F. De Marchi","year":"2009","unstructured":"De Marchi F., Lopes S., Petit J.-M.: Unary and n-ary inclusion dependency discovery in relational databases. J. Intell. Inf. Syst. 32(1), 53\u201373 (2009)","journal-title":"J. Intell. Inf. Syst."},{"key":"277_CR6","doi-asserted-by":"crossref","unstructured":"Dehaspe, L., Raedt, L.D.: Mining association rules in multiple relations. In: 7th International Workshop on Inductive Logic Programming, vol. 1297 of LNCS, pp. 125\u2013132. Springer (1997)","DOI":"10.1007\/3540635149_40"},{"key":"277_CR7","doi-asserted-by":"crossref","unstructured":"Dieng, C.-T., Jen, T.-Y., Laurent, D.: An efficient computation of frequent queries in a star schema. In: DEXA 2010, vol. 6262(II) of LNCS, pp. 225\u2013239. Springer (2010)","DOI":"10.1007\/978-3-642-15251-1_18"},{"key":"277_CR8","doi-asserted-by":"crossref","unstructured":"Diop, C., Giacometti, A., Laurent, D., Spyratos, N. Composition of mining contexts for efficient extraction of association rules. In: EDBT\u201902, vol. 2287 of LNCS, pp. 106\u2013123. Springer (2002)","DOI":"10.1007\/3-540-45876-X_9"},{"issue":"5","key":"277_CR9","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1109\/TKDE.2010.154","volume":"23","author":"W. Fan","year":"2011","unstructured":"Fan W., Geerts F., Li J., Xiong M.: Discovering conditional functional dependencies. IEEE Trans. Knowl. Data Eng. 23(5), 683\u2013698 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"277_CR10","unstructured":"Faye, A., Giacometti, A., Laurent, D., Spyratos, N.: Mining rules in databases with multiple tables: problems and perspectives. In: Proceedings of the 3rd International Conference on Computing Anticipatory Systems (CASYS) (1999)"},{"key":"277_CR11","doi-asserted-by":"crossref","unstructured":"Goethals, B., den Bussche, J.V.: Relational association rules: getting warmer. In: ESF Exploratory Workshop on Pattern Detection and Discovery in Data Mining, vol. 2447 of LNCS, pp. 125\u2013139. Springer (2002)","DOI":"10.1007\/3-540-45728-3_10"},{"key":"277_CR12","doi-asserted-by":"crossref","unstructured":"Goethals, B., Hoekx, E., den Bussche, J.V.: Mining tree queries in a graph. In: Proceedings of 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 61\u201369 (2005)","DOI":"10.1145\/1081870.1081881"},{"key":"277_CR13","doi-asserted-by":"crossref","unstructured":"Goethals, B., Laurent, D., Page, W.L.: Discovery and application of functional dependencies in conjunctive query mining. In: DAWAK 2010, vol. 6263 of LNCS, pp. 142\u2013156. Springer (2010)","DOI":"10.1007\/978-3-642-15105-7_12"},{"key":"277_CR14","doi-asserted-by":"crossref","unstructured":"Goethals, B., Page, W.L., Mapaey, M.: Mining interesting sets and rules in relational databases. In: ACM SAC, pp. 997\u20131001. ACM Press (2010)","DOI":"10.1145\/1774088.1774299"},{"key":"277_CR15","doi-asserted-by":"crossref","unstructured":"Goethals, B., Page, W.L., Mannila, H.: Mining association rules of simple conjunctive queries. In: SIAM-SDM, pp. 96\u2013107 (2008)","DOI":"10.1137\/1.9781611972788.9"},{"key":"277_CR16","unstructured":"Han, J., Fu, Y., Wang, W., Koperski, K., Zaiane, O.: Dmql : a data mining query language for relational databases. In:SIGMOD-DMKD\u201996, pp. 27\u201334 (1996)"},{"key":"277_CR17","doi-asserted-by":"crossref","unstructured":"Jen, T.-Y., Laurent, D., Spyratos, N.: Mining all frequent selection-projection queries from a relational table. In: EDBT\u201908, pp. 368\u2013379. ACM Press (2008)","DOI":"10.1145\/1353343.1353390"},{"key":"277_CR18","doi-asserted-by":"crossref","unstructured":"Jen, T.-Y., Laurent, D., Spyratos, N.: Mining frequent conjunctive queries in star schemas. In: Proceedings of the International Database Engineering and Applications Symposium (IDEAS), pp. 97\u2013108. ACM Press (2009)","DOI":"10.1145\/1620432.1620443"},{"issue":"3","key":"277_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.3233\/FI-2010-249","volume":"99","author":"T.-Y. Jen","year":"2010","unstructured":"Jen T.-Y., Laurent D., Spyratos N.: Computing supports of conjunctive queries on relational tables with functional dependencies. Fundamenta Informaticae 99(3), 263\u2013292 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"277_CR20","doi-asserted-by":"crossref","unstructured":"Jen, T.-Y., Laurent, D., Spyratos, N., Sy, O.: Towards mining frequent queries in star schemes. In: International Workshop on Knowledge Discovery in Databases (KDID), vol. 3933 of LNCS, pp. 104\u2013123. Springer (2005)","DOI":"10.1007\/11733492_7"},{"key":"277_CR21","doi-asserted-by":"crossref","unstructured":"Jen, T.-Y., Taouil, R., Laurent, D.: A dichotomous algorithm for association rule mining. In: International workshop Grid and Peer-to-Peer Computing Impacts on Large Scale Heterogeneous Distributed Database Systems (GLOBE), in conjunction with International conference on DEXA, pp. 567\u2013571. IEEE Press (2004)","DOI":"10.1109\/DEXA.2004.1333535"},{"key":"277_CR22","volume-title":"The Data Warehouse Toolkit","author":"R. Kimball","year":"1996","unstructured":"Kimball R.: The Data Warehouse Toolkit. Wiley, New York (1996)"},{"key":"277_CR23","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/S0304-3975(00)00394-7","volume":"254","author":"M. Levene","year":"2001","unstructured":"Levene M., Loizou G.: Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies. Theor. Comput. Sci. 254, 683\u2013690 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"277_CR24","doi-asserted-by":"crossref","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?. Inf. Syst. 28(3), 225\u2013240 (2003)","journal-title":"Inf. Syst."},{"issue":"2\u20133","key":"277_CR25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/09528130210164143","volume":"14","author":"S. Lopes","year":"2002","unstructured":"Lopes S., Petit J.-M., Lakhal L.: Functional and approximative dependency mining: database and FCA points of view. J. Exp. Theor. Artif. Intell. 14(2\u20133), 93\u2013114 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"277_CR26","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 Min. Knowl. Discov. 9, 275\u2013300 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"277_CR27","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S0019-9958(83)80002-3","volume":"56","author":"J.C. Mitchell","year":"1983","unstructured":"Mitchell J.C.: The implication problem for functional dependencies and inclusion dependencies. Inf. Control 56, 154\u2013173 (1983)","journal-title":"Inf. Control"},{"key":"277_CR28","doi-asserted-by":"crossref","unstructured":"Turmeaux, T., Salleb, A., Vrain, C., Cassard, D.: Learning characteristic rules relying on quantified paths. In: PKDD, vol. 2838 of LNCS, pp. 471\u2013482. Springer (2003)","DOI":"10.1007\/978-3-540-39804-2_42"},{"key":"277_CR29","volume-title":"Principles of Databases and Knowledge-Base Systems, vol. 1","author":"J. Ullman","year":"1988","unstructured":"Ullman J.: Principles of Databases and Knowledge-Base Systems, vol. 1. Computer Science Press, Rockville, MD (1988)"},{"issue":"2","key":"277_CR30","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10618-007-0083-9","volume":"16","author":"H. Yao","year":"2008","unstructured":"Yao H., Hamilton H.J.: Mining functional dependencies from data. Data Min. Knowl. Discov. 16(2), 197\u2013219 (2008)","journal-title":"Data Min. Knowl. Discov."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0277-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-012-0277-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0277-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T19:19:16Z","timestamp":1594149556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-012-0277-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,17]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["277"],"URL":"https:\/\/doi.org\/10.1007\/s00778-012-0277-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,17]]}}}