Abstract
This paper is concerned with the problem of efficiently checking of integrity constraints in data base programming languages supporting subtyping and class hierarchies. More specifically, we consider two different problems: (1) statically reduce the number of constraints to be checked, and (2) generate an efficient run time checker. Using simple strategies, one can significantly improve the efficiency of the verification. We show how to reduce the number of constraints to be checked by characterising the portions of the database that are concerned by the constraints and involved in a transaction. We also show how to generate efficient algorithms for checking a large class of constraints. We show how all the techniques presented took great advantage of the underlying type system which provide a significant help both in solving (1) and (2). Last the current status of the Thémis prototype is presented.
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.
References
F. Bry, H. Decker, and R. Manthey. A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases. In EDBT International Conference, 1988.
F. Bry and R. Manthey. Checking Consistency of Database Constraints: A Logical Basis. In VLDB International Conference, 1986.
L. Gardelli. A Semantics of Multiple Inheritance. In Semantics of Data Types. Springer-Verlag, 1984.
G. Gardarin and M. Melkanoff. Proving the Consistency of Database Transactions. In VLDB International Conference, Rio, Brasil, October 1979.
A. Hsu and T. Imielinski. Integrity Checking for Multiple Updates. In ACM SIGMOD International Conference, 1985.
R. Hull, R. Morrison, and D. Stemple, editors. International Workshop on Database Programming Languages. Morgan Kaufmann, 1989.
R. Kowalski, F. Sadri, and P. Soper. Integrity Checking in Deductive Databases. In VLDB International Conference, 1987.
C. Lécluse and P. Richard. Modeling Complex Structures in Object-Oriented Databases. In ACM PODS International Conference, March 1989.
C. Lécluse and P. Richard. Data Base Schemas and Types Systems for DBPLs, a Definition and its Applications. Technical report, GIP Altair, June 1990.
H. Martin. Contrôle de la cohérence dans les bases objets: Une approche par le comportement. PhD thesis, Université Joseph-Fourier - Grenoble I, 1991.
J.M. Nicolas. Logic for Improving Integrity Checking in Relational
Databases. Technical report, ONERA-CERT, 1979.
T. Sheard and D. Stemple. Automatic Verification of Database
Transaction Safety. ACM Transactions on Database Systems,14(3), September 1989.
M. Stonebraker. Implementation of Integrity Constraints and Views
by Query Modification. In ACM SIGMOD International Conference,San Jose, California, May 1975.
W. Weber, W. Stugky, and J. Karzt. Integrity Checking in database systems. Information Systems, 8 (2), 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benzaken, V., Doucet, A. (1994). Thémis: a database programming language with integrity constraints. In: Beeri, C., Ohori, A., Shasha, D.E. (eds) Database Programming Languages (DBPL-4). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3564-7_14
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3564-7_14
Publisher Name: Springer, London
Print ISBN: 978-3-540-19853-6
Online ISBN: 978-1-4471-3564-7
eBook Packages: Springer Book Archive