Algorithms for selecting materialized views in a data warehouse

Noha Yousri, Khalil M. Ahmed, Nagwa M. El-Makky

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
Pages89-96
Number of pages8
Volume2005
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005 - Cairo, Egypt
Duration: 3 Jan 20056 Jan 2005

Other

Other3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
CountryEgypt
CityCairo
Period3/1/056/1/05

Fingerprint

Data warehouses
Warehouses
Processing
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yousri, N., Ahmed, K. M., & El-Makky, N. M. (2005). Algorithms for selecting materialized views in a data warehouse. In 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005 (Vol. 2005, pp. 89-96). [1387024] https://doi.org/10.1109/AICCSA.2005.1387024

Algorithms for selecting materialized views in a data warehouse. / Yousri, Noha; Ahmed, Khalil M.; El-Makky, Nagwa M.

3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005. Vol. 2005 2005. p. 89-96 1387024.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yousri, N, Ahmed, KM & El-Makky, NM 2005, Algorithms for selecting materialized views in a data warehouse. in 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005. vol. 2005, 1387024, pp. 89-96, 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005, Cairo, Egypt, 3/1/05. https://doi.org/10.1109/AICCSA.2005.1387024
Yousri N, Ahmed KM, El-Makky NM. Algorithms for selecting materialized views in a data warehouse. In 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005. Vol. 2005. 2005. p. 89-96. 1387024 https://doi.org/10.1109/AICCSA.2005.1387024
Yousri, Noha ; Ahmed, Khalil M. ; El-Makky, Nagwa M. / Algorithms for selecting materialized views in a data warehouse. 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005. Vol. 2005 2005. pp. 89-96
@inproceedings{ebe722bf9cd24b338f2c87dba8ed52f9,
title = "Algorithms for selecting materialized views in a data warehouse",
abstract = "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.",
author = "Noha Yousri and Ahmed, {Khalil M.} and El-Makky, {Nagwa M.}",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/AICCSA.2005.1387024",
language = "English",
isbn = "078038735X",
volume = "2005",
pages = "89--96",
booktitle = "3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005",

}

TY - GEN

T1 - Algorithms for selecting materialized views in a data warehouse

AU - Yousri, Noha

AU - Ahmed, Khalil M.

AU - El-Makky, Nagwa M.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746570682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746570682&partnerID=8YFLogxK

U2 - 10.1109/AICCSA.2005.1387024

DO - 10.1109/AICCSA.2005.1387024

M3 - Conference contribution

SN - 078038735X

SN - 9780780387355

VL - 2005

SP - 89

EP - 96

BT - 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005

ER -