{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T05:27:08Z","timestamp":1737955628229,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540776833"},{"type":"electronic","value":"9783540776840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77684-0_12","type":"book-chapter","created":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T07:33:44Z","timestamp":1201592024000},"page":"151-157","source":"Crossref","is-referenced-by-count":8,"title":["On the Existence of Armstrong Instances with Bounded Domains"],"prefix":"10.1007","author":[{"given":"Attila","family":"Sali","sequence":"first","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Sz\u00e9kely","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"12_CR2","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2002","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. John Wiley and Sons, Chichester (2002)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Armstrong, W.W.: Dependency structures of database relationships. Information Processing, 580\u2013583 (1974)","DOI":"10.1515\/9783110840308-026"},{"key":"12_CR4","first-page":"247","volume":"4","author":"J. Demetrovics","year":"1979","unstructured":"Demetrovics, J.: On the equivalence of candidate keys with Sperner systems. Acta Cybernetica\u00a04, 247\u2013252 (1979)","journal-title":"Acta Cybernetica"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(85)80003-2","volume":"11","author":"J. Demetrovics","year":"1985","unstructured":"Demetrovics, J., F\u00fcredi, Z., Katona, G.O.H.: Minimum matrix reperesentation of closure operetions. Discrete Applied Mathematics\u00a011, 115\u2013128 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02579291","volume":"3","author":"J. Demetrovics","year":"1983","unstructured":"Demetrovics, J., Gyepesi, G.: A note on minimum matrix reperesentation of closure operetions. Combinatorica\u00a03, 177\u2013180 (1983)","journal-title":"Combinatorica"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-10854-8_11","volume-title":"FCT 1981","author":"J. Demetrovics","year":"1981","unstructured":"Demetrovics, J., Katona, G.: Extremal combinatorial problems in relational data base. In: Gecseg, F. (ed.) FCT 1981. LNCS, vol.\u00a0117, pp. 110\u2013119. Springer, Heidelberg (1981)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(92)90027-8","volume":"40","author":"J. Demetrovics","year":"1992","unstructured":"Demetrovics, J., Katona, G., Sali, A.: The characterization of branching dependencies. Discrete Applied Mathematics\u00a040, 139\u2013153 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0378-3758(98)00029-9","volume":"72","author":"J. Demetrovics","year":"1998","unstructured":"Demetrovics, J., Katona, G., Sali, A.: Design type problems motivated by database theory. Journal of Statistical Planning and Inference\u00a072, 149\u2013164 (1998)","journal-title":"Journal of Statistical Planning and Inference"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01556350","volume":"7","author":"J. Demetrovics","year":"1993","unstructured":"Demetrovics, J., Katona, G.O.H.: A survey of some combinatorial results concerning functional dependencies in databases. Annals of Mathematics and Artificial Intelligence\u00a07, 63\u201382 (1993)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"4","key":"12_CR11","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1145\/322344.322347","volume":"29","author":"R. Fagin","year":"1982","unstructured":"Fagin, R.: Horn clauses and database dependencies. Journal of the Association for Computing Machinery\u00a029(4), 952\u2013985 (1982)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0166-218X(90)90114-R","volume":"28","author":"Z. F\u00fcredi","year":"1990","unstructured":"F\u00fcredi, Z.: Perfect error-correcting databases. Discrete Applied Mathematics\u00a028, 171\u2013176 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Katona, G.O.H., Sali, A., and Schewe, K.-D.: Codes that attain minimum distance in all possible directions. Central European J. Math. (2007)","DOI":"10.2478\/s11533-008-0001-4"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Information and Knowledge Systems","author":"S. Hartmann","year":"2004","unstructured":"Hartmann, S., Link, S., Schewe, K.-D.: Weak functional dependencies in higher-order datamodels. In: Seipel, D., Turull-Torres, J.M. (eds.) FoIKS 2004. LNCS, vol.\u00a02942. Springer, Heidelberg (2004)"},{"key":"12_CR15","first-page":"145","volume":"2","author":"R. Rankin","year":"1955","unstructured":"Rankin, R.: The closest packing of spherical caps in n dimensions. Proceedings of the Glagow Mathematical Society\u00a02, 145\u2013146 (1955)","journal-title":"Proceedings of the Glagow Mathematical Society"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Information and Knowledge Systems","author":"A. Sali","year":"2004","unstructured":"Sali, A.: Minimal keys in higher-order datamodels. In: Seipel, D., Turull-Torres, J.M.a (eds.) FoIKS 2004. LNCS, vol.\u00a02942. Springer, Heidelberg (2004)"},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"277","DOI":"10.3233\/FUN-2006-70307","volume":"70","author":"A. Sali","year":"2006","unstructured":"Sali, A., Schewe, K.-D.: Counter-free keys and functional dependencies in higher-order datamodels. Fundamenta Informaticae\u00a070, 277\u2013301 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"12_CR18","unstructured":"Sali, A., Schewe, K.-D.: Keys and Armstrong databases in trees with restructuring. Acta Cybernetica (2007)"},{"key":"12_CR19","volume-title":"Advances in Data Base Theory","author":"A. Silva","year":"1981","unstructured":"Silva, A., Melkanoff, M.: A method for helping discover the dependencies of a relation. In: Gallaire, H., Minker, J., Nicolas, J.-M. (eds.) Advances in Data Base Theory, vol.\u00a01. Plenum Publishing, New York (1981)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0166-218X(92)90033-7","volume":"40","author":"B. Thalheim","year":"1992","unstructured":"Thalheim, B.: The number of keys in relational and nested relational databases. Discrete Applied Mathematics\u00a040, 265\u2013282 (1992)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77684-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,26]],"date-time":"2025-01-26T10:41:04Z","timestamp":1737888064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77684-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540776833","9783540776840"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77684-0_12","relation":{},"subject":[]}}