Efficient consistency control in deductive databases
In this paper a theoretical framework for efficiently checking the consistency of deductive databases is provided and proven to be correct. Our method is based on focussing on the relevant parts of the database by reasoning forwards from the updates of a transaction, and using this knowledge about real or just possible implicit updates for simplifying the consistency constraints in question. Opposite to the algorithms by Kowalski/Sadri and Lloyd/Topor, we are neither committed to determine the exact set of implicit updates nor to determine a fairly large superset of it by only considering the head literals of deductive rule clauses. Rather, our algorithm unifies these two approaches by allowing to choose any of the above or even intermediate strategies for any step of reasoning forwards. This flexibility renders possible the integration of statistical data and knowledge about access paths into the checking process. Second, deductive rules are organized into a graph to avoid searching for applicable rules in the proof procedure. This graph resembles a connection graph, however, a new method of interpreting it avoids the introduction of new clauses and links.
Unable to display preview. Download preview PDF.
- R. Kowalski, F. Sadri, and P. Soper. Integrity checking in deductive databases. In Proc. 13th Int. Conf. VLDB, 1987. 61–69.Google Scholar
- J.W. Lloyd. Foundations Of Logic Programming. Springer, 1984.Google Scholar
- J.W. Lloyd and R.W. Topor. A basis for deductive database systems. J. Logic Programming, 2, 1985. 93–109.Google Scholar
- J.-M. Nicolas. Logic for improving integrity checking in relational data bases. Acta Informatica, 18, 1982. 227–253.Google Scholar
- R. Reiter. On closed world data bases. in: H. Gallaire and J. Minker (eds.), Logic and Data Bases, Plenum, New York, 1978. 55–76.Google Scholar