Summary
When an “updating” operation occurs on the current state of a data base, one has to ensure the new state obeys the integrity constraints. So, some of them have to be evaluated on this new state. The evaluation of an integrity constraint can be time consuming, but one can improve such an evaluation by taking advantage from the fact that the integrity constraint is satisfied in the current state. Indeed, it is then possible to derive a simplified form of this integrity constraint which is sufficient to evaluate in the new state in order to determine whether the initial constraint is still satisfied in this new state. The purpose of this paper is to present a simplification method yielding such simplified forms for integrity constraints. These simplified forms depend on the nature of the updating operation which is the cause of the state change. The operations of inserting, deleting, updating a tuple in a relation as well as transactions of such operations are considered. The proposed method is based on syntactical criteria and is validated through first order logic. Examples are treated and some aspects of the method application are discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A.V., Sagiv, Y., Ullman, J.D.: Efficient optimization of a class of relational expressions. Presented at the ACM-SIGMOD Conf., Austin, (June, 1978). ACM-TODS (4.4). 1979
Artaud, A., Nicolas, J.-M.: An experimental query system: SYNTEX. Proc. of the International Computing Symposium, Davos, 1973, North-Holland, 1974
Beeri, C., Bernstein, P.A., Goodman, N.: A sophisticate's introduction to data base normalization theory. Proc. of the 4th VLDB Conf. Berlin, 1978
Bernstein, P.A., Blaustein, B.T., Clarke, E.M.: Fast maintenance of semantic integrity assertions using redondant aggregate data. Proc. of the 6th VLDB Conf., Montreal, 1980
Blaustein, B.T.: Enforcing database assertions: Techniques and Applications. Ph. D. Thesis, Cambridge: Harvard University, 1981
Cadiou, J.-M.: On semantic issues in the relational model of data. In: Math. Found. Comput. Sci. Mazurkiewiez, A. (ed.). Vol. 45, Berlin Heidelberg New York: Springer 1976
Chang, C.L., Lee, R.C.T.: Symbolic logic and mechanical theorem proving. Comput. Sci. Appl. Math. Academic Press, 1973
Chang, C.L., DEDUCE 2: Further investigations of deduction in relational data bases. In: [16]
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctives queries in relational Data Banks. Proc. 9th Annual ACM-Symp. Theory Comput. 1976
Date, C.J.: An introduction to data base systems. (Second edition), Addison-Wesley Publ. Comp., 1977
Demolombe, R., Lemaître, M., Nicolas, J.-M.: The language of SYNTEX-2, an implemented relational-tike DBMS. In: Informat. Technol. Moneta, J. (ed.). JCIT3, Amsterdam: North-Holland Pub. Comp., 1978
Enderton, H.B.: A mathematical introduction to logic. Academic Press, 1972
Eswaran, K.P., Chamberlin, D.D.: Functional specifications of a sub-system for Data Base Integrity. Proc. 1st VLDB Conf., Framingham, 1975
Fagin, R.: Horn clauses and database dependencies. Proc. 12th Annual ACM Symp. Theor. Comput., 1980
Gallaire, H.: Impacts of Logic on Databases. Proc. 7th VLDB Conf., Cannes, 1981
Gallaire, H., Minker, J. (eds.): Logic and databases. New York: Plenum Press, 1978
Hammer, M.M., McLeod, D.J.: Semantic integrity in a relational data base system. Proc. 1st VLDB Conf, Framingham, 1975
Hammer, M., Sarin, S.K.: Efficient monitoring of data base assertions. Presented at the ACM- SIGMD 78 Conf., Austin, 1978
Homeier, P.V.: Simplifying Integrity constraints in a relational database: an implementation. Master thesis, Comput. Sci. Dept., Los Angeles: University of California, 1981
Kowalski, R.: Logic for Problem solving. Elsevier North-Holland, New York, 1979
Mendelson, E.: Introduction to mathematical logic. D. van Nostrand, 1964
Nicolas, J.-M., Gallaire, H.: Data base: theory vs. interpretation. In: [16]
Nicolas, J.-M., Yazdanian, K.: Integrity checking in deductive data bases. In: [16]
Nicolas, J.-M.: First order logic formalization for functional, multivalued and mutual dependencies. Proc. ACM-SIGMOD Conf., Austin, 1978
Nicolas, J.-M.: Logical formulas and integrity constraints: the range restricted property and a simplification method. T-R CERT-LBD/79-1, Toulouse, 1979
Nicolas, J.-M.: A property of logical formulas corresponding to integrity constraints on data base relations. Preprints of the Workshop on “Formal bases for data bases”, Toulouse, 1979
Nicolas, J.-M.: Applying a simplification method for integrity constraints to Dependency statements. T.R. CERT, 1979
Palermo, F.P.: A data base search problem: In: Informat. Syst. COINS IV. Tou, J.T. (ed.). New York- Plenum Press, 1974
Pirotte, A.: High level data base query languages. In: [16]
Stonebraker, M.: High level integrity assurance in relational data base management systems. Mem. ERL-M473, University of California, Berkeley, 1974
Stonebraker, M.: Implementation of integrity constraints and views by query modification. Proc. ACM-SIGMOD Conf., San Jose, 1975
Ullman, J.D.: Principles of Database systems. Computer Science Press, Potomac, MD, 1980
Author information
Authors and Affiliations
Additional information
The work reported in this paper was supported by the D.R.E.T.
Rights and permissions
About this article
Cite this article
Nicolas, JM. Logic for improving integrity checking in relational data bases⋆. Acta Informatica 18, 227–253 (1982). https://doi.org/10.1007/BF00263192
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00263192