Catriel Beeri
Ronald Fagin
- 1 ARMSTRONG, W.W.l_~penoency structures ot oataoase relallonsBily& lrl /'TOe. 11"11" /4, !~Ol'tll Holland, Amsterdam, 1974, pp. 580-583.Google Scholar
- 2 ARMSTRONG, W.W., AND DELOBEL, C.Decomposition and functional dependencies in relations. ACM Trans Database Syst 5, 4 (Dec. 1980), 404-430. Google Scholar
- 3 BEERI, C., AND BERNSTEIN, P A Computational problems related to the design of normal form relational schemas. ACM Trans. Database,.,Cyst 4, 1 (Mar. 1979), 30-59. Google Scholar
- 4 BEERI, C., FAGIN, R., AND HOWARD, J.H.A complete axiomatization for functional and multivalued dependencies m database relations. In Proc ACM-SIGMOD Int. Conf. on Management of Data (Toronto, Aug, 1977), ACM, New York, pp. 47-61. Google Scholar
- 5 CASANOVA, M.A., FAON, R., AND PAPADIMITRIOU, C.Inclusion dependencies and their interaction w~th functional dependencies. SlAM ~ Comput (to appear); extended abstract appeared in Proc. 1st ACM SIGACT-SIGMOD Principles of Database Systems (Los Angeles, Calif., 1982), ACM, New York, pp. 171-176. Google Scholar
- 6 CODD, E.F.Further normalization of the database relational model. In Data Base Systems, Courant Computer Soence Symposia 6, R. Rustin, Ed., Prentice Hall, Englewood Cliffs, N.J., pp. 65-98.Google Scholar
- 7 DEMETROVICS, J,On the number of candidate keys. Inf Proc Lett 7, 6 (Oct. 1978), 266-269.Google Scholar
- 8 DEMETROVICS, J., AND GYEPESI, G. On the functional dependency and some generalizations of it. Acta Cyberne 5, 3 (1981), 295-305.Google Scholar
- 9 ERDOS, P., AND KLEITMAN, D.Extremal problems among subsets of a given set. In Paul Erdos: The Art ofCount:ng---Selected Wrtttngs, J. Spencer, Ed., MIT Press, 1973, pp. 482-506.Google Scholar
- 10 FAGIN, R.Probabilities on finite models. J Symb Logic 41. 1 (Mar. 1976), 50-58.Google Scholar
- 11 FAGIN, R. Multivalued dependencies and a new normal form for relaUonal databases. ACM Trans. Database Syst. Z 3 (Sept. 1977), 262-278. Google Scholar
- 12 FAGIN, R.Functional dependencies tn a relational database and propositional logic. IBM ~ Res Devel 21, 6 (Nov. 1977), 534-544.Google Scholar
- 13 FAGeN, R.Armstrong databases. In Proc 7th IBM Syrup. on Mathematical Foundations of Compuler Scrence (Kanagawa, Japan, May 1982); also appeared as Res. Rep. ILI3440, IBM Resoareh Lab., San Jose, Calif., Apr. 1982.Google Scholar
- 14 FAGIN, R. Horn clauses and database dependencies. J. ACM 29, 4 (Oct. 1982), 952-985; extended abstract appeared in Proc. 12th Ann A CM Syrup. on Theory of Computing (Los Angeles, Calif., 1980), ACM, New York, pp. 123-134. Google Scholar
- 15 GAREY, M.R., AND JOHNSON, D.S.Computers and lntractibility: A Guide to the Theory of NP- Completeness, Freeman, San Francisco, 1979. Google Scholar
- 16 GINSBURG, S., AND HULL, R.Characterizations for functional dependency and Boyee-Codd normal form families. Tech. Rep., Univ. of Southern California, Los Angeles, Calif., Feb. 1982.Google Scholar
- 17 GINSBURG, S., AND ZAIDDAN, S.M.Properties of functional-dependency families. J. ACM 29, 3 (July 1982), 678-698. Google Scholar
- 18 GOLD, E.M. Axiomatization of attribute dependencies. Publ. # 173, Drpartemenf d'lnformauque, Universit6 de Montrral, May 1974.Google Scholar
- 19 GRATZER, G.UniversalAlgebra, 2nd ed. Springer-Verlag, New York, 1979.Google Scholar
- 20 LUCCHESl, C.L., AND OSBORN, S.L.Candidate keys for relations, J. Comput Syst. ScL 17, 2 (Oct. 1978), 270-279.Google Scholar
- 21 SAGIV, Y., DELOBEL, C., PARKER, D.S., AND FAGIN, R. An equivalence between relaUonal database dependenctes and a fragment of propositional logic. J. ACM 28, 3 (July 1981), 435=453. Google Scholar
- 22 SILVA, A,M., AND MELKANOFF, M.A. A method for helping discover the dependencies of a relatton. In Advances m Database Theory, Itol. 1, H. Gallaire, J. Minker, and J-M. Nwolas, Eds., Plenum Pubhshing, New York, 1981.Google Scholar
- 23 SPERNER, E., Eine Satz uber Untermensen einer endlichen Menge. Math. Zeu. 27 (1928), 544-548.Google Scholar
- 24 ~TATMAN, R. Worst case exponential lower bounds for input resolution with paramodulation. SIAM J Comput. (to appear).Google Scholar
- 25 ULLMAN, J.D.Prtnc~ples of Database Systems, 2rid ed. Computer Science Press, Rockville, Md., 1982.Google Scholar
- 26 ZANIOLO, C. Analysis and design of relational schemata for database systems. Ph.D. Dissertation, Tech. Rep. UCLA-ENG-7669, Univ. of California, Los Angeles, Calif., July 1976. Google Scholar
- 27 ZLOOF, M.M. Query-by-example. In Proc. 1975 National Computer Conf. 44, AFIPS Press, Arlington, Va., pp. 431-438.Google Scholar
Index Terms
- On the Structure of Armstrong Relations for Functional Dependencies
Recommendations
On armstrong relations for strong dependencies
The strong dependency has been introduced and axiomatized in [2], [3], [4], [5]. The aim of this paper is to investigate on Armstrong relations for strong dependencies. We give a necessary and sufficient condition for an abitrary relation to be ...
Efficient Discovery of Functional Dependencies and Armstrong Relations
EDBT '00: Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database TechnologyIn this paper, we propose a new efficient algorithm called Dep-Miner for discovering minimal non-trivial functional dependencies from large databases. Based on theoretical foundations, our approach combines the discovery of functional dependencies along ...
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77: Proceedings of the 1977 ACM SIGMOD international conference on Management of dataWe investigate the inference rules that can be applied to functional and multivalued dependencies that exist in a database relation. Three types of rules are discussed. First, we list the well known rules for functional dependencies. Then we investigate ...
Comments