Materialized View Selection in a Data Warehouse

Authors:
Feng Yu;Xiaoyong Du;Shan Wang
Affiliations:
-;-;-
Venue:
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Year:
2000

Citing 10
Cited 0

Implementing data cubes efficiently

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Materialized view maintenance and integrity constraint checking: trading space for time

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Index Selection for OLAP

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Materialized Views Selection in a Multidimensional Database

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Materialized View Selection for Multidimensional Datasets

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Data Warehouse Configuration

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Algorithms for Materialized View Design in Data Warehousing Environment

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Improved Unnesting Algorithms for Join Aggregate SQL Queries

VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Selecting views to be materialized is one of the most important decisions in designing a warehouse. In this paper we present algorithms for how to select a set of views to be materialized so as to achieve both good query performance and low view maintain cost under a storage space constraint. We generated the candidate views based on Query Frames which represent the essential characters of queries. We give an algorithm to select an optimal set of views to be materialized first and then give a feasible algorithm which generates a reasonable solution.