This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas
January/February 2002 (vol. 14 no. 1)
pp. 123-139

Abstract—Checking satisfiability of database constraints is a fundamental problem in database design. In addition, database constraints have to be not only satisfiable but also finitely satisfiable. This problem is generally addressed by using theorem provers that, being developed for first order logic formulas, are based on semidecidable procedures. Furthermore, even in simple cases, theorem provers are quite inefficient in dealing with comparison operators such as, for instance, the equality. In this paper, a decidable, sound, and complete method for checking finite satisfiability of a specific class of integrity constraints for object-oriented databases, including the equality constraints, is presented. The method, that is based on a graph-theoretic approach, has exponential complexity in the worst case, rarely occurring in practice.

[1] P. Atzeni and D.S. ParkerJr., “Formal Properties of Net-Based Knowledge Representation Schemes,” Data&Knowledge Eng. 3, pp. 137-147, 1988.
[2] J. Banerjee, H. Chou, J.F. Garza, W. Kim, D. Woelk, N. Ballou, and H.J. Kim, “Data Model Issues for Object-Oriented Applications,” Readings in Object-Oriented Database Systems, S.B. Zdonik and D. Maier, eds., pp. 197-208, 1990.
[3] C. Beeri, "A Formal Approach to Object-Oriented Databases," Data and Knowledge Eng., vol. 5, no. 4, pp. 353-382, 1990.
[4] C. Beeri, A. Formica, and M. Missikoff, “Inheritance Hierarchy Design in Object-Oriented Databases,” Data&Knowledge Eng. (DKE), vol. 30, no. 3, pp. 191-216, July 1999.
[5] D. Beneventano, S. Bergamaschi, S. Lodi, and C. Sartori, “Consistency Checking in Complex Object Database Schemata with Integrity Constraints,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 4, July/Aug. 1998.
[6] F. Bry, N. Eisinger, H. Schutz, and S. Torge, “SIC: Satisfiability Checking for Integrity Constraints,” Proc. Joint Int'l Conf. and Symp. Logic Programming, 1998.
[7] F. Bry and R. Manthey, “Checking Consistency of Database Constraints: A Logical Basis,” Proc. 12th Int'l Conf. Very Large Data Bases (VLDB '86), Aug. 1986.
[8] F. Bry and R. Manthey, “Proving Finite Satisfiability of Deductive Databases,” Proc. Conf. Logic and Computer Science, 1987.
[9] L. Cardelli,“A semantics of multiple inheritance,” Information and Computation, vol. 76, pp. 138-164, 1988.
[10] R.G.G. Cattell, D.K. Barry et al. , Object Database Standard—ODMG 2.0. Morgan Kaufmann, 1997.
[11] C.L. Chang and R.C.T. Lee,Symbolic Logic and Mechanical Theorem Proving.New York: Academic Press, 1973.
[12] D. Calvanese and M. Lenzerini, “Making Object-Oriented Schemes More Expressive,” Proc. 13th Int'l Symp. Principles of Database Systems (PODS '94), May 1994.
[13] N. Coburn and G.E. Weddel, “Path Constraints for Graph-Based Data Models: Towards a Unified Theory of Typing Constraints, Equations, and Functional Dependencies,” Proc. Int'l Conf. Deductive and Object-Oriented Databases (DOOD '91), 1991.
[14] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[15] G. Di Battista and M. Lenzerini, “Deductive Entity Relationship Modeling,” IEEE Trans. Knowledge and Data Eng., vol. 5, no. 3, June 1993.
[16] R. Fagin and M.Y. Vardi, “The Theory of Data Dependency—An Overview,” Proc. Int'l Colloquium Automata, Languages, and Programming, 1984.
[17] A. Formica, H.D. Groger, and M. Missikoff, “Object-Oriented Database Schema Analysis and Inheritance Processing: A Graph-Theoretic Approach,” Data&Knowledge Eng., vol. 24, no. 2, pp. 157-181, 1997.
[18] A. Formica, H.D. Groger, and M. Missikoff, “An Efficient Method For Checking Object-Oriented Database Schema Correctness,” ACM Trans. Database Systems (TODS), vol. 23, no. 3, pp. 333-369, Sept. 1998.
[19] A. Formica and M. Missikoff, “Integrity Constraints Representation in Object-Oriented Databases,” Information and Knowledge Management, T.W. Finin, C.K. Nicholas, and Y. Yesha, eds., pp. 69-85, 1993.
[20] A. Formica, M. Missikoff, and R. Terenzi, “Constraint Satisfiability in Object-Oriented Databases,” Proc. East-West Database Workshop, J. Eder and L.A. Kalinichenko, eds., pp. 48-60, 1995.
[21] H. Gallaire and J.M. Nicholas, “Logic and Databases: An Assessment,” Proc. Third Int'l Conf. Database Theory (ICDT '90), S. Abiteboul and P. Kanellakis, eds., 1990.
[22] M.R. Genesereth and N.J. Nilsson,Logical foundations of artificial intelligence, Morgan Kaufmann, Los Altos, CA, 1987.
[23] M. Hammer and D.J. McLeod, “A Framework for Data Base Semantic Integrity,” Proc. Second Int'l Conf. Software Eng., pp. 498-504, Oct. 1976.
[24] S.N. Khoshafian and G.P. Copeland, “Object Identity,” Proc. Int'l Conf. Object-Oriented Programming Systems Languages and Applications (OOPSLA '86), Sept. 1986.
[25] S. Khoshafian and R. Abnous, Object-Orientation—Concepts, Languages, Databases, User-Interfaces. New York: Wiley, 1990.
[26] W. Kim, “Object-Oriented Databases: Definition and Research Directions,” IEEE Trans. Knowledge and Data Eng., vol. 2, no. 3, pp. 327-341, Sept. 1990.
[27] M. Kifer, W. Kim, and Y. Sagiv, “Querying Object-Oriented Databases,” Proc. ACM SIGMOD Conf., 1992.
[28] R. Kowalski, F. Sadri, and P. Soper, “Integrity Checking in Deductive Databases,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB '87), 1987.
[29] M. Lenzerini and P. Nobili, “On the Satisfiability of Dependency Constraints in Entity-Relationship Schemata,” Information Systems, vol. 15, no. 4, pp. 453-461, 1990.
[30] M. Missikoff and M. Toiati, “MOSAICO—A System for Conceptual Modeling and Rapid Prototyping of Object-Oriented Database Applications,” Proc. ACM SIGMOD Conf., p. 508, 1994.
[31] M. Missikoff and M. Toiati, “Safe Rapid Prototyping of Object-Oriented Database Applications,” Proc. IEEE Int'l Workshop Rapid System Prototyping, 1994.
[32] J. Mylopoulos, P. Bernstein, and H. Wong, “A Language Facility for Designing Interactive, Database-Intensive Applications,” ACM Trans. Database Systems, vol. 5, no. 2, 1980.
[33] B. Nebel, “Terminological Cycles: Semantics and Computational Properties,” Principles of Semantic Networks, J. Sowa, ed., 1991.
[34] K. Truemper, Effective Logic Computation. New York: Wiley-Interscience, 1998.
[35] D.C. Tsichritzis and F.H. Lochovsky,Data Models.Englewood Cliffs, N.J.: Prentice-Hall, 1982.
[36] S.D. Urban and L.M.L. Delcambre, “Constraint Analysis for Specifying Perspectives of Class Objects,” Proc. Fifth Int'l Conf. Data Eng., 1989.
[37] J. Ullman, Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, 1988.
[38] A. Yahia, L. Lakhal, R. Cicchetti, and J.P. Bordat;, “iO2 An Algorithmic Method for Building Inheritance Graphs in Object Database Design,” Proc. Entity-Relationship Conf. (ER '96), 1996.
[39] X. Zhang and Z.M. Ozsoyoglu, “Implication and Referential Constraints: A New Formal Reasoning,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 6, Nov./Dec. 1997.
[40] J. Zhang and H. Zhang, “System Description: Generating Models by Sem,” Automated Deduction, CADE-13, M.A. McRobbie and J.K. Slaney, eds., 1996.

Index Terms:
object-oriented databases, constraint satisfiability (consistency), recursive schemas, axioms of infinity,equality constraints
Citation:
A. Formica, "Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas," IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 1, pp. 123-139, Jan.-Feb. 2002, doi:10.1109/69.979977
Usage of this product signifies your acceptance of the Terms of Use.