Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Foundations of Information and Knowledge Systems

FoIKS 2008: Foundations of Information and Knowledge Systems pp 58–77Cite as

Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes

  • Conference paper

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

Abstract

We study inference systems for the combined class of functional and full hierarchical dependencies in relational databases. Two notions of implication are considered: the original version in which the underlying set of attributes is fixed, and the alternative notion in which this set is left undetermined.

The first main result establishes a finite axiomatisation in fixed universes which clarifies the role of the complementation rule in the combined setting. In fact, we identify inference systems that are appropriate in the following sense: full hierarchical dependencies can be inferred without use of the complementation rule at all or with a single application of the complementation rule at the final step of the inference; and functional dependencies can be inferred without any application of the complementation rule. The second main result establishes a finite axiomatisation for functional and full hierarchical dependencies in undetermined universes.

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

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. ACM Trans. Database Syst. 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. Balcázar, J., Baixeries, J.: Characterizations of multivalued dependencies and related expressions. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 306–313. Springer, Heidelberg (2004)

    Google Scholar 

  5. Balcázar, J., Baixeries, J.: Characterization and armstrong relations for degenerate multivalued dependencies using formal concept analysis. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 162–175. Springer, Heidelberg (2005)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  8. Beeri, C., Fagin, R., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. In: SIGMOD Conference, pp. 47–61. ACM, New York (1977)

    Google Scholar 

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

    Article  Google Scholar 

  10. Bernstein, P.A., Goodman, N.: What does Boyce-Codd normal form do? In: VLDB Conference, pp. 245–259. IEEE Computer Society, Los Alamitos (1980)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. Biskup, J.: Grundlagen von Informationssystemen. Vieweg (1995)

    Google Scholar 

  14. Biskup, J., Dayal, U., Bernstein, P.: Synthesizing independent database schemas. In: SIGMOD Conference, pp. 143–151 (1979)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  17. Deutsch, A., Popa, L., Tannen, V.: Query reformulation with constraints. SIGMOD Record 35(1), 65–73 (2006)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  19. 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 

  20. 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 

  21. 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 

  22. Hara, C., Davidson, S.: Reasoning about nested functional dependencies. In: PODS Conference, pp. 91–100. ACM, New York (1999)

    Chapter  Google Scholar 

  23. Hartmann, S., Köhler, H., Link, S.: Full hierarchical dependencies in fixed and undetermined universes. Ann. Math. Artif. Intell. 50(1–2), 195–226 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  24. Hartmann, S., Link, S.: On a problem of Fagin concerning multivalued dependencies in relational databases. Theor. Comput. Sci. 353(1–3), 53–62 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  25. Hartmann, S., Link, S., Schewe, K.-D.: Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets. Theor. Comput. Sci. 355(2), 167–196 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  26. Hartmann, S., Link, S., Schewe, K.-D.: Functional and multivalued dependencies in nested databases generated by record and list constructor. Ann. Math. Artif. Intell. 46(1–2), 114–164 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  27. 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 

  28. Levene, M., Loizou, G.: Axiomatisation of functional dependencies in incomplete relations. Theor. Comput. Sci. 206(1–2), 283–300 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  29. Levene, M., Vincent, M.: Justification for inclusion dependency normal form. IEEE Trans. Knowl. Data Eng. 12(2), 281–291 (2000)

    Article  Google Scholar 

  30. Link, S.: On multivalued dependencies in fixed and undetermined universes. In: Dix, J., Hegner, S.J. (eds.) FoIKS 2006. LNCS, vol. 3861, pp. 257–276. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  31. Link, S.: On the logical implication of multivalued dependencies with null values. In: Twelfth Computing: The Australasian Theory Symposium. Conferences in Research and Practice in Information Technology, vol. 51, pp. 113–122 (2006)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  33. Paredaens, J., De Bra, P., Gyssens, M., Van Gucht, D.: The Structure of the Relational Database Model. Springer, Heidelberg (1989)

    MATH  Google Scholar 

  34. 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 

  35. Sagiv, Y., Delobel, C., Parker Jr., D.S., Fagin, R.: An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM 28(3), 435–453 (1981)

    Article  MathSciNet  Google Scholar 

  36. Sözat, M., Yazici, A.: A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations. ACM Fuzzy Sets and Systems 117(2), 161–181 (2001)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  38. Thalheim, B.: Dependencies in Relational Databases. Teubner-Verlag (1991)

    Google Scholar 

  39. 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)

    Google Scholar 

  40. 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.) Database and XML Technologies. LNCS, vol. 2824, pp. 254–266. Springer, Heidelberg (2003)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  43. Zaniolo, C., Melkanoff, M.: On the design of relational database schemata. ACM Trans. Database Syst. 6(1), 1–47 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Dortmund, D-44221, Dortmund, Germany

    Joachim Biskup

  2. Information Science Research Centre, Massey University, New Zealand

    Sebastian Link

Authors
  1. Joachim Biskup
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sven Hartmann Gabriele Kern-Isberner

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biskup, J., Link, S. (2008). Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes. In: Hartmann, S., Kern-Isberner, G. (eds) Foundations of Information and Knowledge Systems. FoIKS 2008. Lecture Notes in Computer Science, vol 4932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77684-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77684-0_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77683-3

  • Online ISBN: 978-3-540-77684-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation