Advertisement

Another view of functional and multivalued dependencies in the relational database model

  • M. Gyssens
  • J. Paredaens
Article

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.

Key words

Relational database model integrity constraints functional dependency multivalued dependency 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. Beeri, On the membership problem for multivalued dependencies in relational databases, TR-229, Department of EECS, Princeton University (1979).Google Scholar
  2. 2.
    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).Google Scholar
  3. 3.
    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).Google Scholar
  4. 4.
    C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database schemes,IBM Res. Rep. (1981).Google Scholar
  5. 5.
    C. Beeri and M. Y. Vardi, The implication problem for database dependencies, inProceedings XP1 Workshop on Relational Database Theory, Stonybrook (1980).Google Scholar
  6. 6.
    E. F. Codd, Further normalizations of the relational data base model, inData Base Systems (R. Rustin, ed.), Prentice Hall, pp. 33–64 (1972).Google Scholar
  7. 7.
    R. Fagin, Multivalued dependencies and a new normal form for relational databases,ACM Trans. Database Syst. 2(3):262–278 (1977).Google Scholar
  8. 8.
    R. Fagin, A. O. Mendelzon, and J. D. Ullman, A simplified universal relation assumption and its properties,RJ2900, IBM, San Jose, California (1980).Google Scholar
  9. 9.
    Z. Galil, An almost linear-time algorithm for computing a dependency basis in a relational database,J. ACM 29:96–102 (January 1982).Google Scholar
  10. 10.
    M. Gyssens and J. Paredaens, A decomposition methodology for cyclic databases (to appear).Google Scholar
  11. 11.
    D. Maier, A. O. Mendelzon, and Y. Sagiv, Testing implication of data dependencies,ACM Trans. Database Syst.4(4):455–469.Google Scholar
  12. 12.
    J. Paredaens, The interaction of integrity constraints in an information system,J. Comp. Syst. Sci. 20(3):310–329 (June 1980).Google Scholar
  13. 13.
    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).Google Scholar
  14. 14.
    Y. Sagiv, An algorithm for inferring multivalued dependencies with an application to prepositional logic,J. ACM 27:250–262 (April 1980).Google Scholar
  15. 15.
    E. Sciore, Some observations on real world data dependencies, inProceedings XP1 Conference, Stonybrook, New York (1980).Google Scholar
  16. 16.
    E. Sciore, A complete axiomatization of full-join dependencies, TR-279, Department of EECS, Princeton University (1979).Google Scholar
  17. 17.
    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).Google Scholar

Copyright information

© Plenum Publishing Corporation 1983

Authors and Affiliations

  • M. Gyssens
    • 1
  • J. Paredaens
    • 1
  1. 1.Department of MathematicsUniversity of Antwerp U.I.A.WilrijkBelgium

Personalised recommendations