Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Discrete optimization
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Rewriting aggregate queries using views
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
Materialized view and index selection tool for Microsoft SQL server 2000
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Database tuning: principles, experiments, and troubleshooting techniques
Database tuning: principles, experiments, and troubleshooting techniques
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
View selection using randomized search
Data & Knowledge Engineering
A formal perspective on the view selection problem
The VLDB Journal — The International Journal on Very Large Data Bases
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh 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
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Aggregate-Query Processing in Data Warehousing Environments
VLDB '95 Proceedings of the 21th 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
Answering Queries with Aggregation Using Views
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
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
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
Efficient approaches for materialized views selection in a data warehouse
Information Sciences: an International Journal
Multiple Materialized View Selection for XPath Query Rewriting
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Selecting and using views to compute aggregate queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
A formal model for the problem of view selection for aggregate queries
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Deterministic view selection for data-analysis queries: properties and algorithms
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
An integer programming approach for the view and index selection problem
Data & Knowledge Engineering
| Hi-index | 0.00 |
We study the following warehouse view-selection problem: Given a data-warehouse schema, a set of parameterised aggregate queries and their frequency distribution, and a storage-limit constraint, find a set of aggregate views that, when materialised in the warehouse, would minimise the evaluation costs of the frequent queries, subject to a storage-limit constraint. Optimising the layout of stored data using view selection has a direct impact on the performance of data warehouses. We introduce an integer-programming model to obtain optimal solutions for the warehouse view-selection problem, and propose a heuristic to obtain competitive inexact solutions where our exact method is not applicable.