Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C.L. Chang and R.C.T. Lee Symbolic Logic and Mechanical Theorem Proving, Academic Press, Inc., 1973
H. Decker. Integrity Enforcement in Deductive Databases. In Proc. Int'l Conf. on Expert Database Systems, pages 271–285, 1986.
J. Jaffar and M. Maher. Constraint Logic Programming: a survey. Journal of Logic Programming, 19:20, 503–581, 1994.
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.
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.
P. Maes. Designing Autonomous Agents. MIT, 1991.
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.
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.
J. D. Ullman. Database and Knowledge-Base Systems. Computer Science Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montesi, D., Renso, C., Turini, F. (1996). Using temporary integrity constraints to optimize databases. In: Gabbay, D.M., Ohlbach, H.J. (eds) Practical Reasoning. FAPR 1996. Lecture Notes in Computer Science, vol 1085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61313-7_91
Download citation
DOI: https://doi.org/10.1007/3-540-61313-7_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61313-8
Online ISBN: 978-3-540-68454-1
eBook Packages: Springer Book Archive