Abstract
Semantic integrity constraints represent knowledge about data with which a relational database must be consistent. To enforce semantic integrity we must ensure that transactions which alter the database will preserve database consistency by accompanying each transaction with integrity tests. In this paper we address two problems. Firstly, how can we choose integrity tests that are correct and efficient? Secondly, how do we schedule and control the execution of integrity tests in the context of a parallel database machine? We use a theorem-proving method for deriving integrity tests to prove the integrity of the database which takes into account knowledge about the transaction, the partitioning strategy, and the truth of all constraints in the initial database state. Our method can derive, at schema compilation time, a range of possible sufficient or necessary tests as well as complete tests for transaction safety with respect to a constraint, and can generate separate sub-tests to independently verify changes to a section of the database. When a transaction is to be executed, tests or sub-tests are selected (from the range of alternatives generated at compile time) in order to maximise parallelism, minimise the amount of data accessed in integrity enforcement activity, and allow testing to commence as soon as possible.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C Chang and R C Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.
A Van Gelder and R W Topor. Safety and the correct translation of relational calculus formulas. In Proceedings of the 6th ACM PODS, pages 313–327, 1987.
P W P J Grefen and J Flokstra. Parallel handling of integrity constraints. In Parallel Database Systems, Proceedings of the Prisma Workshop, Noordwijk, pages 242–258, 1990.
A Gupta and J Widom. Local verification of global integrity constraints in distributed databases. In Proceedings, 1993 ACM SIGMOD, pages 49–58, 1993.
L J Henschen and W W McCune. Maintaining state constraints in relational databases: A proof theoretic basis. Journal of the ACM, 36(1):46–68, jan 1989.
L J Henschen, W W McCune, and S A Naqvi. Compiling constraint-checking programs from first order formulas. In Advances in Database Theory Volume II, pages 145–169. Plenum Press, 1984.
J M Kerridge. The design of the idioms parallel database machine. In Proceedings of the 9th British National Conference on Databases, pages 128–147, 1991.
J M Kerridge. The implementation of large parallel database machines on T9000 and C104 networks. In Networks, Routers and Transputers: Function, Performance and Application, pages 133–149. IOS Press, 1993.
J M Kerridge. Dynamic allocation of processes and channels in T9000/C104 networks using occam3. In Proceedings of the 17th World occam and Transputer User Group (WoTUG) Technical Meeting, 1994.
S H Lee, L J Henschen, M H Kim, and Y Lee. Enforcement of integrity constraints against transactions with transition axioms. In Proceedings, COMPSAC'92, pages 162–167, 1992.
W W McCune. Un-skolemising clause sets. Information Processing Letters, 29(5):257–263, 1988.
W W McCune and L J Henschen. Maintaining state constraints in relational databases: A proof theoretic basis. Journal of the Association for Computing Machinery, 36(1):46–67, 1989.
J M Nicolas. Logic for improving integrity checking in relational databases. Acta Informatica, 18:227–253, 1982.
X Qian. Distribution design of integrity constraints. In 2nd International Conference on Expert Database Systems, pages 205–226, 1989.
X Qian and D R Smith. Integrity constraint reformulation for efficient validation. In Proceedings of the 13th VLDB, pages 417–425, 1987.
E Simon and P Valduriez. Integrity control in distributed database systems. In Proceedings of the 19th Hawaii International Conference on System Sciences, pages 622–632, 1986.
M Unwalla and J M Kerridge. Control of a large massively parallel database machine using SQL catalogue extensions and a DSDL in preference to an operating system. In Proceedings of the 10th British National Conference on Databases, pages 138–155, 1992.
X Y Wang, N J Fiddian, and W A Gray. The development of a knowledge based transaction design assistant. In Proceedings, Database and Expert Systems Applications (DEXA'91), pages 356–361, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McCarroll, N., Kerridge, J. (1994). A strategy for semantic integrity enforcement in a parallel database machine. In: Bowers, D.S. (eds) Directions in Databases. BNCOD 1994. Lecture Notes in Computer Science, vol 826. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58235-5_40
Download citation
DOI: https://doi.org/10.1007/3-540-58235-5_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58235-9
Online ISBN: 978-3-540-48580-3
eBook Packages: Springer Book Archive