Algorithms for selecting materialized views in a data warehouse

Summary form only given. A data warehouse stores materialized views of data from one or more sources, for the purpose of efficiently implementing decision-support or OLAP queries. One of the most important decisions in designing a DW is the selection of materialized views to be maintained at the war...

Full description

Saved in:
Bibliographic Details
Published inThe 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005 p. 27
Main Authors Yousri, N.A.R., Ahmed, K.M., El-Makky, N.M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Computer science
Cost function
Data engineering
Data warehouses
Maintenance engineering
NP-complete problem
Online AccessGet full text

Cover

More Information
Summary:Summary form only given. A data warehouse stores materialized views of data from one or more sources, for the purpose of efficiently implementing decision-support or OLAP queries. One of the most important decisions in designing a DW is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views so that the sum cost of processing set of queries and maintaining the materialized views is minimized. In this paper, new algorithms are proposed for selecting materialized views in a data warehouse. Two targets of research are considered. The first target is to propose an approach to solve the problem considering both multi-query optimization, and the maintenance process optimization. The other target considers using a simple search strategy that reduces the search space for the view selection problem, and reduces the time complexity to a linear instead of a quadratic one.
ISBN:9780780387355
078038735X
ISSN:2161-5322
2161-5330
DOI:10.1109/AICCSA.2005.1387024