This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deductive Entity Relationship Modeling
June 1993 (vol. 5 no. 3)
pp. 439-450

An entity relationship oriented model, that includes the notion of class, together with different types of assertions on classes, is presented. The assertions are used to model IS-A and disjointness relations both between entities and between relationships, part-of relations between entities and relationships, mandatory participation of an entity in a relationship, and interdependencies between the projections of relationships. The semantics of the model are defined in terms of first-order logic, and a sound and complete inference algorithm for such a model is presented. The algorithm is shown to have polynomial time complexity in the case where interdependencies on the projections of relationships are not taken into account. It is suggested that the model and the associated inference capabilities provide a suitable formal basis for designing an effective environment supporting conceptual modeling.

[1] H. Arisawa and T. Miura, "On the properties of extended inclusion dependencies,"Proc. 12th very Large Data Bases (VLDB) Conf., Kyoto, Japan, 1986.
[2] M. Atkinson, F. Bancilhon, D. De Witt, K. Dittrich, D. Mayer, and S. Zdonik, "The object-oriented database system manifesto,"Deductive and Object-Oriented Databases, W. Kim, J. M. Nicholas, and S. Nishio, Eds. Amsterdam, The Netherlands: North Holland, 1990.
[3] P. Atzeni and D. Stott Parker, "Set containment inference and syllogisms,"Theoretical Computer Science, vol. 62, nos. 1-2, 1988.
[4] P. Atzeni and D. Stott Parker, "Formal properties of net-based knowledge representation schemas,"Data Knowl. Eng., vol. 3, no. 3, 1988.
[5] F. Bancilhon, "Object-oriented database systems," inProc. ACM SIGACT-SIGMOD Symp. Principles Database Syst., Austin, TX, Mar. 1988.
[6] C. Batini, M. Lenzerini, and S.B. Navathe, "A Comparative Analysis of Methodologies for Database Schema Integration,"ACM Computing Surveys, Vol. 18, No. 4, Dec. 1986, pp. 323-364.
[7] M. A. Casanova, R. Fagin, and C. H. Papadimitriou, "Inclusion dependencies and their interaction with functional dependencies,"J. Computer Syst. Sci., vol. 28, 1984.
[8] M. A. Casanova and V. M. P. Vidal, "Towards a sound view integration methodology," inProc. Second ACM Symp. Principles of Database Systems (PODS), 1983, pp. 36-47.
[9] S. Ceri, Ed.,Methodology and Tools for Database Design. Amsterdam, The Netherlands: North-Holland, 1983.
[10] A. K. Chandra and M. Y. Vardi, "The implication problem for functional and inclusion dependencies is undecidable,"SIAM J. Computing, vol. 14, 1985.
[11] C. L. Chang and R. C. T. Lee,Symbolic Logic and Mechanical Theorem Proving. New York: Academic, 1973.
[12] W. Chen and D. S. Warren, "C-logic for complex objects." inProc. 1989 ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Philadelphia, PA, Mar. 1989, pp. 369-378.
[13] R. Hull and R. King, "Semantics database modeling: Survey, applications, and research issues,"Comput. Surveys, vol. 19, no. 3, pp. 201-260, Sept. 1987.
[14] P. C. Kannellakis, S. S. Cosmadakis, and M. Y. Vardi, "Unary inclusion dependencies have polynomial time inference problems," inProc. 15th ACM Symp. Theory Comput. Sci., 1983.
[15] M. Kifer and G. Lausen, "F-logic: A higher-order language for reasoning about objects, inheritance, and scheme," inProc. 1989 ACM SIGMOD Int. Conf. on the Management of Data, Portland, OR, 1989, pp. 134-146.
[16] M. Kifer and J. Wu, "A logic for object-oriented programming (Mayer's O-Logic: Revisited)," inProc. Symp. Principles of Database Systems, 1989.
[17] W. Kim, "Object-oriented databases: Definition and research directions,"IEEE Trans. Knowl. Data Eng., vol. 12, no. 3, 1990.
[18] C. Lécluse, P. Richard, and F. Velez, "O2, an object-oriented data model," inProc. 1988 ACM SIGMOD Int. Conf. Management of Data, (Chicago, Illinois, May 1988), pp. 424-433, 1988.
[19] M. Lenzerini, "Covering and disjointness in type networks," inProc. 2nd Int. Conf. Data Engineering, Los Angeles, Feb. 3-5, 1987, pp. 386-393.
[20] M. Lenzerini, "Class hierarchies and their complexity," inAdvances in Database Programming Languages, F. Bancilhon and P. Buneman, Eds. New York: ACM Press, 1990.
[21] M. Lenzerini and P. Nobili, "On the satisfiability of dependency constraints in entity-relationship schemata,"Inform. Syst., vol. 15, no. 4, 1990.
[22] D. McAllester and R. Zabih, "Boolean classes," inProc. ACM Object Oriented Prog. Systems, Languages and Applications (OOPSLA) Conf., 1986.
[23] E. Mendelson,Introduction to Mathematical Logic. Princeton, NJ: Van Nostrand, 1964.
[24] T. J. Teorey, D. Yang, and J. P. Fry, "A logical design methodology for relational databases using the extended entity-relationship model,"ACM Comput. Surveys, vol. 18, no. 2, pp. 197-222, June 1986.
[25] J. D. Ullman, "Database theory: Past and future," inProc. ACM Conf. Principles of Database Syst., 1987.

Index Terms:
deductive entity relationship modelling; assertions; classes; IS-A; disjointness relations; mandatory participation; interdependencies; semantics; first-order logic; inference algorithm; polynomial time complexity; formal basis; conceptual modeling; computational complexity; deductive databases; entity-relationship modelling; inference mechanisms
Citation:
G. Di Battista, M. Lenzerini, "Deductive Entity Relationship Modeling," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 3, pp. 439-450, June 1993, doi:10.1109/69.224196
Usage of this product signifies your acceptance of the Terms of Use.