View Selection in DW and OLAP: A Theoretical Review

View Sample PDF

Author(s): Alfredo Cuzzocrea (University of Calabria, Italy)
Copyright: 2009
Pages: 8
Source title: Encyclopedia of Data Warehousing and Mining, Second Edition
Source Author(s)/Editor(s): John Wang (Montclair State University, USA)
DOI: 10.4018/978-1-60566-010-3.ch313

Purchase

View View Selection in DW and OLAP: A Theoretical Review on the publisher's website for pricing and purchasing information.

Abstract

Data Warehousing (DW) systems store materialized views, data marts and data cubes, and provide nicely data exploration and analysis interfaces via OnLine Analytical Processing (OLAP) (Gray et al., 1997) and Data Mining (DM) tools and algorithms. Also, OnLine Analytical Mining (OLAM) (Han, 1997) integrates the previous knowledge discovery methodologies and offers a meaningfully convergence between OLAP and DM, thus contributing to significantly augment the power of data exploration and analysis capabilities of knowledge workers. At the storage layer, the mentioned knowledge discovery methodologies share the problem of efficiently accessing, querying and processing multidimensional data, which in turn heavily affect the performance of knowledge discovery processes at the application layer. Due to the fact that OLAP and OLAM directly process data cubes/marts, and DM is more and more encompassing methodologies that are interested to multidimensional data, the problem of efficiently representing data cubes by means of a meaningfully selected view set is become of relevant interest for the Data Warehousing and OLAP research community. This problem is directly related to the analogous problem of efficiently computing the data cube from a given relational data source (Harinarayan et al., 1996; Agarwal et al., 1996; Sarawagi et al., 1996; Zhao et al., 1997). Given a relational data source R and a target data cube schema W, the view selection problem in OLAP deals with how to select and materialize views from R in order to compute the data cube A defined by the schema W by optimizing both the query processing time, denoted by TQ, which models the amount of time required to answer a reference query-workload on the materialized view set, and the view maintenance time, denoted by TM, which models the amount of time required to maintain the materialized view set when updates occur, under a given set of constraints I that, without any loss of generality, can be represented by a space bound constraint B limiting the overall occupancy of the views to be materialized (i.e., I = ). It has been demonstrated (Gupta, 1997; Gupta & Mumick, 2005) that this problem is NP-hard, thus heuristic schemes are necessary. Heuristics are, in turn, implemented in the vest of greedy algorithms (Yang et al., 1997; Kalnis et al., 2002). In this article, we focus the attention on state-ofthe- art methods for the view selection problem in Data Warehousing and OLAP, and complete our analytical contribution with a theoretical analysis of these proposals under different selected properties that nicely model spatial and temporal complexity aspects of the investigated problem.

The IRMA Community

Research IRM

View Selection in DW and OLAP: A Theoretical Review

Purchase

Abstract

Related Content

IRMA Sponsors