{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:46:29Z","timestamp":1773153989568,"version":"3.50.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data &amp; Knowledge Engineering"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0169-023x(94)90023-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T17:15:20Z","timestamp":1047662120000},"page":"83-99","source":"Crossref","is-referenced-by-count":135,"title":["Algorithms for inferring functional dependencies from relations"],"prefix":"10.1016","volume":"12","author":[{"given":"Heikki","family":"Mannila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kari-Jouko","family":"R\u00e4ih\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(94)90023-X_BIB1","series-title":"AAAI-91, Proc. Ninth Nat. Conf. on Artificial Intelligence","first-page":"547","article-title":"Learning with many irrelevant features","author":"Almuallim","year":"1991"},{"key":"10.1016\/0169-023X(94)90023-X_BIB2","series-title":"Information Processing 74, Proc. IFIP Congress 1974","first-page":"580","article-title":"Dependency structures of data base relationships","author":"Armstrong","year":"1974"},{"issue":"1","key":"10.1016\/0169-023X(94)90023-X_BIB3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/2422.322414","article-title":"On the structure of Armstrong relations for functional dependencies","volume":"31","author":"Beeri","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0169-023X(94)90023-X_BIB4","series-title":"Hypergraphs, Combinatorics of Finite Sets","author":"Berge","year":"1989"},{"key":"10.1016\/0169-023X(94)90023-X_BIB5","series-title":"Proc. Fifth Internat. Conf. on Data Engineering","article-title":"A feasibility and performance study of dependency inference","author":"Bitton","year":"1989"},{"key":"10.1016\/0169-023X(94)90023-X_BIB6","series-title":"On Knowledge Base Management Systems","first-page":"259","article-title":"Learning improved integrity constraints and schemas from exceptions in data and knowledge bases","author":"Borgida","year":"1986"},{"key":"10.1016\/0169-023X(94)90023-X_BIB7","series-title":"Proc. Eleventh Internat. Conf. on Very Large Data Bases (VLDB'85)","first-page":"72","article-title":"Accommodating exceptions in databases, and refining the schema by learning from them","author":"Borgida","year":"1985"},{"key":"10.1016\/0169-023X(94)90023-X_BIB8","series-title":"Proc. Eleventh Internat. Conf. on Very Large Data Bases (VLDB'85)","first-page":"82","article-title":"Database design tools: An expert system approach","author":"Bouzeghoub","year":"1985"},{"issue":"1","key":"10.1016\/0169-023X(94)90023-X_BIB9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1147\/rd.281.0082","article-title":"Mapping uninterpreted schemes into entity-relationship diagrams: Two applications to conceptual schema design","volume":"28","author":"Casanova","year":"1984","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0169-023X(94)90023-X_BIB10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0022-0000(84)90075-8","article-title":"Inclusion dependencies and their interaction with functional dependencies","volume":"28","author":"Casanova","year":"1984","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/0169-023X(94)90023-X_BIB11","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(90)90031-F","article-title":"Decomposing a relation into a tree of binary relations","volume":"41","author":"Dechter","year":"1990","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0169-023X(94)90023-X_BIB12","series-title":"Proc. Sixth ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS'87)","first-page":"190","article-title":"Formal bounds on the automatic generation and maintenance of integrity constraints","author":"Delgrande","year":"1987"},{"issue":"3","key":"10.1016\/0169-023X(94)90023-X_BIB13","first-page":"295","article-title":"On the functional dependency and some generalizations of it","volume":"5","author":"Demetrovics","year":"1981","journal-title":"Acta Cybernet."},{"issue":"3","key":"10.1016\/0169-023X(94)90023-X_BIB14","first-page":"279","article-title":"Relations and minimal keys","volume":"8","author":"Demetrovics","year":"1988","journal-title":"Acta Cybernet."},{"issue":"3","key":"10.1016\/0169-023X(94)90023-X_BIB15","first-page":"273","article-title":"Some results about functional dependencies","volume":"8","author":"Demetrovics","year":"1988","journal-title":"Acta Cybernet."},{"key":"10.1016\/0169-023X(94)90023-X_BIB16","article-title":"Identifying the minimal transversals of a hypergraph and related problems","author":"Eiter","year":"1991"},{"key":"10.1016\/0169-023X(94)90023-X_BIB17","article-title":"Armstrong databases","author":"Fagin","year":"1982"},{"issue":"3","key":"10.1016\/0169-023X(94)90023-X_BIB18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Information Processing Letters"},{"key":"10.1016\/0169-023X(94)90023-X_BIB19","series-title":"Design-By-Example: A tool for database design; user guide for version 3.0","author":"Kantola","year":"1991"},{"key":"10.1016\/0169-023X(94)90023-X_BIB20","series-title":"Proc. 4th Internat. Conf. on Database Theory (ICDT'92)","first-page":"86","article-title":"Approximate dependency interference from relations","author":"Kivinen","year":"1992"},{"key":"10.1016\/0169-023X(94)90023-X_BIB21","series-title":"The Theory of Relational Databases","author":"Maier","year":"1983"},{"key":"10.1016\/0169-023X(94)90023-X_BIB22","article-title":"Generating example databases from ER-schemes","author":"Mannila","year":"1987"},{"issue":"2","key":"10.1016\/0169-023X(94)90023-X_BIB23","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(86)90015-2","article-title":"Design by example: An application of Armstrong relations","volume":"33","author":"Mannila","year":"1986","journal-title":"J. Comput. and Syst. Sci."},{"key":"10.1016\/0169-023X(94)90023-X_BIB24","series-title":"Proc. Thirteenth Internat. Conf. on Very Large Data Bases (VLDB'87)","first-page":"155","article-title":"Dependency inference","author":"Mannila","year":"1987"},{"key":"10.1016\/0169-023X(94)90023-X_BIB25","series-title":"The Design of Relational Databases","author":"Mannila","year":"1992"},{"key":"10.1016\/0169-023X(94)90023-X_BIB26","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(92)90031-5","article-title":"On the complexity of dependency inference","volume":"40","author":"Mannila","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0169-023X(94)90023-X_BIB27","series-title":"Machine Learning: An Artificial Intelligence Approach","year":"1983"},{"key":"10.1016\/0169-023X(94)90023-X_BIB28","volume":"vol. II","year":"1986"},{"key":"10.1016\/0169-023X(94)90023-X_BIB29","series-title":"The Use of Knowledge in Analogy and Induction","author":"Russell","year":"1989"},{"key":"10.1016\/0169-023X(94)90023-X_BIB30","series-title":"Proc. 1991 AAAI Workshop on Knowledge Discovery in Databases","first-page":"64","article-title":"Learning determinations and checking databases","author":"Schlimmer","year":"1991"},{"key":"10.1016\/0169-023X(94)90023-X_BIB31","series-title":"Technical Report BUCS Tech Report #86-013","article-title":"Automatic rule derivation for semantic query optimization","author":"Siegel","year":"1986"},{"key":"10.1016\/0169-023X(94)90023-X_BIB32","series-title":"Advances in Data Base Theory","first-page":"115","article-title":"A method for helping discover the dependencies of a relation","author":"Silva","year":"1981"},{"issue":"4","key":"10.1016\/0169-023X(94)90023-X_BIB33","first-page":"361","article-title":"Minimal keys and antikeys","volume":"7","author":"Thi","year":"1986","journal-title":"Acta Cybernet."},{"key":"10.1016\/0169-023X(94)90023-X_BIB34","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all maximal independent sets","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0169-023X(94)90023-X_BIB35","volume":"vol. II","author":"Ullman","year":"1989"}],"container-title":["Data &amp; Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X9490023X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X9490023X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T15:51:00Z","timestamp":1553615460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X9490023X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0169023X9490023X"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(94)90023-x","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}