A progressive view materialization algorithm

Authors:
Hidetoshi Uchiyama;Kanda Runapongsa;Toby J. Teorey
Affiliations:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor
Venue:
Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP
Year:
1999

Citing 9
Cited 9

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
Database modeling and design (3rd ed.)

Database modeling and design (3rd ed.)
Index Selection for OLAP

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Materialized Views Selection in a Multidimensional Database

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Sampling-Based Estimation of the Number of Distinct Values of an Attribute

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies

VLDB '96 Proceedings of the 22th 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

Achieving scalability in OLAP materialized view selection

Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP
Multiobjective genetic algorithms for materialized view selection in OLAP data warehouses

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more

Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
ROLAP implementations of the data cube

ACM Computing Surveys (CSUR)
Data mining-based materialized view and index selection in data warehouses

Journal of Intelligent Information Systems
Density-Based view materialization

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Dynamic view selection for OLAP

DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Clustering-based materialized view selection in data warehouses

ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Materialized views selection for answering queries

ICDEM'10 Proceedings of the Second international conference on Data Engineering and Management

Quantified Score

Hi-index	0.01

Visualization

Abstract

A data warehouse stores materialized views of aggregate data derived from a fact table in order to minimize the query response time. One of the most important decisions in designing the data warehouse is the selection of materialized views. This paper presents an algorithm which provides appropriate views to be materialized while the goal is to minimize the query response time and maintenance cost. We use a data cube lattice, frequency of queries and updates on views, and view size to select views to be materialized using greedy algorithms. In spite of the simplicity, our algorithm selects views which give us better performance than views that selected by existing algorithms.