Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
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
A framework for supporting data integration using the materialized and virtual approaches
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
Making multiple views self-maintainable in a data warehouse
Data & Knowledge Engineering
Making views self-maintainable for data warehousing
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Updating Distributed Materialized Views
IEEE Transactions on Knowledge and Data Engineering
Data Integration using Self-Maintainable Views
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Multiple View Consistency for Data Warehousing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Maintaining Materialized Views for Data Warehouses with Multiple Remote Sources
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
| Hi-index | 0.00 |
The complete consistence maintenance of SPJ-type materialized views in a distributed source environment has been studied extensively in the past several years due to its fundamental importance to data warehouses. Much effort has been taken based on an assumption that each source site contains only one relation and no multiple appearances of a relation is allowed in the definition of views. In this paper a generalized version of the view maintenance problem that not only a relation may appear many times in the definition of the view but also a site may contain multiple relations is considered. Due to unpredictability of the communication delay and bandwidth between the data warehouse and the sources, the materialized view maintenance is very expensive and time consuming. Therefore, one natural question for this generalized case is whether there is an algorithm which not only keeps the view complete consistent with the remote source data but also minimizes the number of accesses to the remote sites. In this paper we first show that a known SWEEP algorithm is one of the best algorithms for the case where multiple relations are included in a site. We then propose a complete consistency algorithm which accesses remote sources less than n - 1 times for the case where multiple appearances of a relation is allowed and n is the number of relations in the definition of the view.