Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
Join processing in relational databases
ACM Computing Surveys (CSUR)
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Query optimization for selections using bitmaps
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
Building the Data Warehouse,3rd Edition
Building the Data Warehouse,3rd Edition
The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling
The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling
Adaptive and Automated Index Selection in RDBMS
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
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
Encoded Bitmap Indexing for Data Warehouses
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
DB2 Advisor: An Optimizer Smart Enough to Recommend its own Indexes
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
A genetic algorithm for the index selection problem
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Hybrid greedy and genetic algorithms for optimization of relational data warehouses
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Data mining-based materialized view and index selection in data warehouses
Journal of Intelligent Information Systems
Time-HOBI: indexing dimension hierarchies by means of hierarchically organized bitmaps
DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP
Yet another algorithms for selecting bitmap join indexes
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Revisiting the partial data cube materialization
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
On simplifying integrated physical database design
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Time-HOBI: Index for optimizing star queries
Information Systems
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
Pruning search space of physical database design
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Static and incremental selection of multi-table indexes for very large join queries
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Immune algorithm for bitmap join indexes
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
Hi-index | 0.00 |
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when queries access very large volumes of data. To improve response time, data warehouse administrators generally use indexing techniques such as star join indexes or bitmap join indexes. This task is nevertheless complex and fastidious. Our solution lies in the field of data warehouse auto-administration. In this framework, we propose an automatic index selection strategy. We exploit a data mining technique ; more precisely frequent itemset mining, in order to determine a set of candidate indexes from a given workload. Then, we propose several cost models allowing to create an index configuration composed by the indexes providing the best profit. These models evaluate the cost of accessing data using bitmap join indexes, and the cost of updating and storing these indexes.