Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An alternative storage organization for ROLAP aggregate views based on cubetrees
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
On the complexity of the view-selection problem
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DynaMat: a dynamic view management system for data warehouses
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A progressive view materialization algorithm
Proceedings of the 2nd ACM international workshop on Data warehousing and 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
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A Pareto model for OLAP view size estimation
CASCON '01 Proceedings of the 2001 conference of the Centre for Advanced Studies on Collaborative research
The workload you have, the workload you would like
DOLAP '03 Proceedings of the 6th 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
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
A query answering greedy algorithm for selecting materialized views
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
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
Dynamic View Management System for Query Prediction to View Materialization
International Journal of Data Warehousing and Mining
| Hi-index | 0.00 |
The goal of on-line analytical processing (OLAP) is to quickly answer queries from large amounts of data residing in a data warehouse. Materialized view selection is an optimization problem encountered in OLAP systems. Published work on the problem of materialized view selection presents solutions scalable in the number of possible views. However, the number of possible views is exponential relative to the number of database dimensions. A truly scalable solution must be polynomial time relative to the number of dimensions. We present such a solution, our Polynomial Greedy Algorithm. Complexity analysis proves scalability, and a performance study verifies the result. Empirical evidence demonstrates benefits close to existing algorithms. We conclude the Polynomial Greedy Algorithm functions effectively where existing algorithms fail dramatically.