Design type problems motivated by database theory

Journal of Statistical Planning and Inference

Volumn 72, Issue 1-2, 1998, Pages 149-164

  Demetrovics, János ^a   Katona, Gyula O H ^b   Sali, Attila ^b  

^a INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Design; Hamiltonian cycle; Orthogonal double cover; Primary: 68P15 68R05; Relational Database; Secondary: 05D05

Indexed keywords

EID: 0040098350     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0378-3758(98)00029-9     Document Type: Article

References (23)

1. Armstrong, W.W., 1974. Dependency structures of database relationships. Information Processing. 74 North-Holland, Amsterdam, pp. 580-583.
2. Bennett F.E., Lisheng Wu On mimimum matrix representation of closure operations. Discrete Appl. Math. 26:1990;25-40.
3. Chee, Y.M., Preprint. Design-theoretic problems in perfectly (n-3) -error-correcting databases.
4. Chung M.S., West D.B. The. p -intersection number of a complete bipartite graph and orthogonal double coverings of a clique Combinatorica. 14:1994;453-461.
5. Codd E.F. A relational model of data for large shared data banks. Comm. ACM. 13:1970;377-387.
6. Demetrovics J., Füredi Z., Katona G.O.H. Minimum matrix representation of closure operations. Discrete Appl. Math. 11:1985;115-128.
7. Demeterovics J., Gyepesi Gy. A note on minimum matrix reperesentation of closure operations. Combinatorica. 3:1983;177-180.
8. Demetrovics, J., Katona, G.O.H., 1981. Extremal combinatorial problems in a relational database. In: Fundamentals of Computation Theory 81, Proc. 1981 Int. FCT-Conf., Szeged, Hungary, 1981, Lecture Notes in Computer Science, vol. 117. Springer, Berlin, pp. 110-119.
9. Demetrovics J., Katona G.O.H. A survey of some combinatorial results concerning functional dependencies in database relations. Ann. Math. Artificial Intelligence. 7:1993;63-82.
10. Demetrovics J., Katona G.O.H., Sali A. The characterization of branching dependencies. Discrete Appl. Math. 40:1992;139-153.
11. Demetrovics J., Katona G.O.H., Sali A. Minimal Representations of Branching Dependencies. Acta Sci. Math. (Szeged). 60:1995;213-223.
12. Dirac, G.A., 1952. Some theorems on abstract graphs Proc. London Math. Soc. Ser. 3 (2) 69-81.
13. Füredi Z. Perfect error-correcting databases. Discrete Appl. Math. 28:1990;171-176.
14. Gronau H.-D.O.F., Ganter B. On two conjectures of demetrovics, furedi and katona concerning partitions. Discrete Math. 88:1991;149-155.
15. n Ars Combin. 37:1994;209-221.
16. n and a conjecture of Chung and West J. Combin. Des. 3:1995;213-231.
17. n .
18. Gronau, H.-D.O.F., Mullin, R.C., Rosa, A. Preprint.
19. 3∪v.
20. Lovász, L., 1979. Toplogical and algebraic methods in graph theory. In: Graph Theory and Related Topics, Proc. Conf. Univ. Waterloo, Ontario 1977, 1-14, Academic Press, NY.
21. Rausche A. On the existence of special block designs. Rostock Math. Kolloq. 35:1987;13-20.
22. Sali, A., Sr. Sali, A., submitted. Generalized Dependencies in Relational Databases. Discrete Appl. Math.
23. Ullman, J.D., 1989. Principles of Database and Knowledge-Base Systems. Computer Sci. Press New York.