The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Checking satisfiability of database constraints is a fundamental problem in database design. In addition, database constraints have to be not only satisfiable but also <it>finitely</it> 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.</p>
object-oriented databases, constraint satisfiability (consistency), recursive schemas, axioms of infinity, equality constraints
A. Formica, "Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas", IEEE Transactions on Knowledge & Data Engineering, vol. 14, no. , pp. 123-139, January/February 2002, doi:10.1109/69.979977
86 ms
(Ver 3.3 (11022016))