{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T09:42:00Z","timestamp":1767865320601,"version":"3.49.0"},"reference-count":36,"publisher":"Hindawi Limited","issue":"7","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":8400,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Intell. Syst."],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1002\/int.4550070703","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T18:47:28Z","timestamp":1183920448000},"page":"591-607","source":"Crossref","is-referenced-by-count":65,"title":["Discovering functional and inclusion dependencies in relational databases"],"prefix":"10.1155","volume":"7","author":[{"given":"Martti","family":"Kantola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kari-Jouko","family":"R\u00e4ih\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harri","family":"Siirtola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"98","reference":[{"key":"10.1002\/int.4550070703-BIB1","author":"Date","year":"1981","unstructured":"Referential integrity, In Proceedings of the 7th International Conference on Very Large Data Bases (VLDB'81), IEEE, 1981, pp. 2\u201312."},{"key":"10.1002\/int.4550070703-BIB2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0022-0000(84)90075-8","volume":"28","author":"Casanova","year":"1984","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1002\/int.4550070703-BIB3","volume-title":"Handbook of Relational Database Design","author":"Fleming","year":"1989","unstructured":"and , Handbook of Relational Database Design, Addison-Wesley, Reading, MA, 1989."},{"key":"10.1002\/int.4550070703-BIB4","author":"Fagin","year":"1982","unstructured":"Armstrong Databases, Research Report RJ3440, IBM, San Jose, CA, May 1982."},{"key":"10.1002\/int.4550070703-BIB5","author":"Markowitz","year":"1989","unstructured":"and , On the correctness of representing extended entity-relationship structures in the relational model, In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD'89), ACM, 1989, pp. 430\u2013439."},{"key":"10.1002\/int.4550070703-BIB6","author":"Markowitz","year":"1989","unstructured":"and , Name assignment techniques for relational schemas representing extended entity-relationship schemas. In Proceedings of the 8th International Conference on Entity-Relationship Approach, Frederick H. Lo-chovsky, (Ed.), October 1989, pp. 21\u201339."},{"key":"10.1002\/int.4550070703-BIB7","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(86)90015-2","volume":"33","author":"Mannila","year":"1986","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1002\/int.4550070703-BIB8","author":"Mannila","year":"1989","unstructured":"and , Practical algorithms for finding prime attributes and testing normal forms, In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'89), ACM, 1989, pp. 128\u2013133."},{"key":"10.1002\/int.4550070703-BIB9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1147\/rd.281.0082","volume":"28","author":"Casanova","year":"1984","journal-title":"IBM Journal of Research and Development"},{"key":"10.1002\/int.4550070703-BIB10","author":"Mannila","year":"1990","unstructured":"and , A mapping from relational database schemas to ER-diagrams using inclusion dependencies, April 1990."},{"key":"10.1002\/int.4550070703-BIB11","author":"Kantola","year":"1991","unstructured":", , , and , Design-By-Example: A tool for database design; user guide for version 3.0, November 1991."},{"key":"10.1002\/int.4550070703-BIB12","author":"Mannila","year":"1991","unstructured":"and , On the complexity of inferring functional dependencies, Discrete Applied Mathematics, (1991)."},{"key":"10.1002\/int.4550070703-BIB13","volume-title":"The Design of Relational Databases","author":"Mannila","year":"1992","unstructured":"and , The Design of Relational Databases, Addison-Wesley, 1992, to be published."},{"key":"10.1002\/int.4550070703-BIB14","author":"Mannila","year":"1987","unstructured":"and , Dependency inference, In Proceedings of the 13th International Conference on Very Large Data Bases (VLDB'87), September 1987, pp. 155\u2013158."},{"key":"10.1002\/int.4550070703-BIB15","first-page":"273","volume":"8","author":"Demetrovics","year":"1988","journal-title":"Acta Cybernetica"},{"key":"10.1002\/int.4550070703-BIB16","first-page":"279","volume":"8","author":"Demetrovics","year":"1988","journal-title":"Acta Cybernetica"},{"key":"10.1002\/int.4550070703-BIB17","volume-title":"Hypergraphs. Combinatorics of Finite Sets","author":"Berge","year":"1989","unstructured":"Hypergraphs. Combinatorics of Finite Sets. North-Holland, Amsterdam, 1989."},{"key":"10.1002\/int.4550070703-BIB18","author":"Eiter","year":"1991","unstructured":"and , Identifying the Minimal Transversals of a Hypergraph and Related Problems, Technical Report CD-TR 91\/16, Technische Universit\u00e4t Wien, January 1991."},{"key":"10.1002\/int.4550070703-BIB19","author":"Mannila","year":"1988","unstructured":"and , Algorithms for dependency inference, Report A-1988-3, University of Tampere, Department of Computer Science, Tampere, Finland, February 1988."},{"key":"10.1002\/int.4550070703-BIB20","author":"Bitton","year":"1989","unstructured":", and , A feasibility and performance study of dependency inference, In Proceedings of the 5th International Conference on Data Engineering, 1989."},{"key":"10.1002\/int.4550070703-BIB21","author":"Mannila","year":"1991","unstructured":"and , Algorithms for inferring functional dependencies, Report C-1991-41, University of Helsinki, Department of Computer Science, Helsinki, Finland, August 1991."},{"key":"10.1002\/int.4550070703-BIB22","author":"Kivinen","year":"1991","unstructured":"and , Approximate dependency inference, manuscript. 1991."},{"key":"10.1002\/int.4550070703-BIB23","author":"Dechter","year":"1987","unstructured":"Decomposing an n-ary relation into a tree of binary relations, In Proceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'87), ACM, March 1987, pp. 185\u2013189."},{"key":"10.1002\/int.4550070703-BIB24","author":"Siegel","year":"1986","unstructured":"Automatic Rule Deriuation for Semantic Query Optimization, Technical Report BUCS Tech Report #86-013, Boston University, Computer Science Department, December 1986."},{"key":"10.1002\/int.4550070703-BIB25","author":"Russell","year":"1989","unstructured":"The Use of Knowledge in Analogy and Induction, Morgan Kaufmann, San Mateo, CA, 1989."},{"key":"10.1002\/int.4550070703-BIB26","author":"Schlimmer","year":"1991","unstructured":"Learning determinations and checking databases, In Proceedings of 1991 AAAI Workshop on Knowledge Discovery in Databases, G. Piatetsky-Shapiro (Ed.), 1991, pp. 64\u201376."},{"key":"10.1002\/int.4550070703-BIB27","first-page":"547","volume-title":"AAAI-91, Proceedings, 9th National Conference on Artificial Intelligence","author":"Almuallim","year":"1991","unstructured":"and , Learning with many irrelevant features, In AAAI-91, Proceedings, 9th National Conference on Artificial Intelligence, AAAI Press\/The MIT Press, Cambridge, 1991, pp. 547\u2013552."},{"key":"10.1002\/int.4550070703-BIB28","author":"Delgrande","year":"1987","unstructured":"Formal bounds on the automatic generation and maintenance of integrity constraints, In Proceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'87), ACM, March 1987, pp. 190\u2013196."},{"key":"10.1002\/int.4550070703-BIB29","author":"Borgida","year":"1985","unstructured":"and , Accommodating exceptions in databases, and refining the schema by learning from them, In Proceedings of the 11th International Conference on Very Large Data Bases (VLDB'85), August 1985, pp. 72\u201382."},{"key":"10.1002\/int.4550070703-BIB30","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-1-4612-4980-1_23","volume-title":"On Knowledge Base Management Systems","author":"Borgida","year":"1986","unstructured":", and , Learning improved integrity constraints and schemas from exceptions in data and knowledge bases, In On Knowledge Base Management Systems, and (Eds.), Springer-Verlag, 1986, pp. 259\u2013286."},{"key":"10.1002\/int.4550070703-BIB31","author":"Castellanos","year":"1991","unstructured":"and , Semantic enrichment of database schemas: an object-oriented approach, manuscript, 1991."},{"key":"10.1002\/int.4550070703-BIB32","author":"Tseng","year":"1988","unstructured":"and , Inferring database requirements from examples in forms, In Proceedings of the 7th International Conference on Entity-Relationship Approach, C. Batini (Ed.), November 1988, pp. 255\u2013265."},{"key":"10.1002\/int.4550070703-BIB33","author":"Piatetsky-Shapiro","year":"1989","unstructured":"Discovery and analysis of strong rules in databases, In Advanced Database Systems Symposium, Kyoto, Japan, 1989, pp. 135\u2013142."},{"key":"10.1002\/int.4550070703-BIB34","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/69.91060","volume":"3","author":"Yasdi","year":"1991","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1002\/int.4550070703-BIB35","volume-title":"Proceedings of 1991 AAAI Workshop on Knowledge Discovery in Databases","author":"Piatetsky-Shapiro","year":"1991","unstructured":"(Ed.), Proceedings of 1991 AAAI Workshop on Knowledge Discovery in Databases, American Association for Artificial Intelligence, July 1991."},{"key":"10.1002\/int.4550070703-BIB36","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1109\/FSCS.1990.89537","volume-title":"Proceedings, 31st Annual Symposium on Foundations of Computer Science","author":"Angluin","year":"1990","unstructured":", and , Learning conjunctions of Horn clauses, In Proceedings, 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 186\u2013191."}],"container-title":["International Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fint.4550070703","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/int.4550070703","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T15:33:33Z","timestamp":1675956813000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/int.4550070703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1992,9]]}},"URL":"https:\/\/doi.org\/10.1002\/int.4550070703","relation":{},"ISSN":["0884-8173","1098-111X"],"issn-type":[{"value":"0884-8173","type":"print"},{"value":"1098-111X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}