Multi-table joins through bitmapped join indices
ACM SIGMOD Record
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
A methodological framework for data warehouse design
Proceedings of the 1st ACM international workshop on Data warehousing and OLAP
IEEE Transactions on Knowledge and Data Engineering
Physical Database Design for Data Warehouses
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
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Multi-Dimensional Database Allocation for Parallel Data Warehouses
VLDB '00 Proceedings of the 26th 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
AutoPart: Automating Schema Design for Large Scientific Databases Using Data Partitioning
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Integrating vertical and horizontal partitioning into automated physical database design
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
DB2 design advisor: integrated automatic physical database design
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Automatic selection of bitmap join indexes in data warehouses
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
An evolutionary approach to schema partitioning selection in a data warehouse
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
SimulPh.D.: A Physical Design Simulator Tool
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Immune algorithm for bitmap join indexes
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
How to exploit the device diversity and database interaction to propose a generic cost model?
Proceedings of the 17th International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
Very large databases and data warehouses require many optimization structures to speed up their queries. These structures can be classified into two main categories: (1) redundant structures like mono attribute indexes, multi-attribute indexes (bitmap join indexes), materialized views, etc. and (2) no redundant structures, like horizontal partitioning and vertical partitioning. The problem of selecting any of these structures is a very crucial decision for the performance of the data warehouse. In this work, we focus on horizontal partitioning and bitmap join indexes. We first show the similarity between horizontal partitioning and bitmap join indexes. Secondly, we propose a new approach of selecting simultaneously these structures in order to reduce the query processing cost. It consists in using the horizontal partitioning schema obtained by a genetic algorithm to prune the search space of the problem of bitmap join index selection. Thirdly, we propose a greedy algorithm to select bitmap join indexes under a storage bound. Finally, we conduct several experimental studies using an adaptation of APB-1 benchmark in order to validate our proposed algorithms.