{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T02:16:15Z","timestamp":1691028975739},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0020-0190(02)00365-4","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T07:42:19Z","timestamp":1041061339000},"page":"153-158","source":"Crossref","is-referenced-by-count":3,"title":["A note on approximation measures for multi-valued dependencies in relational databases"],"prefix":"10.1016","volume":"85","author":[{"given":"Chris","family":"Giannella","sequence":"first","affiliation":[]},{"given":"Edward","family":"Robertson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00365-4_BIB001","series-title":"Proceedings of the 13th International Conference on Very Large Databases (VLDB)","first-page":"71","article-title":"The theory of probabilistic databases","author":"Cavallo","year":"1987"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB002","series-title":"Proceedings of the 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principals of Database Systems (PODS)","first-page":"245","article-title":"Information dependencies","author":"Dalkilic","year":"2000"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB003","series-title":"An Introduction to Database Systems","author":"Date","year":"2000"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB004","series-title":"Proceedings of the 6th East-European Conference on Advances in Databases and Information Systems","article-title":"An axiomatic approach to defining approximation measures for functional dependencies","author":"Giannella","year":"2002"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB005","series-title":"Proceedings of the 19th British National Conference on Databases","first-page":"26","article-title":"Improving query evaluation with approximate functional dependency based decompositions","volume":"2405","author":"Giannella","year":"2002"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB006","doi-asserted-by":"crossref","first-page":"732","DOI":"10.2307\/2281536","article-title":"Measures of associations for cross classifications","volume":"49","author":"Goodman","year":"1954","journal-title":"J. Amer. Statist. Assoc."},{"issue":"2","key":"10.1016\/S0020-0190(02)00365-4_BIB007","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","article-title":"Tane: An efficient algorithm for discovering functional and approximate dependencies","volume":"42","author":"Huhtala","year":"1999","journal-title":"Comput. J."},{"key":"10.1016\/S0020-0190(02)00365-4_BIB008","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","article-title":"Approximate inference of functional dependencies from relations","volume":"149","author":"Kivinen","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"10","key":"10.1016\/S0020-0190(02)00365-4_BIB009","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1109\/TSE.1987.232847","article-title":"An information-theoretic analysis of relational databases. Part I: Data dependencies and information metric","volume":"SE-13","author":"Lee","year":"1987","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/S0020-0190(02)00365-4_BIB010","first-page":"350","article-title":"Efficient discovery of functional dependencies and Armstrong relations","volume":"1777","author":"Lopes","year":"2000"},{"issue":"3","key":"10.1016\/S0020-0190(02)00365-4_BIB011","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0306-4379(86)90029-3","article-title":"Statistical treatment of the information content of a database","volume":"11","author":"Malvestuto","year":"1986","journal-title":"Inform. Systems"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB012","series-title":"Proceedings of the 6th International Conference on Very Large Databases (VLDB)","first-page":"417","article-title":"Some analytic tools for the design of relational database systems","author":"Nambiar","year":"1980"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB013","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/S0306-4379(01)00032-1","article-title":"Functional and embedded dependency inference: a data mining point of view","volume":"26","author":"Novelli","year":"2001","journal-title":"Inform. Systems"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB014","series-title":"The maximum edge biclique problem is NP-complete, Technical Report 789","author":"Peeters","year":"2000"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB015","series-title":"Proceedings of the ML-92 Workshop on Machine Discovery, Aberdeen, UK","first-page":"11","article-title":"Probabilistic data dependencies","author":"Piatetsky-Shapiro","year":"1992"},{"key":"10.1016\/S0020-0190(02)00365-4_BIB016","series-title":"Database Management Systems","author":"Ramakrishnan","year":"2000"},{"issue":"3\u20134","key":"10.1016\/S0020-0190(02)00365-4_BIB017","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/IDA-2000-43-403","article-title":"Discovery of multivalued dependencies from relations","volume":"4","author":"Savnik","year":"2000","journal-title":"Intelligent Data Anal."},{"issue":"5","key":"10.1016\/S0020-0190(02)00365-4_BIB018","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/(SICI)1097-4571(19980415)49:5<455::AID-ASI7>3.0.CO;2-M","article-title":"Automated database schema design using mined data dependencies","volume":"49","author":"Wong","year":"1998","journal-title":"J. Amer. Soc. Inform. Sci."},{"key":"10.1016\/S0020-0190(02)00365-4_BIB019","series-title":"Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery (DaWaK)","first-page":"101","article-title":"A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances","volume":"2114","author":"Wyss","year":"2001"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002003654?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002003654?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T04:06:16Z","timestamp":1583899576000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002003654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0020019002003654"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00365-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}