Multi-table joins through bitmapped join indices
ACM SIGMOD Record
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A general framework for the view selection problem for data warehouse design and evolution
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
Analysis and performance of inverted data base structures
Communications of the ACM
New TPC benchmarks for decision support and web commerce
ACM SIGMOD Record
Physical Database Design for Data Warehouses
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
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
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
The workload you have, the workload you would like
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
Data mining-based materialized view and index selection in data warehouses
Journal of Intelligent Information Systems
Multi-thread processing of long aggregates lists
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
On efficient storing and processing of long aggregate lists
DaWaK'05 Proceedings of the 7th 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
Evolution of data warehouses' optimization: a workload perspective
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Selection and pruning algorithms for bitmap index selection problem using data mining
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Materialised view construction in data warehouse for decision making
International Journal of Business Information Systems
Hi-index | 0.00 |
View materialization and indexing are the most effective techniques adopted in data warehouses to improve query performance. Since both materialization and indexing algorithms are driven by a constraint on the disk space made available for each, the designer would greatly benefit from being enabled to determine a priori which fractions of the global space available must be devoted to views and indexes, respectively, in order to optimally tune performances. In this paper we first present a comparative evaluation of the benefit (saving per disk page) brought by view materialization and indexing for a single query expressed on a star scheme. Then, we face the problem of determining an effective trade-off between the two space fractions for the core workload of the warehouse. Some experimental results are reported, which prove that the estimated trade-off is satisfactorily near to the optimal one.