View maintenance in a warehousing environment
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Algorithms for deferred view maintenance
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Efficient view maintenance at data warehouses
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The Strobe algorithms for multi-source warehouse consistency
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Efficient View Maintenance in a Multidatabase Environment
Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Materialized View Maintenance Using Version Numbers
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Precise Detection and Proper Handling of View Maintenance Anomalies in a Multidatabase Environment
COOPIS '97 Proceedings of the Second IFCIS International Conference on Cooperative Information Systems
| Hi-index | 0.00 |
Maintaining a materialized view in an environment of multiple, distributed, autonomous data sources is a challenging issue. The results of incremental computation are effected by interfering updates and compensation is required. In this paper, we improve the incremental computation proposed in our previous work by making it more efficient through the use of data source and refreshed version numbers. This is achieved by cutting down unnecessary maintenance queries and thus their corresponding query results. The number of times of sending subqueries to a data source with multiple base relations are also reduced, as well as avoiding the execution of cartesian products. Updates that will not affect the view are detected and incremental computation is not applied on them. We also provide a compensation algorithm that resolve the anomalies caused by using the view in the incremental computation.