Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 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
A case for dynamic view management
ACM Transactions on Database Systems (TODS)
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
ROLAP implementations of the data cube
ACM Computing Surveys (CSUR)
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
A view selection algorithm with performance guarantee
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Rethinking cost and performance of database systems
ACM SIGMOD Record
Yet another algorithms for selecting bitmap join indexes
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Automatic selection of bitmap join indexes in data warehouses
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
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
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
| Hi-index | 0.00 |
The problem of selecting views and/or indexes to materialize has been extensively studied in the context of query optimization. Traditionally, the problem is formalized as follows: given a set of queries and a budget e.g., an available memory space, find the objects to materialize (views and/or indexes) that (1) satisfy the given budget and (2) minimize the query cost. In this paper, we depart from this setting by adopting a user-centric point of view: given a constraint on query evaluation, namely a maximal query cost the user does accept, find the objects (1) whose materialization needs the minimal storage space and (2) that guarantee the query evaluation constraint. We study this problem in the data cube setting and provide exact and approximate solutions.