{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:24:08Z","timestamp":1743117848858,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642234408"},{"type":"electronic","value":"9783642234415"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23441-5_6","type":"book-chapter","created":{"date-parts":[[2011,8,13]],"date-time":"2011-08-13T02:35:01Z","timestamp":1313202901000},"page":"96-113","source":"Crossref","is-referenced-by-count":5,"title":["Coding Theory Motivated by Relational Databases"],"prefix":"10.1007","author":[{"given":"Attila","family":"Sali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_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":"6_CR2","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1109\/18.887851","volume":"46","author":"E. Agrell","year":"2000","unstructured":"Agrell, E., Vardy, A., Zeger, K.: Upper bounds for constant-weight codes. IEEE Transactions on Information Theory\u00a046, 2373\u20132395 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Armstrong, W.W.: Dependency structures of database relationships. Information Processing, 580\u2013583 (1974)","DOI":"10.1515\/9783110840308-026"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0022-0000(86)90018-8","volume":"33","author":"G. Ausiello","year":"1986","unstructured":"Ausiello, G., D\u2019Atri, A., Moscarini, M.: Chordality properties on graphs and minimal conceptual connections in semantic data models. Journal of Computer and System Sciences\u00a033(2), 179\u2013202 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM\u00a030, 479\u2013513 (1983)","journal-title":"J. ACM"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(90)90018-8","volume":"26","author":"F.E. Bennett","year":"1990","unstructured":"Bennett, F.E., Wu, L.: On minimum matrix representation of closure operations. Discrete Applied Mathematics\u00a026(1), 25\u201340 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR7","unstructured":"Blokhuis, A., Sali, A.: Paper in preparation"},{"key":"6_CR8","unstructured":"Bollob\u00e1s, B., Katona, G.O.H., Leader, I.: Paper in preparation"},{"key":"6_CR9","first-page":"139","volume":"38","author":"G. Brightwell","year":"2001","unstructured":"Brightwell, G., Katona, G.O.H.: A new type of coding theorem. Studia Sci. Math. Hungar.\u00a038, 139\u2013147 (2001)","journal-title":"Studia Sci. Math. Hungar."},{"key":"6_CR10","unstructured":"Brouwer, A.E.: Personal communication (2008)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1023\/A:1008283627078","volume":"13","author":"D.E. Bryant","year":"1998","unstructured":"Bryant, D.E., Khodkar, A.: On orthogonal double covers of graphs. Designs, Codes and Cryptography\u00a013, 103\u2013105 (1998) 10.1023\/A:1008283627078","journal-title":"Designs, Codes and Cryptography"},{"key":"6_CR12","first-page":"1","volume-title":"Proceedings of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems PODS 1984","author":"A. D\u2019Atri","year":"1984","unstructured":"D\u2019Atri, A., Moscarini, M.: On the recognition and design of acyclic databases. In: Proceedings of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems PODS 1984, pp. 1\u20138. ACM, New York (1984)"},{"key":"6_CR13","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":"6_CR14","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":"6_CR15","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":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-10854-8_11","volume-title":"Fundamentals of Computing Theory (FCT 1981)","author":"M. Riaz","year":"1981","unstructured":"Demetrovics, J., Katona, G. O. H.: Tempero, E.: Extremal combinatorial problems in relational data base. In:FCT 1981. LNCS, vol.\u00a0117, pp. 110\u2013119. Springer, Heidelberg (1981)"},{"key":"6_CR17","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"},{"key":"6_CR18","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.O.H., Sali, A.: The characterization of branching dependencies. Discrete Applied Mathematics\u00a040, 139\u2013153 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR19","first-page":"213","volume":"60","author":"J. Demetrovics","year":"1995","unstructured":"Demetrovics, J., Katona, G.O.H., Sali, A.: Representations of branching dependencies. Acta Sci. Math. (Szeged)\u00a060, 213\u2013223 (1995)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"6_CR20","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.O.H., 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":"6_CR21","volume-title":"Dictionary of distances","author":"M.-M. Deza","year":"2006","unstructured":"Deza, M.-M., Deza, E.: Dictionary of distances. Elsevier, Amsterdam (2006)"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"7","DOI":"10.37236\/1606","volume":"8","author":"H. Enomoto","year":"2001","unstructured":"Enomoto, H., Katona, G.O.H.: Pairs of disjoint q-element subsets far from each other. Electronic Journal of Combinatorics\u00a08, # R7 (2001)","journal-title":"Electronic Journal of Combinatorics"},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","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":"6_CR24","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM\u00a030, 514\u2013550 (1983)","journal-title":"J. ACM"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(02)00442-0","volume":"128","author":"F.-W. Fu","year":"2003","unstructured":"Fu, F.-W., Kl\u00f8ve, T., Luo, Y., Wei, V.: On equidistant constant weight codes. Discrete Applied Mathematics\u00a0128, 157\u2013164 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR26","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":"6_CR27","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0012-365X(91)90006-N","volume":"88","author":"B. Ganter","year":"1987","unstructured":"Ganter, B., Gronau, H.-D.O.F.: On two conjectures of Demetrovics, F\u00fcredi and Katona concerning partitions. Discrete Mathematics\u00a088, 149\u2013155 (1987)","journal-title":"Discrete Mathematics"},{"key":"6_CR28","first-page":"209","volume":"37","author":"B. Ganter","year":"1994","unstructured":"Ganter, B., Gronau, H.-D.O.F., Mullin, R.C.: On orthogonal double covers of K n . Ars Combinatoria\u00a037, 209\u2013221 (1994)","journal-title":"Ars Combinatoria"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/TIT.1980.1056141","volume":"26","author":"R. Graham","year":"1980","unstructured":"Graham, R., Sloane, N.: Lower bounds for constant weight code. IEEE Trans. Inform. Theory\u00a026, 37\u201343 (1980)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6_CR30","first-page":"1941","volume-title":"Advances in Computing Research","author":"G. Grahne","year":"1986","unstructured":"Grahne, G., R\u00e4ih\u00e4, K.-J.: Characterizations for acyclic database schemes. In: Preparata, F., Kanellakis, P. (eds.) Advances in Computing Research, p. 1941. JAI Press Inc., Greenwich (1986)"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(85)80017-6","volume":"65","author":"J. Grant","year":"1985","unstructured":"Grant, J., Minker, J.: Normalization and axiomatization for numerical dependencies. Information and Control\u00a065, 1\u201317 (1985)","journal-title":"Information and Control"},{"key":"6_CR32","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1016546402248","volume":"27","author":"H.-D.O.F. Gronau","year":"2002","unstructured":"Gronau, H.-D.O.F., Grttmller, M., Hartmann, S., Leck, U., Leck, V.: On orthogonal double covers of graphs. Designs, Codes and Cryptography\u00a027, 49\u201391 (2002) 10.1023\/A:1016546402248","journal-title":"Designs, Codes and Cryptography"},{"issue":"9","key":"6_CR33","doi-asserted-by":"publisher","first-page":"2048","DOI":"10.1016\/j.dam.2008.08.004","volume":"157","author":"H.-D.O.F. Gronau","year":"2009","unstructured":"Gronau, H.-D.O.F., Schmidmeier, M.: Orthogonal covers by multiplication graphs. Discrete Applied Mathematics\u00a0157(9), 2048\u20132056 (2009); Optimal Discrete Structures and Algorithms - ODSA 2006","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.endm.2005.06.102","volume":"23","author":"S. Hartmann","year":"2005","unstructured":"Hartmann, S., Leck, U.: Self-orthogonal decompositions of graphs into matchings. Electronic Notes in Discrete Mathematics\u00a023, 5\u201311 (2005); Workshop on Graph Asymmetries","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"12","key":"6_CR35","doi-asserted-by":"publisher","first-page":"2502","DOI":"10.1016\/j.disc.2007.05.026","volume":"308","author":"S. Hartmann","year":"2008","unstructured":"Hartmann, S., Leck, U., Leck, V.: More orthogonal double covers of complete graphs by hamiltonian paths. Discrete Mathematics\u00a0308(12), 2502\u20132508 (2008)","journal-title":"Discrete Mathematics"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-24627-5_9","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":"6_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2478\/s11533-008-0001-4","volume":"6","author":"G.O.H. Katona","year":"2008","unstructured":"Katona, G.O.H., Sali, A., Schewe, K.-D.: Codes that attain minimum distance in all possible directions. Central Eruopean J. of Math.\u00a06, 1\u201311 (2008)","journal-title":"Central Eruopean J. of Math."},{"issue":"1-3","key":"6_CR38","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0166-218X(99)00087-6","volume":"95","author":"U. Leck","year":"1999","unstructured":"Leck, U., Leck, V.: Orthogonal double covers of complete graphs by trees of small diameter. Discrete Applied Mathematics\u00a095(1-3), 377\u2013388 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR39","volume-title":"Graph Theory and Related Topics: Proc. Conf. Univ. Waterloo, Ontario 1977","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Toplogical and algebraic methods in graph theory. In: Graph Theory and Related Topics: Proc. Conf. Univ. Waterloo, Ontario 1977. Academic Press, New York (1979)"},{"key":"6_CR40","first-page":"61","volume":"42","author":"J. Quistorff","year":"2005","unstructured":"Quistorff, J.: New upper bounds on enomoto-katona\u2019s coding type problem. Studia Sci. Math. Hungar.\u00a042, 61\u201372 (2005)","journal-title":"Studia Sci. Math. Hungar."},{"key":"6_CR41","first-page":"121","volume":"46","author":"J. Quistorff","year":"2009","unstructured":"Quistorff, J.: Combinatorial problems in the enomoto-katona space. Studia Sci. Math. Hungar.\u00a046, 121\u2013139 (2009)","journal-title":"Studia Sci. Math. Hungar."},{"key":"6_CR42","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":"6_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24627-5_16","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. (eds.) FoIKS 2004. LNCS, vol.\u00a02942, Springer, Heidelberg (2004)"},{"key":"6_CR44","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":"6_CR45","first-page":"529","volume":"18","author":"A. Sali","year":"2008","unstructured":"Sali, A., Schewe, K.-D.: Keys and Armstrong databases in trees with restructuring. Acta Cybernetica\u00a018, 529\u2013556 (2008)","journal-title":"Acta Cybernetica"},{"key":"6_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-77684-0_12","volume-title":"Foundations of Information and Knowledge Systems","author":"A. Sali","year":"2008","unstructured":"Sali, A., Sz\u00e9kely, L.A.: On the existence of armstrong instances with bounded domains. In: Hartmann, S., Kern-Isberner, G. (eds.) FoIKS 2008. LNCS, vol.\u00a04932, pp. 151\u2013157. Springer, Heidelberg (2008)"},{"key":"6_CR47","first-page":"431","volume":"13","author":"A. Sali Sr","year":"1998","unstructured":"Sali sr, A., Sali, A.: Generalized dependencies in relational databases. Acta Cybernetica (Szeged)\u00a013, 431\u2013438 (1998)","journal-title":"Acta Cybernetica (Szeged)"},{"key":"6_CR48","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":"6_CR49","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","Semantics in Data and Knowledge Bases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23441-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T15:50:04Z","timestamp":1741449004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23441-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642234408","9783642234415"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23441-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}