Skip to main content

On Multivalued Dependencies in Fixed and Undetermined Universes

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3861))

Abstract

The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe. While axiomatisability and implication problem have been intensely studied with respect to this notion, almost no research has been devoted towards the alternative notion of implication in which the underlying universe of attributes is left undetermined.

Based on a set of common inference rules we reveal all axiomatisations in undetermined universes, and all axiomatisations in fixed universes that indicate the role of the complementation rule as a means of database normalisation. This characterises the expressiveness of several incomplete sets of inference rules. We also establish relationships between axiomatisations in fixed and undetermined universes, and study the time complexity of the implication problem in undetermined universes.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arenas, M., Libkin, L.: A normal form for XML documents. Tansactions on Database Systems (ToDS) 29(1), 195–232 (2004)

    Article  Google Scholar 

  2. Armstrong, W.W.: Dependency structures of database relationships. Information Processing 74, 580–583 (1974)

    MathSciNet  Google Scholar 

  3. Armstrong, W.W., Nakamura, Y., Rudnicki, P.: Armstrong’s axioms. Journal of formalized Mathematics 14 (2002)

    Google Scholar 

  4. Beeri, C.: On the membership problem for functional and multivalued dependencies in relational databases. ACM Tans. Database Syst. 5(3), 241–259 (1980)

    Article  MATH  Google Scholar 

  5. Beeri, C., Bernstein, P.A.: Computational problems related to the design of normal form relational schemata. ACM Tans. Database Syst. 4(1), 30–59 (1979)

    Article  Google Scholar 

  6. Beeri, C., Fagin, R., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. In: Proceedings of the SIGMOD International Conference on Management of Data, pp. 47–61. ACM, New York (1977)

    Google Scholar 

  7. Bernstein, P.: Synthesizing third normal form relations from functional dependencies. ACM Tans. Database Syst. 1(4), 277–298 (1976)

    Article  Google Scholar 

  8. Bernstein, P.A., Goodman, N.: What does Boyce-Codd normal form do? In: Proceedings of the 6th International Conference on Very Large Data Bases, pp. 245–259. IEEE Computer Society, Los Alamitos (1980)

    Google Scholar 

  9. Birkhoff, G.: Lattice Theory. American Mathematical Society, Providence (1940)

    Google Scholar 

  10. Biskup, J.: On the complementation rule for multivalued dependencies in database relations. Acta Informatica 10(3), 297–305 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  11. Biskup, J.: Inferences of multivalued dependencies in fixed and undetermined universes. Theor. Comput. Sci. 10(1), 93–106 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  12. Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM 13(6), 377–387 (1970)

    Article  MATH  Google Scholar 

  13. Codd, E.F.: Further normalization of the database relational model. In: Courant Computer Science Symposia 6: Data Base Systems, pp. 33–64. Prentice-Hall, Englewood Cliffs (1972)

    Google Scholar 

  14. Delobel, C.: Normalisation and hierarchical dependencies in the relational data model. ACM Tans. Database Syst. 3(3), 201–222 (1978)

    Article  Google Scholar 

  15. Diederich, J., Milton, J.: New methods and fast algorithms for database normalization. ACM Tans. Database Syst. 13(3), 339–365 (1988)

    Article  MathSciNet  Google Scholar 

  16. Fagin, R.: Multivalued dependencies and a new normal form for relational databases. ACM Tans. Database Syst. 2(3), 262–278 (1977)

    Article  Google Scholar 

  17. Fagin, R., Vardi, M.Y.: The theory of data dependencies: a survey. In: Mathematics of Information Processing: Proceedings of Symposia in Applied Mathematics, pp. 19–71. American Mathematical Society, Providence (1986)

    Google Scholar 

  18. Fischer, P.C., Saxton, L.V., Thomas, S.J., Van Gucht, D.: Interactions between dependencies and nested relational structures. J. Comput. Syst. Sci. 31(3), 343–354 (1985)

    Article  MATH  Google Scholar 

  19. Galil, Z.: An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM 29(1), 96–102 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  20. Hagihara, K., Ito, M., Taniguchi, K., Kasami, T.: Decision problems for multivalued dependencies in relational databases. SIAM J. Comput. 8(2), 247–264 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  21. Hara, C., Davidson, S.: Reasoning about nested functional dependencies. In: Proceedings of the 18th SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 91–100. ACM, New York (1999)

    Google Scholar 

  22. Hartmann, S., Link, S.: On a problem of Fagin concerning multivalued dependencies in relational databases. Accepted for Theoretical Computer Science (TCS)

    Google Scholar 

  23. Hartmann, S., Link, S.: Multi-valued dependencies in the presence of lists. In: Proceedings of the 23rd SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 330–341. ACM, New York (2004)

    Google Scholar 

  24. Hartmann, S., Link, S., Schewe, K.-D.: Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets. Accepted for Theoretical Computer Science (TCS)

    Google Scholar 

  25. Ito, M., Iwasaki, M., Taniguchi, K., Kasami, K.: Membership problems for data dependencies in relational expressions. Theor. Comput. Sci. 34, 315–335 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  26. Lakshmanan, V., VeniMadhavan, C.: An algebraic theory of functional and multivalued dependencies in relational databases. Theor. Comput. Sci. 54, 103–128 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  27. Levene, M., Loizou, G.: Axiomatisation of functional dependencies in incomplete relations. Theoretical Computer Science (TCS) 206(1-2), 283–300 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  28. Lien, Y.E.: On the equivalence of data models. Journal of the ACM 29(2), 333–363 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  29. Mendelzon, A.: On axiomatising multivalued dependencies in relational databases. J. ACM 26(1), 37–44 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  30. Parker, D., Delobel, C.: Algorithmic applications for a new result on multivalued dependencies. In: Proceedings of the 5th International Conference on Very Large Data Bases, pp. 67–74. IEEE Computer Society, Los Alamitos (1979)

    Chapter  Google Scholar 

  31. Sagiv, Y.: An algorithm for inferring multivalued dependencies with an application to propositional logic. J. ACM 27(2), 250–262 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  32. Tari, Z., Stokes, J., Spaccapietra, S.: Object normal forms and dependency constraints for object-oriented schemata. ACM Tans. Database Syst. 22, 513–569 (1997)

    Article  Google Scholar 

  33. Thalheim, B.: Dependencies in Relational Databases. Teubner, Stuttgart (1991)

    MATH  Google Scholar 

  34. Thalheim, B.: Conceptual treatment of multivalued dependencies. In: Song, I.-Y., Liddle, S.W., Ling, T.-W., Scheuermann, P. (eds.) ER 2003. LNCS, vol. 2813, pp. 363–375. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  35. Vardi, M.: Inferring multivalued dependencies from functional and join dependencies. Acta Inf. 19(2), 305–324 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  36. Vardi, M.Y.: Fundamentals of dependency theory. In: Börger, E. (ed.) Trends in Theoretical Computer Science, pp. 171–224. Computer Science Press (1987)

    Google Scholar 

  37. Vincent, M., Liu, J.: Multivalued dependencies in XML. In: James, A., Younas, M., Lings, B. (eds.) BNCOD 2003. LNCS, vol. 2712, pp. 4–18. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  38. Vincent, M., Liu, J., Liu, C.: A redundancy free 4NF for XML. In: Bellahsène, Z., Chaudhri, A.B., Rahm, E., Rys, M., Unland, R. (eds.) XSym 2003. LNCS, vol. 2824, pp. 254–266. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  39. Weddell, G.: Reasoning about functional dependencies generalized for semantic data models. ACM Tans. Database Syst. 17(1), 32–64 (1992)

    Article  MathSciNet  Google Scholar 

  40. Wijsen, J.: Temporal FDs on complex objects. ACM Tans. Database Syst. 24(1), 127–176 (1999)

    Article  Google Scholar 

  41. Zaniolo, C.: Analysis and Design of Relational Schemata for Database Systems. PhD thesis, UCLA, Tech. Rep. UCLA-ENG-7769 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Link, S. (2006). On Multivalued Dependencies in Fixed and Undetermined Universes. In: Dix, J., Hegner, S.J. (eds) Foundations of Information and Knowledge Systems. FoIKS 2006. Lecture Notes in Computer Science, vol 3861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11663881_15

Download citation

  • DOI: https://doi.org/10.1007/11663881_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31782-1

  • Online ISBN: 978-3-540-31784-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics