Skip to main content
SpringerLink
Log in

Reasoning about Functional and Multi-valued Dependencies in the Presence of Lists

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

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

Abstract

Nested lists are used as a data structure whenever order matters. List types are therefore supported by many advanced data models such as genomic sequence, deductive and object-oriented data models including XML.

It is studied what impact the presence of the finite list type has on the two most important classes of relational dependencies. A finite axiomatisation of functional and multi-valued dependencies in databases supporting base, record and finite list types is presented. In order to capture different data models at a time, an abstract algebraic approach based on nested attributes and subtyping is taken. This algebraic framework together with a new inference rule allowing to derive non-trivial functional dependencies from multi-valued dependencies make the generalisation of the well-known theory from the relational data model natural.

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

Access this chapter

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

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., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. Beeri, C.: On the membership problem for functional and multivalued dependencies in relational databases. Transactions on Database Systems 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. Transactions on Database Systems, 30–59. Association for Computing Machinery (1979)

    Google Scholar 

  8. Beeri, C., Bernstein, P.A., Goodman, N.: A sophisticate’s introduction to database normalization theory. In: Proceedings of 4th International Conference on Very Large Databases, pp. 113–124 (1978)

    Google Scholar 

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

    Google Scholar 

  10. Bernstein, P.A., Goodman, N.: What does Boyce-Codd normal form do? In: Proceedings of the International Conference on Very Large Databases, pp. 245–259 (1980)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Biskup, J.: Inferences of multivalued dependencies in fixed and undetermined universes. Theoretical Computer Science 10(1), 93–106 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  13. Biskup, J.: Database schema design theory:achievements and challenges. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol. 1066, pp. 14–44. Springer, Heidelberg (1996)

    Google Scholar 

  14. Biskup, J.: Achievements of relational database schema design theory revisited. In: Thalheim, B. (ed.) Semantics in Databases 1995. LNCS, vol. 1358, pp. 29–54. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Bry, F., Kröger, P.: A computational biology database digest: data, data analysis, and data management. Distributed and Parallel Databases 13(1), 7–42 (2003)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  18. Codd, E.F.: A relational model of data for large shared data banks. Communications of the ACM, 377–387 (1970)

    Google Scholar 

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

    Google Scholar 

  20. Codd, E.F.: Recent investigations in relational database system. In: Proceedings of the IFIP Conference, pp. 1017–1021 (1974)

    Google Scholar 

  21. Fagin, R.: Multivalued dependencies and a new normal form for relational databases. Association for Computing Machinery 2(3), 262–278 (1977)

    Google Scholar 

  22. Fagin, R.: A normal form for relational databases that is based on domains and keys. Transactions on Database Systems, 387–415 (1981)

    Google Scholar 

  23. Gardarin, G., Cheiney, J.-P., Kiernan, G., Pastre, D., Stora, H.: Managing complex objects in an extensible relational dbms. In: Proceedings of the Fifteenth International Conference on Very Large Data Bases, Amsterdam,The Netherlands, August 22–25, pp. 55–65. Morgan Kaufmann, San Francisco (1989)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  25. Hartmann, S., Link, S.: More functional dependencies for xml. In: Kalinichenko, L.A., Manthey, R., Thalheim, B., Wloka, U. (eds.) ADBIS 2003. LNCS, vol. 2798, pp. 355–369. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  26. Hartmann, S., Link, S.: On functional dependencies in advanced data models. Electronic Notes in Theoretical Computer Science, vol. 84 (2003)

    Google Scholar 

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

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

    Google Scholar 

  29. McKinsey, J., Tarski, A.: On closed elements in closure algebras. Annals of Mathematics 47, 122–146 (1946)

    Article  MathSciNet  Google Scholar 

  30. Mendelzon, A.: On axiomatising multivalued dependencies in relational databases. Journal of the ACM 26(1), 37–44 (1979)

    Article  MATH  MathSciNet  Google Scholar 

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

  32. Naqvi, S., Tsur, S.: A logical language for data and knowledge bases. Computer Science Press, Rockville (1989)

    Google Scholar 

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

    Article  Google Scholar 

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

    MATH  Google Scholar 

  35. Richardson, J.: Supporting lists in a datamodel. In: Proceeding of VLDB, pp. 127–192 (1992)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  37. Seshadri, P., Livny, M., Ramakrishnan, R.: The design and implementation of sequence database system. In: Proceedings of the Twentysecond International Conference on Very Large Data Bases, Mumbai, India (1996)

    Google Scholar 

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

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  41. Tjoa, 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 

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

    Google Scholar 

  43. Vincent, M., Liu, J., Liu, C.: A redundancy free 4nf for xml. In: XML Database Symposium (2003)

    Google Scholar 

  44. W3C. Xml schema part 2: Datatypes (2001), http://www.w3.org/TR/xmlschema-2/#datatype

Download references

Author information

Authors and Affiliations

  1. Information Science Research Centre, Massey University, Private Bag 11222, Palmerston North, New Zealand

    Sven Hartmann, Sebastian Link & Klaus-Dieter Schewe

Authors
  1. Sven Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus-Dieter Schewe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Würzburg, Am Hubland, 97074, Würzburg, Germany

    Dietmar Seipel

  2. Department of Information Systems, Massey University, Information Science Research Centre, PO Box 756, Wellington, New Zealand

    José María Turull-Torres

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). Reasoning about Functional and Multi-valued Dependencies in the Presence of Lists. 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_10

Download citation

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

  • 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

Search

Navigation