Handling inconsistencies in data warehouses

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data warehouses (DWs) can become inconsistent when some dimensional constraints are not satisfied by the dimension instances. In this paper, we present preliminary results about the effects of the violation of partitioning constraints in homogeneous dimension instances over aggregation queries, and in particular over the summarizability property (SUMM) of the DWs. We are interested in finding ways to retrieve consistent answers even when the DW is inconsistent. We give a notion of repair for inconsistent instances based on a notion of prioritized minimization. We also describe a notion of consistent answer in DWs. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Caniupán, M. (2004). Handling inconsistencies in data warehouses. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3268, 166–176. https://doi.org/10.1007/978-3-540-30192-9_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free