{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:16:44Z","timestamp":1777130204147,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540414568","type":"print"},{"value":"9783540445036","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44503-x_13","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:25:32Z","timestamp":1186892732000},"page":"189-203","source":"Crossref","is-referenced-by-count":66,"title":["FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies"],"prefix":"10.1007","author":[{"given":"No\u00ebl","family":"Novelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosine","family":"Cicchetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"key":"13_CR1","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining, pages 307\u2013328, 1996."},{"key":"13_CR2","unstructured":"R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules. In Proc. VLDB\u201994, pages 487\u2013499, Santiago, Chile, September 1994."},{"key":"13_CR3","unstructured":"W.W. Armstrong. Dependency Structures of Database Relationships. In Proc. IFIP Conf., pages 580\u2013583, Amsterdam, The Netherlands, 1974. North-Holland."},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/320610.320620","volume":"5","author":"W.W. Armstrong","year":"1980","unstructured":"W.W. Armstrong and C. Delobel. Decompositions and Functional Dependencies in Relations. ACM TODS, 5(4):404\u2013430, Dec 1980.","journal-title":"ACM TODS"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/320064.320066","volume":"4","author":"C. Beeri","year":"1979","unstructured":"C. Beeri and P.A. Bernstein. Computational Problems Related to the Design of Normal Form Relational Schemas. ACM TODS, 4(1):30\u201359, 1979.","journal-title":"ACM TODS"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/2422.322414","volume":"31","author":"C. Beeri","year":"1984","unstructured":"C. Beeri, M. Dowd, R. Fagin, and R. Statman. On the Structure of Armstrong Relations for Functional Dependencies. Journal of the ACM, 31(1):30\u201346, 1984.","journal-title":"Journal of the ACM"},{"key":"13_CR7","unstructured":"G. Birkhoff. Lattices Theory. Coll. Pub. XXV, vol. 25, 3rd edition, 1967."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"D. Bitton, J. Millman, and S. Torgersen. A Feasability and Performance Study of Dependency Inference. In Proc. ICDE\u201989, pages 635\u2013641, 1989.","DOI":"10.1109\/ICDE.1989.47271"},{"issue":"1","key":"13_CR9","first-page":"4","volume":"21","author":"S. Chaudhuri","year":"1998","unstructured":"S. Chaudhuri. Data Mining and Database Systems: Where is the Intersection? Data Engineering Bulletin, 21(1):4\u20138, 1998.","journal-title":"Data Engineering Bulletin"},{"issue":"12","key":"13_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0169-023X(94)90011-6","volume":"10","author":"R.H.L. Chiang","year":"1994","unstructured":"R.H.L. Chiang, T.M. Barron, and V.C. Storey. Reverse Engineering of Relational Databases: Extraction of an EER Model from a Relational Database. DKE, 10(12):107\u2013142, 1994.","journal-title":"DKE"},{"key":"13_CR11","unstructured":"E.F. Codd. Further Normalization of the Data Base Model. Technical Report 909, IBM, 1971."},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0022-0000(86)90019-X","volume":"33","author":"S.S. Cosmadakis","year":"1986","unstructured":"S.S. Cosmadakis, P.C. Kanellakis, and N. Spyratos. Partition Semantics for Relations. Journal of Computer and System Sciences, 33(2):203\u2013233, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(83)90007-5","volume":"24","author":"P.C. Fisher","year":"1983","unstructured":"P.C. Fisher, J.H. Hou, and D.M. Tsou. Succinctness in Dependency Systems. TCS, 24:323\u2013329, 1983.","journal-title":"TCS"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"G. Gottlob. Computing Covers for Embedded Functional Dependencies. In Proc. ACM-SIGACT-SIGMOD-SIGART\u201987, pages 58\u201369, San Diego, US, 1987.","DOI":"10.1145\/28659.28665"},{"issue":"4","key":"13_CR15","first-page":"385","volume":"9","author":"G. Gottlob","year":"1990","unstructured":"G. Gottlob and L. Libkin. Investigations on Armstrong Relations, Dependency Inference, and Excluded Functional Dependencies. Acta Cybernetica, 9(4):385\u2013402, 1990.","journal-title":"Acta Cybernetica"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"J. Gryz. Query Folding with Inclusion Dependencies. In Proc. ICDE\u201998, pages 126\u2013133, Orlando, US, Feb 1998.","DOI":"10.1109\/ICDE.1998.655768"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Y. Huhtala, J. Karkkainen, P. Porkka, and H. Toivonen. Efficient Discovery of Functional and Appproximate Dependencies. In Proc. ICDE\u201998, pages 392\u2013401, Orlando, US, Feb 1998.","DOI":"10.1109\/ICDE.1998.655802"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y. Huhtala","year":"1999","unstructured":"Y. Huhtala, J. Karkkainen, P. Porkka, and H. Toivonen. TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The Computer Journal, 42(2):100\u2013111, 1999.","journal-title":"The Computer Journal"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1002\/int.4550070703","volume":"7","author":"M. Kantola","year":"1992","unstructured":"M. Kantola, H. Mannila, K.R. R\u00e4ih\u00e4, and H. Siirtola. Discovering Functional and Inclusion Dependencies in Relational Databases. International Journal of Intelligent Systems, 7:591\u2013607, 1992.","journal-title":"International Journal of Intelligent Systems"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","volume":"149","author":"J. Kivinen","year":"1995","unstructured":"J. Kivinen and H. Mannila. Approximate Dependency Inference from Relations. TCS, 149(1):129\u2013149, 1995.","journal-title":"TCS"},{"key":"13_CR21","first-page":"181","volume":"12","author":"M. Levene","year":"1995","unstructured":"M. Levene. A Lattice View of Functional Dependencies in Incomplete Relations. Acta Cyberbernetica, 12:181\u2013207, 1995.","journal-title":"Acta Cyberbernetica"},{"issue":"1\u20132","key":"13_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0304-3975(98)80029-7","volume":"206","author":"M. Levene","year":"1998","unstructured":"M. Levene and G. Loizou. Axiomatisation of Functional Dependencies in Incomplete Relations. TCS, 206(1\u20132):283\u2013300, 1998.","journal-title":"TCS"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/310701.310712","volume":"24","author":"M. Levene","year":"1999","unstructured":"M. Levene and G. Loizou. Database Design for Incomplete Relations. ACM TODS, 24(1):80\u2013125, 1999.","journal-title":"ACM TODS"},{"key":"13_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-85729-349-7","volume-title":"A Guided Tour of Relational Databases and Beyond","author":"M. Levene","year":"1999","unstructured":"M. Levene and G. Loizou. A Guided Tour of Relational Databases and Beyond. Springer-Verlag, London, 1999."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"S. Lopes, J.M. Petit, and L. Lakhal. Efficient Discovery of Functional Dependencies and Armstrong Relations. In Proc. EDBT\u201900, pages 350\u2013364, 2000.","DOI":"10.1007\/3-540-46439-5_24"},{"issue":"2","key":"13_CR26","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(86)90015-2","volume":"33","author":"H. Mannila","year":"1986","unstructured":"H. Mannila and K.J. R\u00e4ih\u00e4. Design by Example: An Application of Armstrong Relations. Journal of Computer and System Sciences, 33(2):126\u2013141, Oct 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-218X(92)90031-5","volume":"40","author":"H. Mannila","year":"1992","unstructured":"H. Mannila and K.J. R\u00e4ih\u00e4. On the Complexity of Inferring Functional Dependencies. Discrete Applied Mathematics, 40:237\u2013243, 1992.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0169-023X(94)90023-X","volume":"12","author":"H. Mannila","year":"1994","unstructured":"H. Mannila and K.J. R\u00e4ih\u00e4. Algorithms for Inferring Functional Dependencies from Relations. DKE, 12(1):83\u201399, 1994.","journal-title":"DKE"},{"key":"13_CR29","unstructured":"H. Mannila and K.J. R\u00e4ih\u00e4. The Design of Relational Databases. Addison Wesley, 1994."},{"issue":"3","key":"13_CR30","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 1(3):241\u2013258, 1997.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"8","key":"13_CR31","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/32.57618","volume":"16","author":"V.M. Markowitz","year":"1990","unstructured":"V.M. Markowitz and J.A. Makowsky. Identifying Extended Entity-Relationship Object Structure in Relational Schemas. IEEE Transactions on Software Engineering, 16(8):777\u2013790, August 1990.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"13_CR32","series-title":"Lect Notes Comput Sci","first-page":"398","volume-title":"Discovering Frequent Closed Itemsets for Association Rules","author":"N. Pasquier","year":"1998","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering Frequent Closed Itemsets for Association Rules. In Proc. ICDT\u201999, LNCS, Vol. 1540, Springer Verlag, pages 398\u2013416, Jan 1999."},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"J.M. Petit, F. Toumani, J.F. Boulicaut, and J. Kouloumdjian. Towards the Reverse Engineering of Denormalized Relational Databases. In Proc. ICDE\u201996, pages 218\u2013227, Feb 1996.","DOI":"10.1109\/ICDE.1996.492110"},{"key":"13_CR34","unstructured":"X. Qian. Query Folding. In Proc. ICDE\u201996, pages 48\u201355, Feb 1996."},{"key":"13_CR35","unstructured":"I. Savnik and P.A. Flach. Bottom-up Induction of Functional Dependencies from Relations. In Proc. AAAI\u201993, pages 174\u2013185, 1993."},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"A.M. Silva and M.A. Melkanoff. A Method for Helping Discover the Dependencies of a Relation, pages 115\u2013133. Plenum. Advances in Data Base Theory, 1981.","DOI":"10.1007\/978-1-4615-8297-7_5"},{"issue":"1","key":"13_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/12047.22718","volume":"12","author":"N. Spyratos","year":"1987","unstructured":"N. Spyratos. The Partition Model: a Deductive Database Model. ACM TODS, 12(1):1\u201337, 1987.","journal-title":"ACM TODS"},{"issue":"4","key":"13_CR38","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1145\/278245.278247","volume":"22","author":"Z. Tari","year":"1997","unstructured":"Z. Tari, J. Stokes, and S. Spaccapietra. Object Normal Forms and Dependency Constraints for Object-Oriented Schemata. ACM TODS, 22(4):513\u2013569, Dec 1997.","journal-title":"ACM TODS"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44503-X_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:37:57Z","timestamp":1737362277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44503-X_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540414568","9783540445036"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-44503-x_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}