Schema versioning in data warehouses:: Enabling cross-version querying via schema augmentation

被引:44
作者
Golfarelli, Matteo
Lechtenboerger, Jens
Rizzi, Stefano
Vossen, Gottfried
机构
[1] Univ Munster, Dept Informat Syst, D-48149 Munster, Germany
[2] Univ Bologna, DEIS, I-40126 Bologna, Italy
关键词
data warehousing; schema versioning; cross-version querying; schema augmentation;
D O I
10.1016/j.datak.2005.09.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As several mature implementations of data warehousing systems are fully operational, a crucial role in preserving their up-to-dateness is played by the ability to manage the changes that the data warehouse (DW) schema undergoes over time in response to evolving business requirements. In this paper we propose an approach to schema versioning in DWs, where the designer may decide to undertake some actions on old data aimed at increasing the flexibility in formulating cross-version queries, i.e., queries spanning multiple schema versions. First, we introduce a representation of DW schemata as graphs of simple functional dependencies, and discuss its properties. Then, after defining an algebra of schema graph modification operations aimed at creating new schema versions, we discuss how augmented schemata can be introduced to increase flexibility in cross-version querying. Next, we show how a history of versions for DW schemata is managed and discuss the relationship between the temporal horizon spanned by a query and the schema on which it can consistently be formulated. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:435 / 459
页数:25
相关论文
共 38 条
[1]  
Aho A. V., 1972, SIAM Journal on Computing, V1, P131, DOI 10.1137/0201008
[2]  
[Anonymous], 1998, DATA WAREHOUSE LIFEC
[3]  
[Anonymous], 1998, COMPUTER SCI
[4]   GRAPH ALGORITHMS FOR FUNCTIONAL DEPENDENCY MANIPULATION [J].
AUSIELLO, G ;
DATRI, A ;
SACCA, D .
JOURNAL OF THE ACM, 1983, 30 (04) :752-766
[5]  
Bebel B., 2004, P 2004 ACM S APPL CO, P717, DOI DOI 10.1145/967900.968049
[6]  
BLASCHKA M, 2000, THESIS TU MUNCHEN GE
[7]  
BLASCHKA M, 1999, P 1 INT C DAT WAR KN, P153
[8]  
Cormen T. H., 2001, Introduction to Algorithms, V2nd
[9]  
COSMADAKIS SS, 1984, P 3 PODS, P29
[10]  
DeCastro C, 1995, WORK COMP, P272