Skip to Main Content
Processing rules in a distributed active database involves evaluating distributed rules correctly. For databases whose rules are not changed very often, the performance of the distributed rule evaluation algorithm plays the key role in the overall performance of distributed active databases. In this paper, we study the performance of a distributed rule evaluation algorithm. An analytical model is developed to study the message count and the response time for triggering updates, which toggle the global status of a rule condition. Simulation results confirm the analytical data. Moreover, simulations are used to derive the total message count for the operation of this algorithm considering any updates which may or may not change the global status of a rule condition. Results from performance study suggest best ways to distribute a decomposed rule.