An efficient constraint planning algorithm for multidatabases

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.