Data Warehouse Tuning: The Supremacy of Bitmap Index

Provided by: International Journal of Computer Applications
Topic: Data Management
Format: PDF
The data query is the only way to get information from a data warehouse, for that, the designer should consider it effectiveness while the selection of relevant indexes and their combination with materialized views, also the index selection is known as a NP-complete problem, as per the number of indexes is exponential in the total attributes in the database, This makes the choose of the suitable index type is a necessary step while the data warehouse design. In this paper the authors show that bitmap index is more advantageous than the B-tree index, based on three factors, size of index, clustering factor and compression, with a real experiment.

Find By Topic