Satisfiability of object-oriented database constraints with set and bag attributes

The definition of methodologies for checking database constraint satisfiability, i.e., the absence of contradictions independently of any database state, is a fundamental and critical problem that has been marginally addressed in the literature. In this paper, a sound and complete algorithm is proposed for checking the satisfiability of a specific class of database integrity constraints in a simplified object-oriented model. Such a class includes cardinality constraints, set and bag attributes, and explicit integrity constraints involving comparison operators. The algorithm, conceived to support database schema design, allows the designer to distinguish among five different kinds of contradictions, each identified by an ad hoc procedure.

[1]  Diego Calvanese,et al.  Logics for Databases and Infor-mation Systems , 1998 .

[2]  Diego Calvanese,et al.  Making object-oriented schemas more expressive , 1994, PODS '94.

[3]  Jean-Marie Nicolas,et al.  Logic and Databases: An Assessment , 1990, ICDT.

[4]  Michele Missikoff,et al.  An efficient method for checking object-oriented database schema correctness , 1998, TODS.

[5]  Michele Missikoff,et al.  Integrity Constraints Representation in Object-Oriented Databases , 1992, CIKM.

[6]  Catriel Beeri,et al.  Inheritance Hierarchy Design in Object-Oriented Databases , 1999, Data Knowl. Eng..

[7]  Michele Missikoff,et al.  Object-Oriented Database Schema Analysis and Inheritance Processing: A Graphtheoretic Approach , 1997, Data Knowl. Eng..

[8]  Tova Milo,et al.  Towards Tractable Algebras for Bags , 1996, J. Comput. Syst. Sci..

[9]  Anna Formica,et al.  Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas , 2002, IEEE Trans. Knowl. Data Eng..

[10]  Grant E. Weddell,et al.  Path Constraints for Graph-Based Data Models: Towards a Unified Theory of Typing Constraints, Equations, and Functional Dependencies , 1991, DOOD.

[11]  Tova Milo,et al.  Calculi for Bags and their Complexity , 1993, DBPL.

[12]  Maurizio Lenzerini,et al.  On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata , 1987, VLDB.

[13]  Randy H. Katz,et al.  An extended relational algebra with control over duplicate elimination , 1982, PODS.

[14]  Domenico Beneventano,et al.  Consistency Checking in Complex Object Database Schemata with Integrity Constraints , 1995, DBPL.

[15]  Moshe Y. Vardi,et al.  The Implication Problem for Functional and Inclusion Dependencies is Undecidable , 1985, SIAM J. Comput..

[16]  Wenfei Fan,et al.  On XML integrity constraints in the presence of DTDs , 2001, JACM.

[17]  Norbert Eisinger,et al.  SIC: Satisfiability Checking for Integrity Constraints , 1998, DDLP.

[18]  Grant E. Weddell,et al.  Reasoning About Equations and Functional Dependencies on Complex Objects , 1994, IEEE Trans. Knowl. Data Eng..

[19]  François Bry,et al.  Checking Consistency of Database Constraints: a Logical Basis , 1986, VLDB.

[20]  Z. Meral Özsoyoglu,et al.  Implication and Referential Constraints: A New Formal Reasoning , 1997, IEEE Trans. Knowl. Data Eng..

[21]  Joseph Albert,et al.  Algebraic Properties of Bag Data Types , 1991, VLDB.

[22]  Diego Calvanese,et al.  Description Logics for Conceptual Data Modeling , 1998, Logics for Databases and Information Systems.

[23]  Catriel Beeri,et al.  A Formal Approach to Object-Oriented Databases , 1990, Data Knowl. Eng..

[24]  Michele Missikoff,et al.  Safe rapid prototyping of object-oriented database applications , 1994, Proceedings of IEEE 5th International Workshop on Rapid System Prototyping.