Skip to main content

Treating enhanced entity relationship models in a declarative style

  • Conference paper
  • First Online:
Logic Programming

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 592))

Abstract

In this paper we present an approach to represent schema information, application data and integrity constraints in form of a logic program. An information system is specified by an enhanced entity relationship (EER) model which is transformed by means of a one-to-one mapping into a set of ground facts. The application data corresponding to the schema is represented by ground facts called observations. In order to check whether the application data conforms to the given schema, a set of general integrity rules is defined which expresses the dependencies (functional, inclusion and exclusion dependencies) implied by the EER model. In order to check whether the application EER model is a valid EER model a meta EER model is defined. Any application EER diagram appears as an instance of the meta EER diagram and can be represented using observations. This way the same set of integrity constraints can be used to check the conformance between the application data and the application EER diagram, the meta EER diagram and the application EER diagram. Since the representation of the meta EER diagram is an instance of the meta EER diagram, the validity of the meta EER diagram can be checked as well. The resulting logic program is composed of the application data, the application schema, the meta schema, a general set of constraints plus optionally additional application specific constraints and deduction rules.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Apt,H. Blair,A. Walker.“Towards a Theory of Declarative Knowledge”, in Minker (ed.): “Foundations of Deductive Databases and Logic Programming”, Morgan Kaufmann, Los Altos 1987.

    Google Scholar 

  2. F. Bry, H. Decker, R. Manthey: “A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Data bases”, Proceedings of EDBT 88, May 1988, Venice.

    Google Scholar 

  3. P. Chen: “The Entity Relationship Model — Toward a Unified View of Data”, Transaction of Database Systems, 1:1, March 1976.

    Article  Google Scholar 

  4. W.C. Cheng: “Tgif 2.6 — A Xlib based drawing facility under XII”, available via anonymous ftp from export.lcs.mit.edu, May 1991.

    Google Scholar 

  5. E. Codd: “Extending the Database Relational Model to Capture More Meaning”, Transactions of Database Systems, 4:4, December 1979.

    Google Scholar 

  6. P.W. Dart, J.Zobel: “Conceptual Schemas Applied to Deductive Database Systems”, Information Systems, Vol. 13, pp. 273–287, 1988.

    Article  Google Scholar 

  7. R. Elmasri, S.B. Navathe: “Fundamentals of Database Systems”, Benjamin/Cummings, Redwood City, Calif. 1989.

    Google Scholar 

  8. R. Elmasri, J. Weeldreyer, A. Hevner: “The Category Concept: An Extension to the Entity-Relationship Model”, International Journal on Data and Knowledge Engineering, 1:1, May 1985.

    Article  Google Scholar 

  9. G. Gardarin, P. Valduriez, “Relational Databases and Knowledge Bases”, Addison-Wesley, Reading 1989.

    Google Scholar 

  10. V. M. Markowitz, A. Shoshani: “On the Correctness of Representing Extended Entity-Relationship Structures in the Relational Model”, in J. Clifford, B. Lindsay, D. Maier: “Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data”, ACM, New York 1989, pp. 430–439.

    Google Scholar 

  11. T.J. Teorey, D. Yang, J.P. Fry: “A logical Design Methodology for Relational Databases Using the Extended Entity-Relationship Model”, ACM Computing Surveys 18, 2, June 1986.

    Google Scholar 

  12. T.J. Teorey: “Database Modeling and Design: The Entity-Relationship Approach”, Morgan Kaufmann, San Mateo, Calif. 1990.

    Google Scholar 

  13. J. Smith, D. Smith: “Database Abstractions: Aggregation and Generalization”, Transactions of Database Systems, 2:2, June 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kehrer, N., Neumann, G. (1992). Treating enhanced entity relationship models in a declarative style. In: Voronkov, A. (eds) Logic Programming. Lecture Notes in Computer Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55460-2_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-55460-2_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics