Abstract
In this paper, pseudo-functional and pseudo-multivalued dependencies are introduced. They are shown to be isomorphic with functional and multivalued dependencies, i.e., they behave in the same way with respect to implication. This formalism leads in a very natural way to a rather efficient algorithm for the inference of functional and multivalued dependencies. Some applications to acyclic join dependencies are discussed.
Similar content being viewed by others
References
C. Beeri, On the membership problem for multivalued dependencies in relational databases, TR-229, Department of EECS, Princeton University (1979).
C. Beeri, R. Fagin, and J. H. Howard, A complete axiomatization for functional and multivalued dependencies in database relations, inProceedings ACM SIGMOD, 3rd International Conference on Management of Data, Toronto, pp. 47–61 (August 1977).
C. Beeri, R. Fagin, D. Maier, A. O. Mendelzon, J. D. Ullman, and M. Yannakakis, Properties of acyclic database schemes, inProceedings 13th Annual ACM Symposium on the Theory of Computing, pp. 355–362 (1981).
C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database schemes,IBM Res. Rep. (1981).
C. Beeri and M. Y. Vardi, The implication problem for database dependencies, inProceedings XP1 Workshop on Relational Database Theory, Stonybrook (1980).
E. F. Codd, Further normalizations of the relational data base model, inData Base Systems (R. Rustin, ed.), Prentice Hall, pp. 33–64 (1972).
R. Fagin, Multivalued dependencies and a new normal form for relational databases,ACM Trans. Database Syst. 2(3):262–278 (1977).
R. Fagin, A. O. Mendelzon, and J. D. Ullman, A simplified universal relation assumption and its properties,RJ2900, IBM, San Jose, California (1980).
Z. Galil, An almost linear-time algorithm for computing a dependency basis in a relational database,J. ACM 29:96–102 (January 1982).
M. Gyssens and J. Paredaens, A decomposition methodology for cyclic databases (to appear).
D. Maier, A. O. Mendelzon, and Y. Sagiv, Testing implication of data dependencies,ACM Trans. Database Syst.4(4):455–469.
J. Paredaens, The interaction of integrity constraints in an information system,J. Comp. Syst. Sci. 20(3):310–329 (June 1980).
J. Rissanen, Theory of joins for relational databases-A tutorial survey, inProceedings 7th Symposium on Mathematical Foundation of Computer Science, Lecture Notes in Computer Science 64, Springer Verlag, pp. 537–551 (1978).
Y. Sagiv, An algorithm for inferring multivalued dependencies with an application to prepositional logic,J. ACM 27:250–262 (April 1980).
E. Sciore, Some observations on real world data dependencies, inProceedings XP1 Conference, Stonybrook, New York (1980).
E. Sciore, A complete axiomatization of full-join dependencies, TR-279, Department of EECS, Princeton University (1979).
C. Zaniolo, Analysis and design of relational schemata for database systems. Technical Report UCLA ENG-7669, Department of Computer Science, University of California, Los Angeles (1976).
Author information
Authors and Affiliations
Additional information
Research assistant of the NFWO.
Rights and permissions
About this article
Cite this article
Gyssens, M., Paredaens, J. Another view of functional and multivalued dependencies in the relational database model. International Journal of Computer and Information Sciences 12, 247–267 (1983). https://doi.org/10.1007/BF00991621
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00991621