TY - GEN
T1 - Revisit on view maintenance in data warehouses
AU - Liang, Weifa
AU - Yu, Jeffrey X.
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84974733617
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84974733617&origin=recordpage
U2 - 10.1007/3-540-47714-4_19
DO - 10.1007/3-540-47714-4_19
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783540477143
VL - 2118
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 203
EP - 211
BT - Advances in Web-Age Information Management - 2nd International Conference, WAIM 2001, Proceedings
PB - Springer Verlag
T2 - 2nd International Conference on Web-Age Information Management (WAIM 2001)
Y2 - 9 July 2001 through 11 July 2001
ER -