Reactive consistency control in deductive databases

Classical treatment of consistency violations is to back out a database operation or transaction. In applications with large numbers of fairly complex consistency constraints this clearly is an unsatisfactory solution. Instead, if a violation is detected the user should be given a diagnosis of the constraints that failed, a line of reasoning on the cause that could have led to the violation, and suggestions for a repair. The problem is particularly complicated in a deductive database system where failures may be due to an inferred condition rather than simply a stored fact, but the repair can only be applied to the underlying facts. The paper presents a system which provides automated support in such situations. It concentrates on the concepts and ideas underlying the approach and an appropriate system architecture and user guidance, and sketches some of the heuristics used to gain in performance.

[1]  Rodney W. Topor,et al.  Safety and correct translation of relational calculus formulas , 1987, PODS '87.

[2]  Laurent Vieille,et al.  Recursive Axioms in Deductive Databases: The Query/Subquery Approach , 1986, Expert Database Conf..

[3]  John W. Lloyd,et al.  A Basis for Deductive Database Systems , 1985, J. Log. Program..

[4]  Irving L. Traiger,et al.  System R: relational approach to database management , 1976, TODS.

[5]  Wolfgang Nejdl,et al.  Recursive Strategies for Answering Recursive Queries - The RQA/FQI Strategy , 1987, VLDB.

[6]  S. Karl,et al.  Efficient consistency in deductive databases , 1988, ICDT 1988.

[7]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[8]  Ian Lynch,et al.  Software Reference Manual , 1987 .

[9]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

[10]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[11]  John C. Shepherdson,et al.  Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..

[12]  R. Reiter.  On Closed World Data Bases , 1987, Logic and Data Bases.

[13]  Guido Moerkotte,et al.  Inkonsistenzen in deduktiven Datenbanken , 1990 .

[14]  Lawrence J. Henschen,et al.  On compiling queries in recursive first-order databases , 1984, JACM.

[15]  Guido Moerkotte,et al.  Efficient Consistency Control in Deductive Databases , 1988, ICDT.

[16]  Joachim Biskup,et al.  Towards a Schema Design Methodology for Deductive Databases , 1989, MFDBS.

[17]  David W. Stemple,et al.  On the modes and meaning of feedback to transaction designers , 1987, SIGMOD '87.

[18]  Jeffrey D. Ullman,et al.  Implementation of logical query languages for databases , 1985, TODS.

[19]  Chak-Kuen Wong,et al.  Quintary trees: a file structure for multidimensional datbase sytems , 1980, TODS.

[20]  Jack Minker,et al.  Perspectives in Deductive Databases , 1988, J. Log. Program..

[21]  Lawrence J. Henschen,et al.  Compiling Constraint-Checking Programs from First-Order Formulas , 1982, Advances in Data Base Theory.

[22]  Hendrik Decker,et al.  Integrity Enforcement on Deductive Databases , 1986, Expert Database Conf..

[23]  Jean-Marie Nicolas,et al.  Logic for Improving Integrity Checking in Relational Data Bases , 1989 .

[24]  M. Howard Williams,et al.  A Path Finding Method for Constraint Checking in Deductive Databases , 1989, Data Knowl. Eng..

[25]  Jeffrey F. Naughton,et al.  Efficient evaluation of right-, left-, and multi-linear rules , 1989, SIGMOD '89.

[26]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[27]  Liz Sonenberg,et al.  Integrity Constraint Checking in Stratified Databases , 1987, J. Log. Program..

[28]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[29]  François Bry.  Towards an Efficient Evaluation of General Queries , 1989 .

[30]  Vincent Y. Lum,et al.  Multi-attribute retrieval with combined indexes , 1970, Commun. ACM.

[31]  François Bry,et al.  Logical Rewritings for Improving the Evaluation of Quantified Queries , 1989, MFDBS.

[32]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[33]  Robert A. Kowalski,et al.  Integrity Checking in Deductive Databases , 1987, VLDB.

[34]  John W. Lloyd,et al.  A Basis for Deductive Database Systems II , 1986, J. Log. Program..

[35]  Robert A. Kowalski,et al.  A Proof Procedure Using Connection Graphs , 1975, JACM.

[36]  Robert A. Kowalski,et al.  A Theorem-Proving Approach to Database Integrity , 1988, Foundations of Deductive Databases and Logic Programming..

[37]  Won Kim,et al.  Object-Oriented Concepts, Databases, and Applications , 1989 .