Skip to main content

Weak Functional Dependencies in Higher-Order Datamodels

–The Case of the Union Constructor–

  • Conference paper
Foundations of Information and Knowledge Systems (FoIKS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2942))

Abstract

We present an axiomatisation for weak functional dependencies, i.e. disjunctions of functional dependencies, in the presence of several constructors for complex values. These constructors are the tuple constructor, the set-constructor, an optionality constructor, and a union constructor. The theory is smooth and rather uniform, if the union-constructor is absent. Its presence, however, complicates all results and proofs significantly. The reason for this is that the union-constructor comes alomg with non-trivial restructuring rules. In particular, if the union-constructor is absent, a subset of the rules is complete for the implication of ordinary functional dependencies, but this does not hold, if the union constructor is present.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann Publishers, San Francisco (2000)

    Google Scholar 

  2. Abiteboul, S., Hull, R.: Restructuring hierarchical database objects. Theoretical Computer Science (1988)

    Google Scholar 

  3. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  4. Arenas, M., Libkin, L.: A normal form for XML documents. In: PODS 2002, ACM, New York (2002)

    Google Scholar 

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

    Google Scholar 

  6. Batini, C., Ceri, S., Navathe, S.B.: Conceptual Database Design: An Entity-Relationship Approach. Benjamin Cummings (1992)

    Google Scholar 

  7. Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.: Keys for XML. In: Tenth WWW Conference, IEEE, Los Alamitos (2001)

    Google Scholar 

  8. Chen, P.P.: The entity-relationship model: Towards a unified view of data. ACM Transactions Database Systems 1, 9–36 (1976)

    Article  Google Scholar 

  9. Chen, P.P.: English sentence structure and entity-relationship diagrams. Information Science 29, 127–149 (1983)

    Article  Google Scholar 

  10. Fan, W., Libkin, L.: On XML integrity constraints in the presence of DTDs. In: PODS 2001, ACM, New York (2001)

    Google Scholar 

  11. Fan, W., Siméon, J.: Integrity constraints for XML. In: PODS 2000, ACM, New York (2000)

    Google Scholar 

  12. Hartmann, S.: Decomposing relationship types by pivoting and schema equivalence. Data & Knowledge Engineering 39, 75–99 (2001)

    Article  MATH  Google Scholar 

  13. Hartmann, S., Link, S.: Reasoning about functional dependencies in an abstract data model. Electronic Notes in Theoretical Computer Science 84 (2003)

    Google Scholar 

  14. Hartmann, S., Link, S., Schewe, K.-D.: Capturing functional dependencies in the higher-order entity relationship model. Tech. Rep. 5/2003, Massey University, Department of Information Systems (2003)

    Google Scholar 

  15. Hartmann, S., Link, S., Schewe, K.-D.: Generalizing Boyce-Codd normal form to conceptual databases. In: Pre-Proceedings of the 13th European-Japanese Conference on Information Modeling and Knowledge Bases, pp. 93–110 (2003)

    Google Scholar 

  16. Hull, R., King, R.: Semantic database modeling: Survey, applications and research issues. ACM Computing Surveys 19(3) (1987)

    Google Scholar 

  17. Mok, W.Y., Ng, Y.K., Embley, D.W.: A normal form for precisely charachterizing redundancy in nested relations. Transactions on Database Systems 21, 77–106 (1996)

    Article  Google Scholar 

  18. Özsoyoglu, Z.M., Yuan, L.Y.: A new normal form for nested relations. Transactions on Database Systems 12, 111–136 (1987)

    Article  Google Scholar 

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

    MATH  Google Scholar 

  20. Schewe, K.-D., Thalheim, B.F.: Fundamental concepts of object oriented databases. Acta Cybernetica 11(4), 49–85 (1993)

    MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    MATH  Google Scholar 

  23. Thalheim, B.: Foundations of entity-relationship modeling. Annals of Mathematics and Artificial Intelligence 6, 197–256 (1992)

    MathSciNet  Google Scholar 

  24. Thalheim, B.: Entity-Relationship Modeling: Foundations of Database Technology. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  25. Tjoa, A.M., Berger, L.: Transformation of requirement specifications expressed in natural language into an eer model. In: Elmasri, R.A., Kouramajian, V., Thalheim, B. (eds.) ER 1993. LNCS, vol. 823, Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  26. Vincent, M.: The semantic justification for normal forms in relational database design. PhD thesis, Monash University, Melbourne, Australia (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartmann, S., Link, S., Schewe, KD. (2004). Weak Functional Dependencies in Higher-Order Datamodels. In: Seipel, D., Turull-Torres, J.M. (eds) Foundations of Information and Knowledge Systems. FoIKS 2004. Lecture Notes in Computer Science, vol 2942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24627-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24627-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20965-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics