Acta Informatica

, Volume 19, Issue 4, pp 305–324 | Cite as

Inferring multivalued dependencies from functional and join dependencies

  • Moshe Y. Vardi
Article

Summary

We describe an algorithm to test whether a multivalued dependency is implied by a set of functional and join dependencies. The worst case running time of the algorithm is O(nm), where n is the length of the input and m is the number of the attributes in the universe. We also apply the algorithm to test implication of embedded multivalued dependencies, lossless join dependencies, acyclic join dependencies, first order hierarchical decompositions, and functional dependencies. The worst case running time of the algorithm for all these problems is still polynomial in the length of the input.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Beeri, C., Ullman, J.D.: The theory of joins in relational databases. ACM Trans. Database Syst. 4, 297–314 (1979)Google Scholar
  2. 2.
    Armstrong, W.W., Delobel, C.: Decompositions and functional dependencies in relations. ACM Trans. Database Syst. 5, 404–430 (1980)Google Scholar
  3. 3.
    Armstrong, W.W.: Dependency structure of database relationships. Proc. IFIP 74, North-Holland, pp. 580–583, 1974Google Scholar
  4. 4.
    Beeri, D., Bernstein, P.A.: Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst. 4, 30–59 (1979)Google Scholar
  5. 5.
    Beeri, C., Bernstein, P.A., Goodman, N.: A sophisticates introduction to database normalization theory. Proc. Int. Conf. VLDB, Berlin, pp. 113–124, 1978Google Scholar
  6. 6.
    Beeri, C.: On the membership problem for multivalued dependencies. ACM Trans. Database Syst. 5, 241–259 (1980)Google Scholar
  7. 7.
    Bernstein, P.A.: Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1, 277–298 (1976)Google Scholar
  8. 8.
    Beeri, C., Fagin, R., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. Proc. ACM Conf. Management Data, Toronto, pp. 47–61, 1977Google Scholar
  9. 9.
    Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30, 479–513 (1983)Google Scholar
  10. 10.
    Biskup, J.: On the complementation rule for multivalued dependencies in data base relations. Acta Informat. 10, 297–305 (1978)Google Scholar
  11. 11.
    Biskup, J.: Inferences of multivalued dependencies in fixed and undetermined universes. Theor. Comput. Sci. 10, 93–105 (1980)Google Scholar
  12. 12.
    Beeri, C., Mendelzon, A.O., Sagiv, Y., Ullman, J.D.: Equivalence of relational database schemes. SIAM J. Comput. 10, 647–656 (1981)Google Scholar
  13. 13.
    Beeri, C., Rissanen, J.: Faithful representation of relational database schemes. IBM Research Report, San Jose, 1980Google Scholar
  14. 14.
    Beeri, C., Vardi, M.Y.: On the properties of join dependencies. In: Advances in Database Theory. Gallaire, H., Minker, J, Nicolas, J.M. (eds.). New York: Plenum pp. 25–72, 1981Google Scholar
  15. 15.
    Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. Proc. 8th ICALP, Acre, Israel, 1981. In: Lecture Notes in Computer Science 115, Berlin, Heidelberg, New York: Springer, pp. 73–85, 1981. Also: Technical Report, Dept. of Computer Science, The Hebrew University of Jerusalem, 1980Google Scholar
  16. 16.
    Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. Technical Report, Department of Computer Science, The Hebrew University of Jerusalem, 1980Google Scholar
  17. 17.
    Beeri, C., Vardi, M.Y.: On the complexity of testing implications of data dependencies. Technical Report, Department of Computer Science, The Hebrew University of Jerusalem, 1980Google Scholar
  18. 18.
    Chandra, A.K., Lewis, H.R., Makowsky, J.A.: Embedded implicational dependencies and their inference problem. Proc. 13th ACM Ann. Symp. Theory Computing, pp. 342–354, 1981Google Scholar
  19. 19.
    Codd, E.F.: Further normalization of the database relational model. In: Data Base Systems. Rustin, R. (ed.). Prentice-Hall, pp. 33–64, 1972Google Scholar
  20. 20.
    Delobel, C.: Semantics of relations and the decomposition process in the relational data model. ACM Trans. Database Syst. 3, 201–222 (1978)Google Scholar
  21. 21.
    Fagin, R.: Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst. 2, 262–278 (1977)Google Scholar
  22. 22.
    Fagin, R.: Horn clauses and databases dependencies. J. ACM 29, 252–285 (1982)Google Scholar
  23. 23.
    Fagin, R., Mendelzon, A.O., Ullman, J.D.: A simplified universal relation assumption and its properties. ACM Trans. Database Syst. 7, 343–360 (1982)Google Scholar
  24. 24.
    Galil, Z.: An almost linear time algorithm for computing a dependency basis in a relational database. J. ACM 29, 96–102 (1982)Google Scholar
  25. 25.
    Hagihara, K., Ito, M., Taiguchi, K., Kasami, T.: Decision problems for multivalued dependencies in relational dependencies. SIAM J. Comput. 8, 247–264 (1979)Google Scholar
  26. 26.
    Mendelzon, A.O.: On axiomatizing multivalued dependencies in relational databases. J. ACM 26, 37–44 (1979)Google Scholar
  27. 27.
    Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 2, 201–222 (1977)Google Scholar
  28. 28.
    Paredaens, J.: The interaction of integrity constraints in an information system. J. Comput. Syst. Sci. 20, 310–329 (1980)Google Scholar
  29. 29.
    Rissanen, J.: Theory of relations for databases — a tutorial survey. Proc. 7th Symp. on Math. Found. of Computer. Science, 1978. In: Lecture Notes in Computer Science 64, Berlin, Heidelberg, New York: Springer, pp. 537–551, 1978Google Scholar
  30. 30.
    Sagiv, Y.: An algorithm for inferring multivalued dependencies with an application to propositional logic. J. ACM 27, 250–262 (1982)Google Scholar
  31. 31.
    Sciore, E.: Some observations on real-world data dependencies. Proc. XP1 Conf., Stony Brook, New York, 1980Google Scholar
  32. 32.
    Scoire, E.: A complete axiomatization of full join dependencies. J. ACM 29, 373–393 (1982)Google Scholar
  33. 33.
    Tarjan, R.E., Yannakakis, M.: Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. Bell Laboratories Technical Report, 1982Google Scholar
  34. 34.
    Vardi, M.Y.: Axiomatization of functional and join dependencies in the relational model. M.Sc. Thesis, The Weizmann Institute of Science, 1980Google Scholar
  35. 35.
    Yannakakis, M, Papadimitriou, C.: Algebraic dependencies. 21st IEEE Ann. Symp. on Found, of Computer Science, pp. 328–332, 1980. (To appear in J. Comput. Syst. Sci.)Google Scholar
  36. 36.
    Zaniolo, C.: Analysis and design of relational schemata for database systems. Technical Report UCLA-ENG-7769, UCLA, 1976Google Scholar
  37. 37.
    Maier, D., Sagiv, Y., Yannakakis, M.: On the complexity of testing implications of functional and join dependencies. J. ACM 28, 680–695 (1981)Google Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Moshe Y. Vardi
    • 1
  1. 1.Department of Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations