Abstract
The paper proposes a new approach to verification of integrity constraints in relational databases. According to the relational database paradigm, integrity constraints express certain conditions that should be preserved by all instances of a given database. Usually these conditions are checked dynamically, when the database is updated.
A static verification of integrity constraints, based on a technique of elimination of the second-order quantifiers is proposed and investigated in the current paper. The static approach allows one to verify whether given constraints have been preserved already during the database design phase. This results in better system performance, because no runtime checking is required when committing a statically verified transaction to the database.
Supported in part by the Wallenberg Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul S., Hull R., Vianu V. (1996) Foundations of Databases. AddisonWesley Pub. Co.
Ackermann W. (1935) Untersuchungen über das Eliminationsproblem der mathematischen Logik. Mathematische Annalen, 110, 390–413
Chakravarthy U.S., Grant J., Minker J. (1987) Foundations of Semantic Query Optimization for Deductive Databases. In: Minker J. (Ed.) Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Pub., Inc.
Colomb R.M. (1998) Deductive Databases and Their Applications. Taylor & Francis Ltd.
Doherty P., Lukaszewicz W., Szalas A. (1997) Computing Circumscription Revisited. A Reduction Algorithm. Journal of Automated Reasoning, 18, 3:297–336
Doherty P., Lukaszewicz W., Szalas A. (1999) Declarative PTIME Queries for Relational Databases using Quantifier Elimination. Journal of Logic and Computation, 9, 97:737–758
Ebbinghaus H-D., Flum J. (1995) Finite Model Theory. Springer-Verlag
Kachniarz J., Szalas A. (1999) On a Certain Approach to Static Verification of Integrity Constraints in Relational Databases. In: Proc. of Conf. on Applications of Mathematics in Computer Science and Economy, Olsztyn, 123–134. In Polish
Lloyd J., Topor W. (1985) A Basis for Deductive Database Systems. Journal of Logic Programming, 2, 2:93–109
Kowalski R. (1978) Logic for Data Description. In: Minker J. (Ed.) Logic and Data Bases, Plenum Press
Reiter R. (1988) On Integrity Constraints. In: Proc. of the 2nd Conf. on the Theoretical Aspects of Reasoning about Knowledge, 97–111, Morgan Kaufmann Pub., Inc.
Sadri F., Kowalski R. (1987) A Theorem Proving Approach to Database Integrity. In: Minker J. (Ed.) Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Pub., Inc.
Szalas A. (1993) On the Correspondence between Modal and Classical Logic. An Automated Approach. Journal of Logic and Computation, 3:605–620
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kachniarz, J., Szałas, A. (2001). On a Static Verification of Integrity Constraints in Relational Databases. In: Orłowska, E., Szałas, A. (eds) Relational Methods for Computer Science Applications. Studies in Fuzziness and Soft Computing, vol 65. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1828-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1828-4_6
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-662-00362-6
Online ISBN: 978-3-7908-1828-4
eBook Packages: Springer Book Archive