Skip to main content
SpringerLink
Log in
Book cover

Symposium on Mathematical Fundamentals of Database Systems

MFDBS 1989: MFDBS 89 pp 237–253Cite as

Equivalent schemes in semantic, nested relational, and relational database models

  • Conference paper
  • First Online:

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

Abstract

This paper presents formal mappings between semantic, nested relational, and relational database schemes and instances. It is shown that the corresponding schemes are equivalent w.r.t. the notion of information capacity [Hul 86], i.e., the mappings between the corresponding sets of instances are bijections. The examinations are done in the framework of the database model EXTREM (EXTended RElational Model) which integrates four types of database models: semantic (the IFO model [AbH

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6 References

  1. Atzeni, P.; Ausiello, G.; Batini, C.; Moscarini, M., Inclusion and equivalence between relational database schemata. Theoretical Computer Science, 19, 1982, 267–285

    Article  Google Scholar 

  2. Abiteboul, S.; Bidoit, N.. Non First Normal Form Relations: An Algebra Allowing Data Restructuring. JCSS, 33, 1986, 361–393

    Google Scholar 

  3. Abiteboul, S.; Hull, R.. IFO: A Formal Semantic Database Model. ACM TODS, 12, 4, 1987, 525–565

    Google Scholar 

  4. Biskup, J.. A formal approach to null values in database relations. Advances in Data Base Theory, 1, 1981, 299–341

    Google Scholar 

  5. Beeri, C.; Mendelzon, A.O.; Sagiv, Y.; Ullman, J.D.. Equivalence of relational database schemes. SIAM J. Comput., 10, 2, 1981, 352–370

    Google Scholar 

  6. Biskup, J.; Räsch, U.. The equivalence problem for relational database schemes. Proceedings of the Symposium on Mathematical Fundamentals of Database Systems, 1, 1987, Lecture Notes in Computer Science 305, 42–70

    Google Scholar 

  7. Chen, P.P.. The Entity-Relationship Model — Toward a Unified View of Data. ACM TODS, 1, 1, March 1976, 9–36

    Google Scholar 

  8. Codd, E.F.. Extending the Database Relational Model to Capture More Meaning. ACM TODS, 4, 4, December 1979, 397–434

    Article  Google Scholar 

  9. Codd, E.F.. Missing Information (Applicable and Inapplicable) in Relational Databases. ACM SIGMOD RECORD, 15, 4, 1986, 53–78

    Google Scholar 

  10. Heuer,A.. Exakte Charakterisierung eines semantischen Datenmodells und seiner Operationen durch relationale Konzepte. Dissertation, Institut für Informatik, TU Clausthal, 1988

    Google Scholar 

  11. Heuer,A.. An Object Algebra and its Connection to the NF2-and Flat Relational Algebra. In:Informatik-Bericht 88/4, Institut für Informatik, TU Clausthal, Workshop on Relational Databases and their Extensions, 1988

    Google Scholar 

  12. Heuer,A.. A Data Model for Complex Objects Based on a Semantic Database Model and Nested Relations. To appear: Proc.Int. Workshop on Nested Relations and Complex Objects

    Google Scholar 

  13. Hull, R.; King, R.. Semantic Database Modeling: Survey, Applications, and Research Issues. ACM Computing Surveys, 19, 3, 1987, 201–260

    Article  Google Scholar 

  14. Hull, R.; Yap, C.K.. The Format Model: A Theory of Database Organization. JACM, 31, 3, 1984, 518–537

    MathSciNet  Google Scholar 

  15. Hull, R.. Relative Information Capacity of Simple Relational Database Schemata. SIAM J. Comput., 15, 3, 1986, 856–886

    Google Scholar 

  16. Jacobs, B.E.. Applied Database Logic. Prentice-Hall, Englewood Cliffs, 1985

    Google Scholar 

  17. Jaeschke, G.; Schek, H.-J.. Remarks on the Algebra of Non First Normal Form Relations. ACM PODS, 1, 1982, 124–138

    Google Scholar 

  18. Kanellakis,P.C.; Cosmadakis,S.S.; Vardi,M.Y.. Unary Inclusion Dependencies have Polynomial Time Inference Problems. Proc. ACM Symp. on Theory of Computing, 1983, 264–277

    Google Scholar 

  19. Lien, Y.E.. On the equivalence of database models. JACM, 29, 2, 1982, 333–362

    Google Scholar 

  20. Lyngbaek, P.; Vianu, V.. Mapping a Semantic Database Model to the Relational Model. ACM SIGMOD RECORD, 16, 3, 1987, 132–142

    Google Scholar 

  21. Maier,D.. The Theory of Relational Databases. London, 1983

    Google Scholar 

  22. Paredaens, J.. The interaction of integrity constraints in an information system. JCSS, 20, 1980, 310–329

    Google Scholar 

  23. Schek, H.-J.; Scholl, M.H.. The Relational Model with Relation-valued Attributes. Information Systems, 11, 2, 137–147, 1986

    Article  Google Scholar 

  24. Ullman,J.D.. Principles of Database Systems. London 1983, 2nd Edition

    Google Scholar 

  25. Yannakakis, M.; Papadimitriou, C.H.. Algebraic dependencies. JCSS, 25, 1982, 2–41

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, TU Clausthal, Erzstr. 1, D-3392, Clausthal-Zellerfeld, West Germany

    Andreas Heuer

Authors
  1. Andreas Heuer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

János Demetrovics Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heuer, A. (1989). Equivalent schemes in semantic, nested relational, and relational database models. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-51251-9_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51251-6

  • Online ISBN: 978-3-540-46182-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation