Checking Consistency of Database Constraints

Bry, François and Manthey, Rainer (1986): Checking Consistency of Database Constraints. A Logical Basis. 12th International Conference on Very Large Data Bases (VLDB), 25. - 28. August 1986, Kyoto, Japan.

Abstract

This paper addresses the problem of consistency of a set of integrity constraints itself, independent from any state. It is pointed out that database constraints have not only to be consistent, but in addition to be finitely satisfiable. This stronger property reflects that the constraints have to admit a finite set of (stored as well as derivable) facts. As opposed to consistency, being undecidable, finite satisfiability is semidecidable. For efficiency purposes we investigate methods that check both finite satisfiability as well as unsatisfiability . Two different methods are proposed which extend two alternative approaches to refutation.

• Item Type: Conference or Workshop Item (Other)
• Published in: Kambayashi, Yahiko (ed.) . (1986): Very large data bases. Morgan Kaufman: Los Altos, pp. 13-20
• Collections: Mathematics, Computer Science and Statistics
• Subjects: 500 Science > 510 Mathematics
• Signature: UBM:1602/PROC VLDB 86
• Language: English