Interaction-free multivalued dependency sets

  • Dirk Van Gucht
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 243)

Abstract

Theorem 6 adds another fact to the arsenal of conditions that characterize acyclic join dependencies. In comparison to the other conditions that relate acyclic join dependencies to MVDs, we feel that the concept of interaction-free MVD sets has the advantage of providing a simple semantic characterization.

We conclude by mentioning an open problem: Is there a simple characterization for a set of MVDs which satisfies the conditions specified in Corollary 1?

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABU]
    Aho, A.V., Beeri, C., and Ullman, J.D. “The theory of joins in relational databases. ACM Trans. Database Syst. 4, 3 (Sept. 1979), 297–314.Google Scholar
  2. [ADM1]
    Ausiello, G., D'Atri, A., and Moscarini, M. Minimal coverings of acyclic database schemata. Advances in Database Theory, 2, Gallaire, H., Minker, J., Nicolas, J.M., Eds, Plenum Press, New York, 1983, pp. 27–52.Google Scholar
  3. [ADM2]
    Ausiello, G., D'Atri, A., and Moscarini, M. Chordality properties on graphs and minimal conceptual connections in semantic data models. Proc. 4th Symp. on Princ. of Database Systems, ACM, Portland, Oregon, 1985, 164–170.Google Scholar
  4. [AP]
    Atzeni, P. and Parker, D.S. Properties of acyclic database schemes: an an analysis. XP2 Workshop on Relational Database Theory, Pennsylvania State Univ., University Park, PA, 1981.Google Scholar
  5. [BB]
    Biskup, J. and Bruggeman, H.H. Designing acyclic database schemas. Advances in Database Theory, 2, Gallaire, H., Minker, J., Nicolas, J.M., Eds, Plenum Press, New York, 1983, pp. 3–26.Google Scholar
  6. [BDM]
    Batini, C., D'Atri, A., and Moscarini, M. Formal tools for top-down and bottom-up generation of acyclic relational schemata. Proc. 7th Int. Conference on Graph-theoretic Concepts in Computer Science, Hanser Verlag, Linz, Austria, 1981, pp. 219–229.Google Scholar
  7. [BFMY]
    Beeri, C., Fagin, R., Maier, D., and Yannakakis, M. On the desirability of acyclic database schemes. J. ACM 30, 3 (July 1983), 479–513.Google Scholar
  8. [BK]
    Beeri, C. and Kifer, M. Elimination of intersection anomalies from database schemes. Proc. 2nd Symp. on Princ. of Database Systems, ACM, Atlanta, 1983, pp. 340–351.Google Scholar
  9. [BV]
    Beeri, C. and Vardi, M. On acyclic database decompositions. Information and Control 61, 1984, 75–84.Google Scholar
  10. [DM]
    D'Atri, A. and Moscarini, M. On the recognition and design of acyclic databases. Proc. 3rd Symp. on Princ. of Database Systems, ACM, Waterloo, Ontario, 1984, pp. 1–8.Google Scholar
  11. [Fag1]
    Fagin, R. Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst. 2, 3 (Sept. 1977), 262–278.Google Scholar
  12. [Fag2]
    Fagin, R. Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30, 3 (July 1983), 514–550.Google Scholar
  13. [FMU]
    Fagin, R., Mendelzon, A.O., and Ullman, J.D. A simplified universal relation assumption and its properties. ACM Trans. Database Syst. 7, 3 (Sept. 1982), 343–360.Google Scholar
  14. [GP1]
    Gyssens, M. and Paredaens, J. A decomposition methodology for cyclic databases. Advances in Database Theory, 2, Gallaire, H., Minker, J., Nicolas, J.M., Eds, Plenum Press, New York, 1983. pp. 85–122.Google Scholar
  15. [GP2]
    Gyssens, M. and Paredaens, J. On the decomposition of join dependencies. Proc. 3rd Symp. on Princ. of Database Systems, ACM, Waterloo, Ontario, 1984, pp. 143–153.Google Scholar
  16. [GR]
    Grahne, G. and Raiha, K. Dependency characterizations for acyclic database schemes. Proc. 3rd Symp. on Princ. of Database Systems, ACM Waterloo, Ontario, 1984, pp. 9–18.Google Scholar
  17. [GT]
    Goodman, N. and Tay, Y.C. Synthesizing fourth normal form relations from multivalued dependencies. Harvard Technical Report TR-17-83, Harvard Univ. (May 1983).Google Scholar
  18. [Kat1]
    Katsuno, H. When do non-conflict-free multivalued dependency sets appear? Information Processing Letters 18 (1984), 87–92.Google Scholar
  19. [Kat2]
    Katsuno, H. An extension of conflict-free multivalued dependency sets. ACM Trans. on Database Syst. 9, 2 (June 1984), 309–326.Google Scholar
  20. [Lie]
    Lien, Y.E. On the equivalence of database models. J. ACM 29, 2 (Apr. 1982), 333–362.Google Scholar
  21. [MMS]
    Maier, D., Mendelzon, A.O., and Sagiv, Y. Testing implications of data dependencies. ACM Trans. Database Syst. 4, 4 (Dec. 1979), 455–469.Google Scholar
  22. [MU]
    Maier, D. and Ullman, J. Connections in acyclic hypergraphs. Stanford Technical Report STAN-CS-81-853, Stanford Univ., 1981.Google Scholar
  23. [PV]
    Paredaens, J. and Van Gucht, D. An application of the theory of graphs and hypergraphs to the decompositions of relational database schemes. Proc. of CAAP, 1983, L'Aquila, 1983.Google Scholar
  24. [Ris]
    Rissanen, J. Theory of relations for databases—A tutorial survey. In Proc. 7th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, J. Winkowski, Ed., Springer-Verlag, pp. 537–551.Google Scholar
  25. [Sac1]
    Sacca, D. On the recognition of coverings of acyclic database hypergraphs. Proc. 2nd Symp. on Princ. of Database Systems, ACM, Atlanta, Georgia, 1983, pp. 297–304.Google Scholar
  26. [Sac2]
    Sacca, D. Closures of database hypergraphs. J. ACM 32, 4 (Oct. 1985), 774–803.Google Scholar
  27. [Sci]
    Sciore, E. Real-world MVDs. In Proc. Int. Conf. on Management of Data, ACM, New York, 1981, pp. 121–132.Google Scholar
  28. [TY]
    Tarjan, R.E., and Yannakakis, M. Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13, (1984), 566–579.Google Scholar
  29. [Yan]
    Yannakakis, M. Algorithms for acyclic database schemes. In Proc. 7th Int. Conf. on Very Large Data Bases, ACM, New York, 1981, pp. 82–94.Google Scholar
  30. [YO]
    Yuan, L. and Ozsoyoglu, M. Unifying functional and multivalued dependencies for relational database design. To appear in Proc. 5th Princ. on Database Systems.Google Scholar
  31. [Ull]
    Ullman, J.D. Principles of Database Systems. Rockville, MD: Computer Science Press.Google Scholar
  32. [Zan]
    Zaniolo, C. Analysis and design of relational schemata for database systems. Ph.D. Dissertation, Univ. of California at Los Angeles, July 1976.Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Dirk Van Gucht
    • 1
  1. 1.Computer Science DepartmentIndiana UniversityBloomingtonUSA

Personalised recommendations