loading...
An efficient constraint planning algorithm for multidatabases
Cairo, Egypt January 03-January 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AICCSA.2005.1387033ACS/IEEE 2005 International Conferenc ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
P. Madiraju, Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA, USA
R. Sunderraman, Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA, USA
Summary form only given. We have earlier proposed a general framework of an agent based constraint checker for checking global integrity constraints. The constraint checker consists of: update parser, metadatabase extractor, constraint planner, constraint optimizer and constraint executor. One of the important steps in checking for global constraints is to generate sub constraints from global integrity constraints. These sub constraints can be locally executed on remote sites. The constraint planner devises an effective plan for generating such sub constraints from each of the global constraints. In this paper, we focus on the constraint planner module. We propose an efficient algorithm that takes as input an update statement and the list of all global constraints and outputs sub constraints to be executed on remote sites. Our algorithm is efficient since the algorithm does not require the update statement to be executed before the constraint check is carried out. In this way, we save lot of time and resources avoiding any potential rollbacks. Our vision for implementation exploits parallelism by virtue of employing mobile agents.
Citation:
P. Madiraju, R. Sunderraman, "An efficient constraint planning algorithm for multidatabases," aiccsa, pp.36-I, ACS/IEEE 2005 International Conference on Computer Systems and Applications (AICCSA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.