Efficient materialized view maintenance in mobile environments using interleaved Pull-Push algorithm

This paper presents a novel algorithm, Interleaved Pull-Push, for incrementally maintaining materialized views defined over information sources and stored in a Data Warehouse (DW), where both sources and DW could be mobile. In contrast to other approaches, the workload of updating the view is distributed among sources, thus alleviating the DW from receiving and handling unnecessary intermediate messages. The proposed algorithm ensures strong consistency of the view at the data warehouse in the presence of concurrent updates, while reducing the number of messages needed as well as the communication overhead. A simulation model based on the WHIPS architecture has been developed to analyse the performance of the proposed algorithm and to compare it with a previously proposed algorithm, Pure-Push, and the traditional Nested SWEEP algorithm. Several experiments have been conducted to quantify the costs and benefits of the proposed algorithm.