{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:22Z","timestamp":1725488602796},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_19","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:32:26Z","timestamp":1186727546000},"page":"184-192","source":"Crossref","is-referenced-by-count":0,"title":["Dense Families and Key Functions of Database Relation Instances"],"prefix":"10.1007","author":[{"given":"Jouni","family":"J\u00e4rvinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"19_CR1","first-page":"580","volume-title":"Information Processing","author":"W. W. Armstrong","year":"1974","unstructured":"W. W. Armstrong, Dependency structure of data base relationships, in: Information Processing\n                           74 (North-Holland, Amsterdam, 1974) 580\u2013583."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1995.1157","volume":"123","author":"J. C. Bioch","year":"1995","unstructured":"J. C. Bioch, T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation\n                           123 (1995) 50\u201363.","journal-title":"Information and Computation"},{"key":"19_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/S0924-6509(08)70096-5","volume-title":"Hypergraphs. Combinatorics of Finite Sets","author":"C. Berge","year":"1989","unstructured":"C. Berge, Hypergraphs. Combinatorics of Finite Sets (North-Holland, Amsterdam, 1989)."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(97)00089-3","volume":"190","author":"J. Demetrovics","year":"1998","unstructured":"J. Demetrovics, G. O. H. Katona, D. Miklos, O. Seleznjev, B. Thalheim, Asymptotic properties of keys and functional dependencies in random databases, Theoretical Computer Science\n                           190 (1998) 151\u2013166.","journal-title":"Theoretical Computer Science"},{"key":"19_CR5","volume-title":"Fundamentals of Database Systems","author":"R. Elmasri","year":"2000","unstructured":"R. Elmasri, S. B. Navathe, Fundamentals of Database Systems, 3rd ed. (Addison-Wesley, Reading, Massachusetts, 2000).","edition":"3rd ed."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M. Fredman","year":"1996","unstructured":"M. Fredman, L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, Journal of Algorithms\n                           21 (1996) 618\u2013628.","journal-title":"Journal of Algorithms"},{"key":"19_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-69115-4_20","volume-title":"Rough Sets and Current Trends in Computing","author":"J. J\u00e4rvinen","year":"1998","unstructured":"J. J\u00e4rvinen, Preimage relations and their matrices, in: L. Polkowski, A. Skowron, eds., Rough Sets and Current Trends in Computing, Lecture Notes in Artificial Intelligence 1424 (Springer, Berlin, 1998) 139\u2013146."},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/3-540-08442-8_115","volume-title":"Proceedings of the 1977 International Conference on Fundamentals of Computation Theory","author":"W. Lipski Jr.","year":"1977","unstructured":"W. Lipski, Jr., Two NP-complete problems related to information retrieval, in: M. Karpi\u0144ski, ed., Proceedings of the 1977 International Conference on Fundamentals of Computation Theory, Lecture Notes in Computer Science 56 (Springer, Berlin, 1977) 452\u2013458."},{"key":"19_CR9","first-page":"331","volume-title":"Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory","author":"A. Skowron","year":"1991","unstructured":"A. Skowron, C. Rauszer, The discernibility matrices and functions in information systems, in: R. S\u0142owinski, ed., Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, (Kluwer, Dordrecht, 1991) 331\u2013362."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T04:26:31Z","timestamp":1550723191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}