Skip to main content

Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2000)

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

Abstract

Based on F-logic, we specify an advanced data model with object-oriented and logic-oriented features that substantially extend the relational approach. For this model we exhibit and study the counterpart to the well-known decomposition of a relation scheme according to a nontrivial nonkey functional dependency. For decomposing a class of a database schema the transformation pivoting is used. Pivoting separates apart some attributes of the class into a newly generated class. This new class is declared to be a subclass of the result class of the so-called pivot attribute. Moreover the pivot attribute provides the link between the original class and the new subclass. We identify the conditions for the result of pivoting being equivalent with its input: the expressive power of path functional dependencies, the validity of the path functional dependency between the pivot attribute and the transplanted attributes, and the validity of the onto-constraint guaranteeing that values for the transplanted attributes can be referenced from the remaining part of the original class.

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. Joachim Biskup. Database schema design theory: Achievements and challenges. In Subhash Bhalla, editor, Proceedings of the 6th International Conference Information Systems and Management of Data, number 1006 in Lecture Notes in Computer Science, pages 14–44, Bombay, 1995. Springer-Verlag.

    Google Scholar 

  2. Joachim Biskup. Grundlagen von Informationssystemen. Vieweg, Braunschweig-Wiesbaden, 1995.

    Google Scholar 

  3. Joachim Biskup. Achievements of relational database schema design theory revisited. In Bernhard Thalheim and Leonid Libkin, editors, Semantics in Databases, number 1358 in Lecture Notes in Computer Science, pages 29–54. Springer-Verlag, Berlin, 1998.

    Chapter  Google Scholar 

  4. Joachim Biskup, Ralf Menzel, and Torsten Polle. Transforming an entity-relationship schema into object-oriented database schemas. In J. Eder and L. A. Kalinichenko, editors, Advances in Databases and Information Systems, Moscow 95, Workshops in Computing, pages 109–136. Springer-Verlag, 1996.

    Google Scholar 

  5. Joachim Biskup, Ralf Menzel, Torsten Polle, and Yehoshua Sagiv. A case study on object-oriented database schema design. In Hele-Mai Haav and Bernhard Thalheim, editors, International Baltic Workshop on Databases and Information Systems, Tallinn, Estonia, 1996.

    Google Scholar 

  6. Joachim Biskup, Ralf Menzel, Torsten Polle, and Yehoshua Sagiv. Decomposition of relationships through pivoting. In Bernhard Thalheim, editor, Proceedings of the 15th International Conference on Conceptual Modeling, number 1157 in Lecture Notes in Computer Science, pages 28–41, Cottbus, Germany, 1996.

    Google Scholar 

  7. Joachim Biskup and Torsten Polle. Constraints in object-oriented databases. Manuscript in preparation, 1999.

    Google Scholar 

  8. Michael Kifer, Georg Lausen, and James Wu. Logical foundations of object-oriented and frame-based languages. Journal of the ACM, 42(4):741–843, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. A. Makowsky and E. V. Ravve. Dependency preserving refinements and the fundamental problem of database design. Data & Knowledge Engineering, 24(3):277–312, 1998.

    Article  MATH  Google Scholar 

  10. Heikki Mannila and Kari-Jouko Räihä. The Design of Relational Databases. Addison-Wesley, Wokingham, England, 1992.

    MATH  Google Scholar 

  11. Torsten Polle. On Representing Relationships in Object-Oriented Databases. PhD thesis, Universität Dortmund, FB Informatik/LS6, D-44221 Dortmund, 1999.

    Google Scholar 

  12. R. Reiter. Equality and domain closure in first-order databases. Journal of the ACM, 27(2): 235–249, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  13. Bernhard Thalheim. Foundations of entity-relationship modeling. Annals of Mathematics and Artificial Intelligence, 1993(7):197–256, 1993.

    Article  MathSciNet  Google Scholar 

  14. Grant E. Weddell. A theory of functional dependencies for object-oriented data models. In Won Kim, Jean-Marie Nicolas, and Shojiro Nishio, editors, Proceedings of the 1st Deductive and Object-Oriented Databases (DOOD’ 89), pages 165–184, Kyoto, Japan, 1989. Elsevier Science Publishers (North-Holland).

    Google Scholar 

  15. Grant E. Weddell. Reasoning about functional dependencies generalized for semantic data models. ACM Transactions on Database Systems, 17(1):32–64, March 1992.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biskup, J., Polle, T. (2000). Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints. In: Schewe, KD., Thalheim, B. (eds) Foundations of Information and Knowledge Systems. FoIKS 2000. Lecture Notes in Computer Science, vol 1762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46564-2_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-46564-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67100-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics