Algorithms for materialized view design in data warehousing environment

Jian Yang; Kamalakar Karlapalem; Qing Li

Algorithms for materialized view design in data warehousing environment

Jian Yang, Kamalakar Karlapalem, Qing Li

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

Abstract

Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a frame work for analyzing the issues in selecting views to materialize so as to achieve the best combination of good query performance and low view maintenance. We first develop a heuristic algorithm which can provide a feasible solution based on individual optimal query plans. We also map the materialized view design problem as 0-1 integer programming problem, whose solution can guarantee an optimal solution.

Original language	English
Title of host publication	Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997
Editors	Matthias Jarke
Place of Publication	San Fransisco, CA
Publisher	Morgan Kaufmann
Pages	136-145
Number of pages	10
ISBN (Electronic)	1558604707, 9781558604704
Publication status	Published - 1997
Externally published	Yes
Event	23rd International Conference on Very Large Databases, VLDB 1997 - Athens, Greece Duration: 26 Aug 1997 → 29 Aug 1997

Other

Other	23rd International Conference on Very Large Databases, VLDB 1997
Country	Greece
City	Athens
Period	26/08/97 → 29/08/97

Access to Document

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Algorithms for materialized view design in data warehousing environment'. Together they form a unique fingerprint.

Cite this

@inproceedings{f90b79b31f964b148fe9655f9f843bff,

title = "Algorithms for materialized view design in data warehousing environment",

abstract = "Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a frame work for analyzing the issues in selecting views to materialize so as to achieve the best combination of good query performance and low view maintenance. We first develop a heuristic algorithm which can provide a feasible solution based on individual optimal query plans. We also map the materialized view design problem as 0-1 integer programming problem, whose solution can guarantee an optimal solution.",

author = "Jian Yang and Kamalakar Karlapalem and Qing Li",

year = "1997",

language = "English",

pages = "136--145",

editor = "Matthias Jarke",

booktitle = "Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997",

publisher = "Morgan Kaufmann",

}

Algorithms for materialized view design in data warehousing environment. / Yang, Jian; Karlapalem, Kamalakar; Li, Qing.

Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997. ed. / Matthias Jarke. San Fransisco, CA : Morgan Kaufmann, 1997. p. 136-145.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

TY - GEN

T1 - Algorithms for materialized view design in data warehousing environment

AU - Yang, Jian

AU - Karlapalem, Kamalakar

AU - Li, Qing

PY - 1997

Y1 - 1997

N2 - Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a frame work for analyzing the issues in selecting views to materialize so as to achieve the best combination of good query performance and low view maintenance. We first develop a heuristic algorithm which can provide a feasible solution based on individual optimal query plans. We also map the materialized view design problem as 0-1 integer programming problem, whose solution can guarantee an optimal solution.

AB - Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a frame work for analyzing the issues in selecting views to materialize so as to achieve the best combination of good query performance and low view maintenance. We first develop a heuristic algorithm which can provide a feasible solution based on individual optimal query plans. We also map the materialized view design problem as 0-1 integer programming problem, whose solution can guarantee an optimal solution.

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

M3 - Conference proceeding contribution

SP - 136

EP - 145

BT - Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997

A2 - Jarke, Matthias

PB - Morgan Kaufmann

CY - San Fransisco, CA

ER -