Using temporary integrity constraints to optimize databases
Integrity constraints are usually assumed to be permanent properties that must be satisfied by any database state. However, there are many situations requiring also temporary constraints, that is, constraints that must hold only for a single database state. In this paper we propose a schema to define both permanent and temporary constraints, that supports efficient constraint checking and semantic query optimization. The proposed schema associates integrity constraints to rules and queries, and it uses methods, that were originally defined for permanent constraints only, to perform constraint checking and semantic query optimization.
Unable to display preview. Download preview PDF.
- 1.C.L. Chang and R.C.T. Lee Symbolic Logic and Mechanical Theorem Proving, Academic Press, Inc., 1973Google Scholar
- 2.H. Decker. Integrity Enforcement in Deductive Databases. In Proc. Int'l Conf. on Expert Database Systems, pages 271–285, 1986.Google Scholar
- 4.R. Kowalski Using Meta-logic to reconcile Reactive with Rational Agents Meta-Logics and Logic Programming, K. Apt and F. Turini editors, MIT Press, 1995.Google Scholar
- 5.A. Y. Levy and Y. Sagiv. Semantic Query Optimization in Datalog Programs. In Proc. of the ACM Symposium on Principles of Database Systems. ACM, New York, USA, 1995.Google Scholar
- 6.P. Maes. Designing Autonomous Agents. MIT, 1991.Google Scholar
- 7.D. Montesi and F. Turini. Knowledge Evolution in Deductive Databases. Proc. International Symposium on Knowledge Retrieval, Use and Storage for Efficiency, Santa Cruz, pp. 59–63, 1995.Google Scholar
- 8.F. Sadri and R. Kowalski. Integrity Checking in Deductive Databases. In P. Hammersley, editor, Proc. Thirteenth Int'l Conf. on Very Large Data Bases, pages 61–69, 1987.Google Scholar
- 9.J. D. Ullman. Database and Knowledge-Base Systems. Computer Science Press, 1989.Google Scholar