Theorem Proving Techniques for View Deletion in Databases

Abstract

In this paper, we show how techniques from first-order theorem proving can be used for efficient deductive database updates. The key idea is to transform the given database, together with the update request, into a (disjunctive) logic program and to apply the hyper-tableau calculus (Baumgartner et al., 1996) to solve the original update problem. The… (More)
DOI: 10.1006/jsco.1999.0358

Topics

Cite this paper

@article{Aravindan2000TheoremPT, title={Theorem Proving Techniques for View Deletion in Databases}, author={Chandrabose Aravindan and Peter Baumgartner}, journal={J. Symb. Comput.}, year={2000}, volume={29}, pages={119-147} }