On querying versions of multiversion data warehouse
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Schema versioning in data warehouses: enabling cross-version querying via schema augmentation
Data & Knowledge Engineering - Special issue: WIDM 2004
Multiversion join index for multiversion data warehouse
Information and Software Technology
Metadata management in a multiversion data warehouse
Journal on data semantics VIII
Enforcing strictness in integration of dimensions: beyond instance matching
Proceedings of the ACM 14th international workshop on Data Warehousing and OLAP
Repairing dimension hierarchies under inconsistent reclassification
ER'11 Proceedings of the 30th international conference on Advances in conceptual modeling: recent developments and new directions
What time is it in the data warehouse?
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Handling inconsistencies in data warehouses
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Metadata management in a multiversion data warehouse
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
Repairing inconsistent dimensions in data warehouses
Data & Knowledge Engineering
Extended dimensions for cleaning and querying inconsistent data warehouses
Proceedings of the sixteenth international workshop on Data warehousing and OLAP
| Hi-index | 0.00 |
Data warehouses present a powerful framework for storing and analyzing huge amounts of data. In this context analyses focus on data that has been gathered over long periods of time, often between one and five years. A data warehouse can therefore be regarded as a specialized historical database. However, not only the data kept in a data warehouse has to be seen in a temporal context, but also the fact that dimension data may undergo changes during such a time period needs to be taken into consideration. In this paper, we focus on update operations on dimensions and establish a notion of consistency for guiding such operations. We devise algorithms for executing update operations that can be shown to preserve consistency, and we study their time complexity.