By Topic

Algorithms for selecting materialized views in a data warehouse

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
N. A. R. Yousri ; Comput. Sci. Dept., Alexandria Univ., Egypt ; K. M. Ahmed ; N. M. El-Makky

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.

Published in:

The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.

Date of Conference: