In parallel database systems the partitioning methods considered in current researches are static. This research paper presents a partitioning method to divide the database relations into dynamic horizontal partitions. Every partition contains some tuples of the database relation. These partitions will be checked using the subsets generated from the integrity constraints during the test verification process. Furthermore, the integrity of these partitions will be enforced by the generated

more »

... ty rules. It presents the algorithm of distributing the integrity test(s) among the horizontal partitions. As our intention is to parallelise the execution of the integrity tests, the relations specified in the test are dynamically partitioned into several parts based on the number of available processors. Each processor checks the validity of the test concurrently by accessing the partition assigned to it. in 2006. His current research interests include distributed databases, parallel databases focusing on issues related to integrity maintenance, transaction processing, query processing and Optimization; grid computing, artificial intelligence and Geographical information systems. This paper is a revised and expanded version of a paper entitled [title] presented at [name, location and date of conference].