{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:55:42Z","timestamp":1759683342092},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,10,5]],"date-time":"2015-10-05T00:00:00Z","timestamp":1444003200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s00236-015-0247-9","type":"journal-article","created":{"date-parts":[[2015,10,5]],"date-time":"2015-10-05T10:18:40Z","timestamp":1444040320000},"page":"459-468","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal covers in the relational database model"],"prefix":"10.1007","volume":"53","author":[{"given":"Xiaoning","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhijun","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,5]]},"reference":[{"key":"247_CR1","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0215029","volume":"15","author":"G Ausiello","year":"1986","unstructured":"Ausiello, G., D\u2019Atri, A., Sacc, D.: Minimal representation of directed hypergraphs. SIAM J. Comput. 15, 418\u2013431 (1986)","journal-title":"SIAM J. Comput."},{"key":"247_CR2","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1145\/2157.322404","volume":"30","author":"G Ausiello","year":"1983","unstructured":"Ausiello, G., D\u2019Atri, A., Sacca, D.: Graph algorithm for functional dependency manipulation. J. ACM 30, 752\u2013766 (1983)","journal-title":"J. ACM"},{"key":"247_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/320493.320489","volume":"1","author":"PA Bernstein","year":"1976","unstructured":"Bernstein, P.A.: Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1, 277\u2013298 (1976)","journal-title":"ACM Trans. Database Syst."},{"key":"247_CR4","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"EF Codd","year":"1970","unstructured":"Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM 13, 377\u2013387 (1970)","journal-title":"Commun. ACM"},{"key":"247_CR5","first-page":"17","volume":"2","author":"V Cotelea","year":"2011","unstructured":"Cotelea, V.: Problem decomposition method to compute an optimal cover for a set of functional dependencies. Database Syst. J. 2, 17\u201330 (2011)","journal-title":"Database Syst. J."},{"key":"247_CR6","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1147\/rd.175.0374","volume":"17","author":"C Delobel","year":"1973","unstructured":"Delobel, C., Casey, R.G.: Decomposition of a data base and the theory of Boolean switching functions. IBM J. Res. Dev. 17, 374\u2013386 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"247_CR7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1147\/rd.216.0534","volume":"21","author":"R Fagin","year":"1977","unstructured":"Fagin, R.: Functional Dependencies in a Relational Database and Propositional Logic. IBM J. Res. Dev. 21, 533\u2013544 (1977)","journal-title":"IBM J. Res. Dev."},{"key":"247_CR8","doi-asserted-by":"crossref","unstructured":"Jain, T.K., Kushwaha, D.S., Misra, A.K.: Optimization of the Quine\u2013McCluskey method for the minimization of the Boolean expressions. In: Fourth International Conference on Autonomic and Autonomous Systems, pp. 165\u2013168. (2008)","DOI":"10.1109\/ICAS.2008.11"},{"key":"247_CR9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(78)90009-0","volume":"17","author":"CL Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Osborn, S.L.: Candidate keys for relations. J. Comput. Syst. Sci. 17, 270\u2013279 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"247_CR10","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322217.322223","volume":"27","author":"D Maier","year":"1980","unstructured":"Maier, D.: Minimum covers in the relational database model. J. ACM 27, 664\u2013674 (1980)","journal-title":"J. ACM"},{"key":"247_CR11","unstructured":"Maier, D.: The Theory of Relational Databases, pp. 42\u201370. Computer Science Press, Rockville, MD (1983)"},{"key":"247_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00289412","volume":"20","author":"H Mannila","year":"1983","unstructured":"Mannila, H., Raiha, K.-J.: On the relationship of minimum and optimal covers for a set of functional dependencies. Acta Informatica 20, 143\u2013158 (1983)","journal-title":"Acta Informatica"},{"key":"247_CR13","doi-asserted-by":"crossref","unstructured":"McCluskey, E.J.: Minimization of Boolean functions. Bell Syst. Tech. J. 35, 1417\u20131444 (1956)","DOI":"10.1002\/j.1538-7305.1956.tb03835.x"},{"key":"247_CR14","first-page":"1","volume":"1","author":"Patrick C McGeer","year":"1996","unstructured":"McGeer, Patrick C., Sanghavi, Jagesh V., Brayton, Robert K., Sangiovanni-vincentelli, Alberto L.: ESPRESSO-SIGNATURE: A new exact minimizer for logic functions. IEEE Trans. Very Large Scale Integr. Syst. 1, 1\u201314 (1996)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"247_CR15","first-page":"50","volume":"4","author":"X Peng","year":"2013","unstructured":"Peng, X., Xiao, Z.: Comments on problem decomposition method to compute an optimal cover for a set of functional dependencies. Database Syst. J. 4, 50\u201351 (2013)","journal-title":"Database Syst. J."},{"key":"247_CR16","first-page":"222","volume-title":"Digital Design: Principles and Practices","author":"JF Wakerly","year":"2001","unstructured":"Wakerly, J.F.: Digital Design: Principles and Practices, pp. 222\u2013228. Higher Education Press, Beijing (2001)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0247-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-015-0247-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0247-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:59Z","timestamp":1558705319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-015-0247-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,5]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["247"],"URL":"https:\/\/doi.org\/10.1007\/s00236-015-0247-9","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,5]]}}}