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
AutoAdmin “what-if” index analysis utility
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
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
Selecting and using views to compute aggregate queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
Understanding software application interfaces via string analysis
Proceedings of the 28th international conference on Software engineering
Computing closest common subexpressions for view selection problems
DOLAP '06 Proceedings of the 9th ACM international workshop on Data warehousing and OLAP
Exact and inexact methods for selecting views and indexes for OLAP performance improvement
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Exact and inexact methods for solving the problem of view selection for aggregate queries
International Journal of Business Intelligence and Data Mining
Revisiting the partial data cube materialization
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Using functional dependencies for reducing the size of a data cube
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
An integer programming approach for the view and index selection problem
Data & Knowledge Engineering
Hi-index | 0.00 |
We present a formal analysis of the following view-selection problem: Given a set of queries and a database, return definitions of views that, when materialized in the database, would reduce the evaluation costs of the queries. Optimizing the layout of stored data using view selection has a direct impact on the performance of the entire database system. At the same time, the optimization problem is intractable, even under natural restrictions on the types of queries of interest. In this paper we use an integer-programming model to obtain optimal solutions to the problem of view selection for aggregate queries on data warehouses. We also report the results of the post-optimality analysis that we performed to determine/observe the impact of changing certain input characteristics on the optimal solution.