TY - GEN
T1 - Data warehouse schema and instance design
AU - Theodoratos, Dimitri
AU - Sellis, Timos
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.
PY - 1998
Y1 - 1998
N2 - A Data Warehouse (DW) is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without accessing the original information sources. In this paper we deal with the issue of designing a DW, in the context of the relational model, by selecting a set of views to materialize in it. Views allow to compute both the schema and the instance of the DW from the schemas and the instances of the source relations. We briefly present a theoretical framework for the DW design problem, which concerns the selection of a set of views that (a) fits in the space allocated to the DW, (b) answers all the queries of interest, and (c) minimizes the total query evaluation and view maintenance cost. We then formalize it as a state space search problem by taking into account multiquery optimization over the maintenance queries (i.e. queries that compute changes to the materialized views) and the use of auxiliary views for reducing the view maintenance cost. Finally, incremental algorithms and heuristics for pruning the search space are presented.
AB - A Data Warehouse (DW) is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without accessing the original information sources. In this paper we deal with the issue of designing a DW, in the context of the relational model, by selecting a set of views to materialize in it. Views allow to compute both the schema and the instance of the DW from the schemas and the instances of the source relations. We briefly present a theoretical framework for the DW design problem, which concerns the selection of a set of views that (a) fits in the space allocated to the DW, (b) answers all the queries of interest, and (c) minimizes the total query evaluation and view maintenance cost. We then formalize it as a state space search problem by taking into account multiquery optimization over the maintenance queries (i.e. queries that compute changes to the materialized views) and the use of auxiliary views for reducing the view maintenance cost. Finally, incremental algorithms and heuristics for pruning the search space are presented.
UR - http://www.scopus.com/inward/record.url?scp=84957800785&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84957800785&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-49524-6_29
DO - 10.1007/978-3-540-49524-6_29
M3 - Conference contribution
AN - SCOPUS:84957800785
SN - 3540651896
SN - 9783540651895
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 363
EP - 376
BT - Conceptual Modeling - ER 1998 - 17th International Conference on Conceptual Modeling, Proceedings
A2 - Ram, Sudha
A2 - Ling, Tok Wang
A2 - Lee, Mong Li
PB - Springer Verlag
T2 - 17th International Conference on Conceptual Modeling, ER 1998
Y2 - 16 November 1998 through 19 November 1998
ER -