On the existence of Armstrong instances with bounded domains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4932 LNCS, Issue , 2008, Pages 151-157

  Sali, Attila ^a   Székely, László ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Armstrong instance; Armstrong code; Bounded domain; Functional dependency; Lov sz' Local Lemma; Spherical code

Indexed keywords

CODES (STANDARDS); CONTROL THEORY; FOUNDATIONS;

ARMSTRONG INSTANCE; ARMSTRONG-CODE; BOUNDED DOMAIN; BOUNDED DOMAINS; CODE-WORDS; FUNCTIONAL DEPENDENCY; GEOMETRIC ARGUMENTS; INTERNATIONAL SYMPOSIUM; KEY SYSTEMS; KNOWLEDGE SYSTEMS; LOWER BOUNDS; MINIMUM DISTANCES; Q-ARY CODES; SPHERICAL CODE; SPHERICAL CODES; UPPER AND LOWER BOUNDS; UPPER BOUNDS;

CODES (SYMBOLS);

EID: 49949099904     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77684-0_12     Document Type: Conference Paper

References (20)

1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
2. Alon, N., Spencer, J.: The Probabilistic Method. John Wiley and Sons, Chichester (2002)
3. Armstrong, W.W.: Dependency structures of database relationships. Information Processing, 580-583 (1974)
4. Demetrovics, J.: On the equivalence of candidate keys with Sperner systems. Acta Cybernetica 4, 247-252 (1979)
5. Demetrovics, J., Füredi, Z., Katona, G.O.H.: Minimum matrix reperesentation of closure operetions. Discrete Applied Mathematics 11, 115-128 (1985)
6. Demetrovics, J., Gyepesi, G.: A note on minimum matrix reperesentation of closure operetions. Combinatorica 3, 177-180 (1983)
7. Demetrovics, J., Katona, G.: Extremal combinatorial problems in relational data base. In: Gecseg, F. (ed.) FCT 1981. LNCS, vol. 117, pp. 110-119. Springer, Heidelberg (1981)
8. Demetrovics, J., Katona, G., Sali, A.: The characterization of branching dependencies. Discrete Applied Mathematics 40, 139-153 (1992)
9. Demetrovics, J., Katona, G., Sali, A.: Design type problems motivated by database theory. Journal of Statistical Planning and Inference 72, 149-164 (1998)
10. Demetrovics, J., Katona, G.O.H.: A survey of some combinatorial results concerning functional dependencies in databases. Annals of Mathematics and Artificial Intelligence 7, 63-82 (1993)
11. Fagin, R.: Horn clauses and database dependencies. Journal of the Association for Computing Machinery 29(4), 952-985 (1982)
12. Füredi, Z.: Perfect error-correcting databases. Discrete Applied Mathematics 28, 171-176 (1990)
13. Katona, G.O.H., Sali, A., and Schewe, K.-D.: Codes that attain minimum distance in all possible directions. Central European J. Math. (2007)
14. 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. 2942. Springer, Heidelberg (2004)
15. R.ankin, R.: The closest packing of spherical caps in n dimensions. Proceedings of the Glagow Mathematical Society 2, 145-146 (1955)
16. Sali, A.: Minimal keys in higher-order datamodels. In: Seipel, D., Turull-Torres, J.M.a (eds.) FoIKS 2004. LNCS, vol. 2942. Springer, Heidelberg (2004)
17. Sali, A., Schewe, K.-D.: Counter-free keys and functional dependencies in higher-order datamodels. Fundamenta Informaticae 70, 277-301 (2006)
18. Sali, A., Schewe, K.-D.: Keys and Armstrong databases in trees with restructuring. Acta Cybernetica (2007)
19. 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. 1. Plenum Publishing, New York (1981)
20. Thalheim, B.: The number of keys in relational and nested relational databases. Discrete Applied Mathematics 40, 265-282 (1992)