Abstract
This paper is concerned with the use of general laws in data bases. It consists of two main parts respectively devoted to state laws and to transition laws. Some of the state laws are used as derivation rules while others are used as integrity rules. Integrity rules as well as derivation rules can be treated in many ways which are presented. For each such method, the actions to be undertaken when querying, adding, suppressing and updating information in the data base are studied. For transition laws, a formalism is proposed which enables them to be handled in the same way as integrity rules stemming from state laws. The self-consistency of transition laws is also discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abrial, J. R. [1974] Data Semantics, Proceedings of Working Conference on Management of Data, Cargese, France, April 1974, 1–59.
Cadiou, J. M. [1976] On Semantic Issues in the Relational Model of Data, In Mathematical Foundations of Computer Science (A. Mazurkiewiz, Ed.), Vol, 45, Springer-Verlag, 1976, 23–38.
Chamberlin, D.D. et al.[1976] SEQUEL2: A Unified Approach to Data Definition, Manipulation, and Control, IBM Journal of Research and development 20, 6 (Nov. 1976), 560–575.
Chang, C. L. and Lee, R.C.T. [1973] Symbolic Logic and Mechanical Theorem Proving, Computer Science and Applied Mathematics, Academic Press, Inc., New York (1973).
Date, C. J. [1975] An Introduction to Data Base Systems, Addison-Wesley, Reading, Mass., 1975.
Demolombe, R. and Nicolas, J. M. [1976] Knowledge Representation and Evolutivity in Data Base Management Systems, T-Report CERT-LBD-76/5, Toulouse, France (Nov. 1976).
Demolombe, R. and Nicolas, J. M. [1977] Normal Form and Irreducible Relations. Atomic Relations: A New Proposal, T-Report CERT-LBD-77/2, Toulouse, France (Oct. 1977).
Eswaran, K. P. and Chamberlin, D. D. [1975] Functional Specifications of a Subsystem for Data Base Integrity, Proceedings of the Int. Conference on VLDB, Framington, Mass., Sept. 1975, 48–68.
Hammer, M. M. and McLeod, D. J. [1975] Semantic Integrity in a Relational Data Base System, Proceedings of the Int. Conference on VLDB, Framington, Mass., Sept. 1975, 25–47.
Hewitt, C. [1971] “PLANNER: A Language for Providing Theorem and Manipulating Models in Robots,” Ph.D. Thesis, M.I.T., Cambridge, Mass., Feb. 1971.
Kowalski, R. A. [1974] Logic for Problem Solving, Memo. 75, Department of Computational Logic, University of Edinburgh, (March 1974).
Kowalski, R. A. [1976] Algorithm = Logic + Control, Imperial College, London, (Nov. 1976).
Minker, J. and VanderBrug, G. [1975] State Space Problem Resolution and Theorem Proving — Some Relationships, CACM (Feb. 1975), 107–115.
Nicolas, J. M. and Gallaire, H. [1978] Data Base: Theory vs. Interpretation, In Logic and Data Bases (H. Gallaire and J. Minker, Eds,), Plenum Press, New York, 1978, 33–54.
Stonebraker, M. [1974] High Level Integrity Assurance in Relational Data Base Management Systems, Mem. ERL-M473; University of California, Berkeley, California, August 1974.
Stonebraker, M. [1975] Implementation of Integrity Constraints and Views by Query Modification, Proceedings of the 1975 SIGMOD Conference, San Jose, California, May 1975, 65–78.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Plenum Press, New York
About this chapter
Cite this chapter
Nicolas, J.M., Yazdanian, K. (1978). Integrity Checking in Deductive Data Bases. In: Gallaire, H., Minker, J. (eds) Logic and Data Bases. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-3384-5_12
Download citation
DOI: https://doi.org/10.1007/978-1-4684-3384-5_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-3386-9
Online ISBN: 978-1-4684-3384-5
eBook Packages: Springer Book Archive