Algorithms for materialized view design in data warehousing environment (1997)
Cached
Download Links
- [www.vldb.org]
- [www.acm.org]
- [www.cs.adfa.oz.au]
- [140.115.82.191]
- DBLP
Other Repositories/Bibliography
| Citations: | 85 - 10 self |
BibTeX
@INPROCEEDINGS{Yang97algorithmsfor,
author = {Jian Yang},
title = {Algorithms for materialized view design in data warehousing environment},
booktitle = {},
year = {1997},
pages = {136--145}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 com-bination of good query performance and low view maintenance. We first develop a heuristic algorithm which can provide a feasible solu-tion based on individual optimal query plans. We also map the materialized view design problem as O-l integer programming problem, whose solution can guarantee an optimal so-lution. 1
