Integrity constraint checking in Chimera

Author(s):  
E. Bertino ◽  
B. Catania ◽  
S. Bressan
Author(s):  
Praveen Madiraju ◽  
Rajshekhar Sunderraman ◽  
Shamkant B. Navathe ◽  
Haibin Wang

Global semantic integrity constraints ensure the integrity and consistency of data spanning distributed databases. In this chapter, we discuss a novel representation technique for expressing semantic integrity constraints for XML databases. We also provide the details of XConstraint Checker, a general framework for checking global semantic constraints for XML databases. The framework is augmented with an efficient algorithm for checking these global XML constraints. The algorithm is efficient for three reasons: 1) the algorithm does not require the update statement to be executed before the constraint check is carried out; hence, we avoid any potential problems associated with rollbacks, 2) sub constraint checks are executed in parallel, and 3) most of the processing of algorithm could happen at compile time; hence, we save time spent at run-time. As a proof of concept, we present a prototype of the system implementing the ideas discussed in this paper.


2009 ◽  
pp. 550-569
Author(s):  
Praveen Madiraju ◽  
Rajshekhar Sunderraman ◽  
Shamkant B. Navathe ◽  
Haibin Wang

Global semantic integrity constraints ensure integrity and consistency of data spanning multiple databases. In this paper, we take initial steps towards representing global semantic integrity constraints for XML databases. We also provide a general framework for checking global semantic integrity constraints for XML databases. Furthermore, we set forth an efficient algorithm for checking global semantic integrity constraints across multiple XML databases. Our algorithm is efficient for three reasons: (1) the algorithm does not require the update statement to be executed before the constraint check is carried out; hence, we avoid any potential problems associated with rollbacks, (2) sub constraint checks are executed in parallel, and (3) most of the processing of algorithm could happen at compile time; hence, we save time spent at run-time. As a proof of concept, we present a prototype of the system implementing the ideas discussed in this paper.


1987 ◽  
Vol 4 (4) ◽  
pp. 331-343 ◽  
Author(s):  
J.W. Lloyd ◽  
E.A. Sonenberg ◽  
R.W. Topor

2006 ◽  
Vol 9 (2) ◽  
Author(s):  
Stephane Gançarski ◽  
Claudia León ◽  
Hubert Naacke ◽  
Marta Rukoz ◽  
Pablo Santini

This paper presents a solution to check referential integrity constraints and conjunctive global constraints in a relational multi database system. It also presents the experimental results obtained by implementing this solution over a PC cluster with Oracle9i DBMS. The goal of those experimentations is to measure the time spent to check global constraints in a distributed systems. The results show that the overhead induced by our distributed constraint checking is reduced by 50% compared to a centralized checking of constraints.


Sign in / Sign up

Export Citation Format

Share Document