{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T15:04:16Z","timestamp":1784819056037,"version":"3.55.0"},"reference-count":114,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T00:00:00Z","timestamp":1784764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"3IA C\u00f4te d\u2019Azur Investments in the IA-cluster project","award":["ANR-23-IACL-0001"],"award-info":[{"award-number":["ANR-23-IACL-0001"]}]},{"name":"Hi! PARIS and ANR\/France 2030 program","award":["ANR-23-IACL-0005"],"award-info":[{"award-number":["ANR-23-IACL-0005"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2026,10,31]]},"abstract":"<jats:p>First-Order Tuple-Generating Dependencies (TGDs) are general constraints on databases that subsume Horn rules, foreign key constraints, and inclusion dependencies. We introduce an approach to automatically mine these dependencies from a given database, subject to a number of constraints. Our method employs tailored pruning techniques and a graph representation to deal with the exponential size of the search space. It can mine both exact and approximate rules by employing support and confidence metrics. Experiments on various benchmark datasets demonstrate that (1) our approach can find all inclusion dependencies and Horn rules that competing approaches find, (2) it scales to databases that are out of reach for competing approaches, and (3) it finds a small portion of more complex patterns (TGDs with multiple atoms in the rule head) that other methods cannot find by design. Overall, MATILDA mines about 50% more joinable patterns than competing systems across 35 benchmark databases while keeping runtimes competitive (sub-second to a few minutes depending on the database size).<\/jats:p>","DOI":"10.1145\/3815190","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T14:55:31Z","timestamp":1778856931000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["MATILDA: Mining Approximate Tuple-Generating Dependencies in Large Databases"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9614-8493","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Amat","sequence":"first","affiliation":[{"name":"T\u00e9l\u00e9com Paris and Institut Polytechnique de Paris, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9665-1187","authenticated-orcid":false,"given":"Pierre-Henri","family":"Paris","sequence":"additional","affiliation":[{"name":"Laboratoire Interdisciplinaire des Sciences du Num\u00e9rique (LISN), Paris-Saclay University, CNRS, Orsay, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0651-4128","authenticated-orcid":false,"given":"Paolo","family":"Papotti","sequence":"additional","affiliation":[{"name":"EURECOM, Biot, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7189-2796","authenticated-orcid":false,"given":"Fabian M.","family":"Suchanek","sequence":"additional","affiliation":[{"name":"T\u00e9l\u00e9com Paris and Institut Polytechnique de Paris, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,23]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90070-1"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00871824"},{"key":"e_1_3_2_5_2","volume-title":"International Conference on Extending Database Technology (EDBT)","author":"de Marchi F.","year":"2002","unstructured":"F. de Marchi, S. Rizzi, and G. Psaila. 2002. Efficient algorithms for mining inclusion dependencies. In International Conference on Extending Database Technology (EDBT)."},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-39940-9_980","article-title":"FOL modeling of integrity constraints (dependencies).","author":"Deutsch A.","year":"2009","unstructured":"A. Deutsch. 2009. FOL modeling of integrity constraints (dependencies). In Encyclopedia of Database Systems (2nd ed.).","journal-title":"Encyclopedia of Database Systems"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0357-y"},{"issue":"3","key":"e_1_3_2_8_2","first-page":"2049","article-title":"A novel integration of data-driven rule generation and computational argumentation for enhanced explainable AI","volume":"6","author":"Agostini A.","year":"2024","unstructured":"A. Agostini, D. Verda, S. Berretta, and L. Longo. 2024. A novel integration of data-driven rule generation and computational argumentation for enhanced explainable AI. Journal of AI Research 6, 3 (2024), 2049\u20132073.","journal-title":"Journal of AI Research"},{"key":"e_1_3_2_9_2","volume-title":"27th International Conference on Neural Information Processing Systems (NIPS)","author":"Bordes A.","year":"2013","unstructured":"A. Bordes, N. Usunier, A. Garcia-Duran, J. Weston, and O. Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In 27th International Conference on Neural Information Processing Systems (NIPS)."},{"key":"e_1_3_2_10_2","article-title":"Taming the infinite chase: Query answering under expressive relational, constraints","author":"Cal A.","year":"2008","unstructured":"A. Cal, G. Gottlob, and T. Lukasiewicz. 2008. Taming the infinite chase: Query answering under expressive relational, constraints. In Knowledge Representation and Reasoning.","journal-title":"In Knowledge Representation and Reasoning"},{"issue":"4","key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1007\/s10994-020-05934-z","article-title":"Learning programs by learning from failures","volume":"110","author":"Cropper A.","year":"2020","unstructured":"A. Cropper and R. Morel. 2020. Learning programs by learning from failures. Machine Learning 110, 4 (2021), 801\u2013856.","journal-title":"Machine Learning"},{"key":"e_1_3_2_12_2","volume-title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI \u201920)","author":"Cropper A.","year":"2020","unstructured":"A. Cropper, S. Duman\u010di\u0107, and S. H. Muggleton. 2020. Turning 30: New ideas in inductive logic programming. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI \u201920)."},{"key":"e_1_3_2_13_2","first-page":"301","volume-title":"Proceedings of the VLDB Endowment","volume":"7","author":"Heise A.","year":"2013","unstructured":"A. Heise, J.-A. Quian\u00e9-Ruiz, Z. Abedjan, A. Jentzsch, and F. Naumann. 2013. Scalable discovery of unique column combinations. Proceedings of the VLDB Endowment 7, 4 (2013), 301\u2013312."},{"issue":"2","key":"e_1_3_2_14_2","first-page":"315","article-title":"2020. A schema integration approach for big data analysis","volume":"28","author":"Ouaddah A.","year":"2023","unstructured":"A. Ouaddah, F. Ait Lahcen, and A. Mouline. 2020. A schema integration approach for big data analysis. International Journal of Intelligent Systems and Applications 28, 2 (2023), 315\u2013323.","journal-title":"International Journal of Intelligent Systems and Applications"},{"key":"e_1_3_2_15_2","article-title":"A machine learning approach to foreign key discovery","author":"Rostin A.","year":"2009","unstructured":"A. Rostin, O. Albrecht, J. Bauckmann, F. Naumann, and U. Leser. 2009. A machine learning approach to foreign key discovery. In International Workshop on the Web and Databases (WebDB).","journal-title":"International Workshop on the Web and Databases (WebDB)"},{"key":"e_1_3_2_16_2","unstructured":"A. Sharma and E. Kiciman. 2020. DoWhy: An end-to-end library for causal inference. arXiv:2011.04216. Retrieved from https:\/\/arxiv.org\/abs\/2011.04216"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.procs.2016.03.029","article-title":"Mining of association rules on large database using distributed and parallel computing","volume":"79","author":"Vasoya A.","year":"2016","unstructured":"A. Vasoya and N. Koli. 2016. Mining of association rules on large database using distributed and parallel computing. Procedia Computer Science 79 (2016), 589\u2013597.","journal-title":"Procedia Computer Science"},{"key":"e_1_3_2_18_2","article-title":"PKDD\u201999 discovery challenge\u2014Financial domain","author":"Levin B.","year":"1999","unstructured":"B. Levin, R. Pieraccini, and W. Eckert. 1999. PKDD\u201999 discovery challenge\u2014Financial domain. In Workshop Notes on Discovery Challenge.","journal-title":"In Workshop Notes on Discovery Challenge"},{"issue":"2","key":"e_1_3_2_19_2","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10618-021-00806-z","article-title":"INK: Knowledge graph embeddings for node classification","volume":"36","author":"Steenwinckel B.","year":"2022","unstructured":"B. Steenwinckel, F. Ongenae, and F. De Turck. 2022. INK: Knowledge graph embeddings for node classification. Data Mining and Knowledge Discovery 36, 2 (2022), 491\u2013522.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"e_1_3_2_20_2","volume-title":"ACM SIGMOD International Conference on Management of Data","author":"Beeri C.","year":"1977","unstructured":"C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. 1977. A complete axiomatization for functional and multivalued dependencies in database relations. In ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/1643275.1643300"},{"key":"e_1_3_2_22_2","volume-title":"International Joint Conference on Artificial Intelligence","author":"Meilicke C.","year":"2019","unstructured":"C. Meilicke, M. W. Chekol, D. Ruffinelli, and H. Stuckenschmidt. 2019. Anytime bottom-up rule learning for knowledge graph completion. In International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_23_2","article-title":"An introduction to AnyBURL","author":"Meilicke C.","year":"2019","unstructured":"C. Meilicke, M. W. Chekol, and H. Stuckenschmidt. 2019. An introduction to AnyBURL. In Advances in Artificial Intelligence.","journal-title":"In Advances in Artificial Intelligence"},{"key":"e_1_3_2_24_2","unstructured":"D. Arpit M. Fernandez I. Feigenbaum W. Yao C. Liu W. Yang P. Josel S. Heinecke E. Hu H. Wang et al. 2023. Salesforce CausalAI library: A fast and scalable framework for causal analysis of time series and tabular data. arXiv:2301.10859. Retrieved from https:\/\/arxiv.org\/abs\/2301.10859"},{"key":"e_1_3_2_25_2","article-title":"SAKey: Scalable almost key discovery in RDF data","author":"Symeonidou D.","year":"2014","unstructured":"D. Symeonidou, V. Armant, N. Pernelle, and F. Sa\u00efs. 2014. SAKey: Scalable almost key discovery in RDF data. In International Semantic Web Conference.","journal-title":"In International Semantic Web Conference"},{"key":"e_1_3_2_26_2","article-title":"VICKEY: Mining conditional keys on knowledge bases","author":"Symeonidou D.","year":"2017","unstructured":"D. Symeonidou, V. Armant, N. Pernelle, and F. Sa\u00efs. 2017. VICKEY: Mining conditional keys on knowledge bases. In International Workshop on the Semantic Web.","journal-title":"In International Workshop on the Semantic Web"},{"issue":"4","key":"e_1_3_2_27_2","first-page":"760","article-title":"Competent triple identification for knowledge graph completion under the open-world assumption","volume":"105","author":"Farjana E.","year":"2022","unstructured":"E. Farjana, N. Kertkeidkachorn, and R. Ichise. 2022. Competent triple identification for knowledge graph completion under the open-world assumption. IEICE Transactions on Information and Systems E105.D, 4 (2022), 760\u2013769.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368293"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.14778\/3503585.3503595"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574254"},{"key":"e_1_3_2_31_2","doi-asserted-by":"crossref","DOI":"10.35717\/9781789001068","volume-title":"International Conference on Management of Data","author":"Zhu E.","year":"2019","unstructured":"E. Zhu, Y. He, and S. Chaudhuri. 2019. JOSIE: Overlap set similarity search for finding joinable tables, in data lakes. In International Conference on Management of Data."},{"key":"e_1_3_2_32_2","volume-title":"ACM International Conference on Information and Knowledge Management","author":"Dursch F.","year":"2019","unstructured":"F. Dursch, J. Steeg, J. Bauckmann, F. Naumann, and U. Leser. 2019. Inclusion dependency discovery: An experimental evaluation of thirteen algorithms. ACM International Conference on Information and Knowledge Management."},{"key":"e_1_3_2_33_2","article-title":"Knowledge representation and rule mining in entity-centric knowledge bases","author":"Suchanek F.","year":"2019","unstructured":"F. Suchanek, G. Kasneci, and G. Weikum. 2019. Knowledge representation and rule mining in entity-centric knowledge bases. In RW Invited Paper.","journal-title":"In RW Invited Paper"},{"key":"e_1_3_2_34_2","unstructured":"F. Yang Z. Yang and W. W. Cohen. 2017. Differentiable learning of logical rules for knowledge base completion. arXiv:1702.08367. Retrieved from https:\/\/arxiv.org\/abs\/1702.08367"},{"key":"e_1_3_2_35_2","volume-title":"In ACM SIGMOD International Conference on Management of Data","author":"Mecca G.","year":"2009","unstructured":"G. Mecca, P. Papotti, and S. Raunich. 2009. Core schema mappings. In ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_3_2_36_2","article-title":"Efficient algorithms for discovering association rules","author":"Mannila H.","year":"1994","unstructured":"H. Mannila, H. Toivonen, and A. I. Verkamo. 1994. Efficient algorithms for discovering association rules. In AAAI Workshop on Knowledge Discovery in Databases (KDD).","journal-title":"In AAAI Workshop on Knowledge Discovery in Databases (KDD)"},{"key":"e_1_3_2_37_2","first-page":"1678","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"29","author":"Zhang H.","year":"2015","unstructured":"H. Zhang, Y. Zhang, and J.-H. You. 2015. Existential rule languages with finite chase: Complexity and expressiveness. Proceedings of the AAAI Conference on Artificial Intelligence 29, 1 (2015), 1678\u20131684."},{"issue":"5","key":"e_1_3_2_38_2","first-page":"631","article-title":"Characterizing the program expressive power of existential rule languages","volume":"21","author":"Zhang H.","year":"2021","unstructured":"H. Zhang, Y. Zhang, and J.-H. You. 2021. Characterizing the program expressive power of existential rule languages. Theory and Practice of Logic Programming 21, 5 (2021), 631\u2013647.","journal-title":"Theory and Practice of Logic Programming"},{"key":"e_1_3_2_39_2","volume-title":"International Conference on Data Engineering","author":"Bauckmann J.","year":"2007","unstructured":"J. Bauckmann, U. Leser, F. Naumann, and V. Tietz. 2007. Efficiently detecting inclusion dependencies. In International Conference on Data Engineering."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.002"},{"key":"e_1_3_2_41_2","volume-title":"International Joint Conference on Artificial Intelligence","author":"Baget J.","year":"2011","unstructured":"J. Baget, M. Lecl\u00e8re, M.-L. Mugnier, and E. Salvat. 2011. Walking the complexity lines for generalized guarded existential rules. In International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/507515.507523"},{"key":"e_1_3_2_43_2","volume-title":"International Conference on Knowledge Engineering and Knowledge Management (EKAW)","author":"J\u00f8sang J.","year":"2022","unstructured":"J. J\u00f8sang, K. Falkenberg, and M. Huth. 2022. On the effectiveness of knowledge graph embeddings: A rule mining approach. In International Conference on Knowledge Engineering and Knowledge Management (EKAW)."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00676-3"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.197"},{"key":"e_1_3_2_46_2","volume-title":"The Semantic Web","author":"Lajus J.","year":"2020","unstructured":"J. Lajus, L. Gal\u00e1rraga, and F. Suchanek. 2020. Fast and exact rule mining with AMIE 3. In The Semantic Web."},{"key":"e_1_3_2_47_2","unstructured":"J. Motl and O. Schulte. 2015. The CTU prague relational learning repository. In CoRR."},{"key":"e_1_3_2_48_2","article-title":"Foreign key constraint identification in relational databases","author":"Motl J.","year":"2017","unstructured":"J. Motl and P. Kord\u00edk. 2017. Foreign key constraint identification in relational databases. In Information Technologies\u2014Applications and Theory (ITAT).","journal-title":"In Information Technologies\u2014Applications and Theory (ITAT)"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037228"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067422"},{"key":"e_1_3_2_51_2","article-title":"Statistical schema induction","author":"Volker J.","year":"2011","unstructured":"J. Volker and M. Niepert. 2011. Statistical schema induction. In Extended Semantic Web Conference.","journal-title":"In Extended Semantic Web Conference"},{"key":"e_1_3_2_52_2","volume-title":"International Joint Conference on Artificial Intelligence","author":"Wogulis J.","year":"1993","unstructured":"J. Wogulis and P. Langley. 1993. A methodology for evaluating theory revision systems: Results with Audrey II. International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_53_2","volume-title":"International Joint Conference on Artificial Intelligence","author":"Zelle J.","year":"1993","unstructured":"J. Zelle and R. Mooney. 1993. Combining FOIL and EBG to speed-up logic programs. In International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_54_2","volume-title":"International Conference on Machine Learning","author":"Zelle J.","year":"1994","unstructured":"J. Zelle and R. Mooney. 1994. Combining top-down and bottom-up techniques in inductive logic programming. International Conference on Machine Learning."},{"key":"e_1_3_2_55_2","volume-title":"International Joint Conference on Artificial Intelligence","author":"Ali K.","year":"1993","unstructured":"K. Ali and M. J. Pazzani. 1993. HYDRA: A noise-tolerant relational concept learning algorithm. In International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_56_2","first-page":"2439","volume-title":"Proceedings of the VLDB Endowment","volume":"15","author":"Bellomarini L.","year":"2022","unstructured":"L. Bellomarini, D. Benedetto, M. Brandetti, and E. Sallinger. 2022. Exploiting the power of equality-generating dependencies in ontological reasoning. Proceedings of the VLDB Endowment 15, 11 (2022), 2439\u20132451."},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2472010"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2967722"},{"key":"e_1_3_2_59_2","volume-title":"Workshop on Automated Knowledge Base Construction","author":"Galarraga L.","year":"2013","unstructured":"L. Galarraga, C. Teflioudi, K. Hose, and F. Suchanek. 2013. Mining rules to align knowledge bases. In Workshop on Automated Knowledge Base Construction."},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0394-1"},{"key":"e_1_3_2_61_2","volume-title":"IEEE International Conference on Advanced Computing (IACC)","author":"Greeshma L.","year":"2016","unstructured":"L. Greeshma, P. S. Aithal, and K. R. Venugopal. 2016. Unique constraint frequent item set mining. In IEEE International Conference on Advanced Computing (IACC)."},{"key":"e_1_3_2_62_2","volume-title":"International Conference on Very Large Data Bases","author":"Popa L.","year":"2002","unstructured":"L. Popa, Y. Velegrakis, R. J. Miller, M. Hernandez, and R. Fagin. 2002. Translating web data. In International Conference on Very Large Data Bases."},{"key":"e_1_3_2_63_2","volume-title":"EKAW: Knowledge Engineering and Knowledge Management","author":"Atencia M.","year":"2012","unstructured":"M. Atencia, J. David Fern\u00e1ndez, and M. A. Mart\u00ednez-Prieto. 2012. Keys and pseudo-keys detection for web datasets cleansing and interlinking. In EKAW: Knowledge Engineering and Knowledge Management."},{"issue":"1","key":"e_1_3_2_64_2","first-page":"107","article-title":"Automated action selection using reinforcement learning","volume":"12","author":"Bowling M.","year":"2006","unstructured":"M. Bowling, P. McCracken, M. Giraud-Carrier, and D. Wilkinson. 2006. Automated action selection using reinforcement learning. Autonomous Agents and Multi-Agent Systems 12, 1 (2006), 107\u2013136.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"e_1_3_2_65_2","unstructured":"M. Doan A. Fariha J. Wang and C. Chen. 2024. Data quality awareness: A journey from traditional data management to data science systems. arXiv:2411.03007. Retrieved from https:\/\/arxiv.org\/abs\/2411.03007"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/588011.588032"},{"key":"e_1_3_2_67_2","volume-title":"International Conference on Machine Learning","author":"Nickel M.","year":"2011","unstructured":"M. Nickel, V. Tresp, and H.-P. Kriegel. 2011. A three-way model for collective learning on multi-relational data. In International Conference on Machine Learning."},{"key":"e_1_3_2_68_2","article-title":"RuleBERT: Teaching soft rules to pre-trained language models","author":"Saeed M.","year":"2021","unstructured":"M. Saeed, S. Ball, and P. Spranger. 2021. RuleBERT: Teaching soft rules to pre-trained language models. In Conference on Empirical Methods in Natural Language Processing.","journal-title":"In Conference on Empirical Methods in Natural Language Processing"},{"key":"e_1_3_2_69_2","volume-title":"IEEE International Conference on Smart Computing (SMARTCOMP)","author":"Shen M.","year":"2022","unstructured":"M. Shen, Y. Jin, and F. Naumann. 2022. Fast accurate discovery of tuple inclusion dependencies. In IEEE International Conference on Smart Computing (SMARTCOMP)."},{"key":"e_1_3_2_70_2","unstructured":"N. Kouagou L. Gal\u00e1rraga and F. Suchanek. 2024. Improving rule mining via embedding-based link prediction."},{"key":"e_1_3_2_71_2","doi-asserted-by":"crossref","DOI":"10.1016\/j.websem.2013.07.001","article-title":"An automatic key discovery approach for data linking","author":"Pernelle N.","year":"2013","unstructured":"N. Pernelle, F. Sa\u00efs, and D. Symeonidou. 2013. An automatic key discovery approach for data linking. Journal of Web Semantics. 2013.","journal-title":"Journal of Web Semantics"},{"key":"e_1_3_2_72_2","volume-title":"International Joint Conference on Neural Networks (IJCNN)","author":"Radulovi\u0107 N.","year":"2021","unstructured":"N. Radulovi\u0107, M. Petrovi\u0107, and Z. Obradovi\u0107. 2021. Confident interpretations of black box classifiers (STACI). In International Joint Conference on Neural Networks (IJCNN)."},{"issue":"1","key":"e_1_3_2_73_2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10619-018-7233-5","article-title":"Incrementally updating unary inclusion dependencies in dynamic data","volume":"37","author":"Shaabani N.","year":"2019","unstructured":"N. Shaabani and C. Meinel. 2019. Incrementally updating unary inclusion dependencies in dynamic data. Distributed and Parallel Databases 37, 1 (2019), 87\u2013122.","journal-title":"Distributed and Parallel Databases"},{"key":"e_1_3_2_74_2","first-page":"695","volume-title":"Proceedings of the VLDB Endowment","volume":"4","author":"Bernstein P. A.","year":"2011","unstructured":"P. A. Bernstein, J. Madhavan, and E. Rahm. 2011. Generic schema matching, ten years later. Proceedings of the VLDB Endowment 4, 11 (2011), 695\u2013701."},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/2976736"},{"key":"e_1_3_2_76_2","unstructured":"P. Blobaum D. Janzing T. G\u00f6tz and B. Sch\u00f6lkopf. 2022. DoWhy-GCM: An extension of DoWhy for causal inference in graphical causal models. arXiv:2206.06821. Retrieved from http:\/\/arxiv.org\/abs\/2206.06821"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"e_1_3_2_78_2","volume-title":"International Database Engineering and Applications Symposium","author":"Wang Q.","year":"2015","unstructured":"Q. Wang, Y. Yu, and L. Chen. 2015. Propagating dependencies under schema mappings: A graph-based approach. In International Database Engineering and Applications Symposium."},{"key":"e_1_3_2_79_2","volume-title":"Report, Nanyang Technological University","author":"Zhao Q.","year":"2003","unstructured":"Q. Zhao and S. S. Bhowmick. 2003. Association Rule Mining: A Survey. Technical Report, Nanyang Technological University."},{"key":"e_1_3_2_80_2","first-page":"197","volume-title":"Proceedings of the VLDB Endowment 8, 3","author":"Zeng Q.","year":"2014","unstructured":"Q. Zeng, Y. Song, H. Wang, M. Zhang, and J. Han. 2014. QuickFOIL: Scalable inductive logic programming. Proceedings of the VLDB Endowment 8, 3 (2014), 197\u2013208."},{"key":"e_1_3_2_81_2","volume-title":"International Conference on Very Large Data Bases","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant. 1994. Fast algorithms for mining association rules in large databases. In International Conference on Very Large Data Bases."},{"key":"e_1_3_2_82_2","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Agrawal R.","year":"1996","unstructured":"R. Agrawal, T. Imieli\u0144ski, and A. Swami. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining."},{"key":"e_1_3_2_83_2","volume-title":"Transactions on Machine Learning Research","author":"Cappuzzo R.","year":"2025","unstructured":"R. Cappuzzo, P. Papotti, and S. Cohen. 2025. Retrieve, merge, predict: Augmenting tables with data lakes. Transactions on Machine Learning Research (2025)."},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.5555\/645505.656440"},{"key":"e_1_3_2_85_2","volume-title":"International Conference on Data Engineering","author":"Fernandez R.","year":"2018","unstructured":"R. Fernandez, Z. Abedjan, F. Koko, M. Interlandi, and V. Madden. 2018. Aurum: A data discovery system. In International Conference on Data Engineering."},{"key":"e_1_3_2_86_2","unstructured":"R. Karegar E. H. M. Pena and F. Naumann. 2021. Efficient discovery of approximate order dependencies. arXiv:2101.02174. Retrieved from https:\/\/arxiv.org\/abs\/2101.02174"},{"key":"e_1_3_2_87_2","volume-title":"International Conference on Database Theory","author":"Pichler R.","year":"2011","unstructured":"R. Pichler, S. Skritek, and S. Szeider. 2011. The complexity of evaluating tuple generating dependencies. In International Conference on Database Theory."},{"key":"e_1_3_2_88_2","first-page":"1907","volume-title":"Proceedings of the VLDB Endowment","volume":"15","author":"Xiao R.","year":"2022","unstructured":"R. Xiao, E. H. M. Pena, and F. Naumann. 2022. Fast approximate denial constraint discovery. Proceedings of the VLDB Endowment 15, 9 (2022), 1907\u20131920."},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_3_2_90_2","first-page":"2795","volume-title":"Proceedings of the VLDB Endowment","volume":"14","author":"Castelo S.","year":"2021","unstructured":"S. Castelo, R. Rampin, A. Santos, A. Bessa, F. Chirigati, and J. Freire. 2021. Auctus: A dataset search engine for data discovery and augmentation. Proceedings of the VLDB Endowment 14, 12 (2021), 2795\u20132798."},{"key":"e_1_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.1109\/69.250076"},{"key":"e_1_3_2_92_2","volume-title":"Neural Information Processing Systems","author":"Kazemi S.","year":"2018","unstructured":"S. Kazemi and D. Poole. 2018. SimplE embedding for link prediction in knowledge graphs. In Neural Information Processing Systems."},{"key":"e_1_3_2_93_2","volume-title":"IEEE International Conference on Data Engineering (ICDE)","author":"Ortona S.","year":"2018","unstructured":"S. Ortona, V. Efthymiou, and P. Papotti. 2018. Robust discovery of positive and negative rules in knowledge bases. In IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_3_2_94_2","first-page":"1946","volume-title":"Proceedings of the VLDB Endowment","volume":"11","author":"Ortona S.","year":"2018","unstructured":"S. Ortona, V. Efthymiou, and P. Papotti. 2018. RuDiK: Rule discovery in knowledge bases. Proceedings of the VLDB Endowment 11, 12 (2018), 1946\u20131949."},{"key":"e_1_3_2_95_2","first-page":"1860","volume-title":"Proceedings of the VLDB Endowment","volume":"8","author":"Papenbrock T.","year":"2015","unstructured":"T. Papenbrock, T. Bergmann, M. Finke, J. Zwiener, and F. Naumann. 2015. Data profiling with metanome. Proceedings of the VLDB Endowment 8, 12 (2015), 1860\u20131863."},{"key":"e_1_3_2_96_2","first-page":"1082","volume-title":"Proceedings of the VLDB Endowment","volume":"8","author":"Papenbrock T.","year":"2015","unstructured":"T. Papenbrock, J. Ehrlich, J. Marten, T. Neubert, J.-P. Rudolph, M. Sch\u00f6nberg, J. Zwiener, and F. Naumann. 2015. Functional dependency discovery: An experimental evaluation of seven algorithms. Proceedings of the VLDB Endowment 8, 10 (2015), 1082\u20131093."},{"key":"e_1_3_2_97_2","volume-title":"Datenbanksysteme f\u00fcr Business, Technologie und Web","author":"Papenbrock T.","year":"2017","unstructured":"T. Papenbrock, J. Zwiener, and F. Naumann. 2017. A hybrid approach for efficient unique column combination discovery. Datenbanksysteme f\u00fcr Business, Technologie und Web."},{"key":"e_1_3_2_98_2","volume-title":"Proceedings of the World Wide Web Conference (WWW)","author":"Soru T.","year":"2015","unstructured":"T. Soru, E. Marx, and A.-C. Ngonga Ngomo. 2015. ROCKER\u2014A refinement operator for key discovery. In Proceedings of the World Wide Web Conference (WWW)."},{"key":"e_1_3_2_99_2","volume-title":"International Conference on Machine Learning","author":"Trouillon T.","year":"2016","unstructured":"T. Trouillon, J. Welbl, S. Riedel, \u00c9. Gaussier, and G. Bouchard. 2016. Complex embeddings for simple link prediction. In International Conference on Machine Learning."},{"key":"e_1_3_2_100_2","first-page":"1498","volume-title":"Proceedings of the VLDB Endowment","volume":"6","author":"Chu X.","year":"2013","unstructured":"X. Chu, I. F. Ilyas, and P. Papotti . 2013. Discovering Denial Constraints. Proceedings of the VLDB Endowment 6, 13 (2013), 1498\u20131509."},{"key":"e_1_3_2_101_2","volume-title":"International Conference on Management of Data","author":"Chen Y.","year":"2016","unstructured":"Y. Chen, D. Xin, and V. Ganti . 2016. Ontological pathfinding. In International Conference on Management of Data."},{"key":"e_1_3_2_102_2","first-page":"3035","volume-title":"Proceedings of the VLDB Endowment","volume":"16","author":"Dong Y.","year":"2023","unstructured":"Y. Dong, C. Xiao, T. Nozawa, M. Enomoto, and M. Oyamada. 2023. DeepJoin: Joinable table discovery with pre-trained language models. Proceedings of the VLDB Endowment 16, 11 (2023), 3035\u20133048."},{"key":"e_1_3_2_103_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.2.100"},{"key":"e_1_3_2_104_2","volume-title":"IEEE International Conference on Data Engineering (ICDE)","author":"Jin Y.","year":"2020","unstructured":"Y. Jin, S. Kruse, and F. Naumann. 2020. Efficient bidirectional order dependency discovery. In IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_3_2_105_2","doi-asserted-by":"publisher","DOI":"10.1145\/3588929"},{"key":"e_1_3_2_106_2","volume-title":"ACM SIGMOD International Conference on Management of Data","author":"Zhang Y.","year":"2020","unstructured":"Y. Zhang, Z. Ives, and B. Glavic. 2020. Finding related tables in data Lakes for interactive data science. In ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_3_2_107_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8870"},{"issue":"6","key":"e_1_3_2_108_2","first-page":"1003","article-title":"Algorithms for the discovery of embedded functional dependencies","volume":"30","author":"Wei Z.","year":"2021","unstructured":"Z. Wei, C. Liu, X. Li, Q. Yin, and J. Wang. 2021. Algorithms for the discovery of embedded functional dependencies. The VLDB Journal 30, 6 (2021), 1003\u20131027.","journal-title":"The VLDB Journal"},{"key":"e_1_3_2_109_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5701"},{"key":"e_1_3_2_110_2","article-title":"Ontology and schema evolution in data integration: Review and assessment","author":"Euzenat J.","year":"2004","unstructured":"J. Euzenat. 2004. Ontology and schema evolution in data integration: Review and assessment. In On the Move to Meaningful Internet Systems.","journal-title":"On the Move to Meaningful Internet Systems"},{"key":"e_1_3_2_111_2","article-title":"FOSSIL: A robust relational learner","author":"F\u00fcrnkranz J.","year":"1994","unstructured":"J. F\u00fcrnkranz. 1994. FOSSIL: A robust relational learner. In European Conference on Machine Learning.","journal-title":"European Conference on Machine Learning"},{"key":"e_1_3_2_112_2","article-title":"CHAPTER 17\u2014Elements of relational database theory","author":"Kanellakis P.","year":"1990","unstructured":"P. Kanellakis. 1990. CHAPTER 17\u2014Elements of relational database theory. In Formal Models and Semantics.","journal-title":"Formal Models and Semantics"},{"key":"e_1_3_2_113_2","volume-title":"Working Conference on Reverse Engineering (WCRE \u201907)","author":"Marinescu C.","year":"2007","unstructured":"C. Marinescu. 2007. Discovering the objectual meaning of foreign key constraints in enterprise applications. In Working Conference on Reverse Engineering (WCRE \u201907)."},{"key":"e_1_3_2_114_2","article-title":"A generalized recurrence for bell numbers","author":"Spivey M.","year":"2008","unstructured":"M. Spivey. 2008. A generalized recurrence for bell numbers. Journal of Integer Sequences 11, 5 (2008).","journal-title":"Journal of Integer Sequences"},{"key":"e_1_3_2_115_2","article-title":"Recent advances in schema and ontology evolution","author":"Thalheim B.","year":"2011","unstructured":"B. Thalheim. 2011. Recent advances in schema and ontology evolution. In Schema Matching and Mapping.","journal-title":"Schema Matching and Mapping"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3815190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T14:32:20Z","timestamp":1784817140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3815190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,23]]},"references-count":114,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,10,31]]}},"alternative-id":["10.1145\/3815190"],"URL":"https:\/\/doi.org\/10.1145\/3815190","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,23]]},"assertion":[{"value":"2025-09-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-07-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}