TY - JOUR
T1 - Making multiple views self-maintainable in a data warehouse
AU - Liang, Weifa
AU - Li, Hui
AU - Wang, Hui
AU - Orlowska, Maria E.
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 - 1999/6
Y1 - 1999/6
N2 - A data warehouse collects and maintains a large amount of data from several distributed and heterogeneous data sources. Often the data is stored in the form of materialized views in order to provide fast access to the integrated data, regardless of the availability of the data sources. In this paper we focus on the following problem: for a given set of materialized select-project-join (SPJ) views, how can we find and minimize the auxiliary data stored in a data warehouse in order to make all materialized views in the data warehouse self-maintainable? For this problem we first devise an algorithm for finding such an auxiliary view set by exploiting information sharing among the auxiliary views and materialized views themselves to reduce the total size of auxiliary views. We then consider how to make the data warehouse still self-maintainable by minor modifications when there is a view addition to or deletion from it by giving an algorithm for this incremental maintenance purpose.
AB - A data warehouse collects and maintains a large amount of data from several distributed and heterogeneous data sources. Often the data is stored in the form of materialized views in order to provide fast access to the integrated data, regardless of the availability of the data sources. In this paper we focus on the following problem: for a given set of materialized select-project-join (SPJ) views, how can we find and minimize the auxiliary data stored in a data warehouse in order to make all materialized views in the data warehouse self-maintainable? For this problem we first devise an algorithm for finding such an auxiliary view set by exploiting information sharing among the auxiliary views and materialized views themselves to reduce the total size of auxiliary views. We then consider how to make the data warehouse still self-maintainable by minor modifications when there is a view addition to or deletion from it by giving an algorithm for this incremental maintenance purpose.
UR - http://www.scopus.com/inward/record.url?scp=0032660398&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0032660398&origin=recordpage
U2 - 10.1016/S0169-023X(99)00009-9
DO - 10.1016/S0169-023X(99)00009-9
M3 - RGC 21 - Publication in refereed journal
SN - 0169-023X
VL - 30
SP - 121
EP - 134
JO - Data and Knowledge Engineering
JF - Data and Knowledge Engineering
IS - 2
ER -