TREE BASED INDEXES VERSUS BITMAP INDEXES: A PERFORMANCE STUDY

Publisher Website
Google Scholar
Abstract
Data warehouses are used to store large amounts of data which is often used for On-Line Analytical Processing (OLAP). Short response times are essential for on-line decision support. Common approaches to reach this goal in read-mostly environments are the precomputation of materialized views and the use of index structures. This paper focuses on the use of index structures for supporting fast access to data. The performance of index structures depends on many different parameters. Here, we focus on a set of nine parameters. Two approaches are presented to support the decision making process which index structure should be applied. The first approach is based on classification trees. The second approach uses an aggregation and scatter diagram method. Both approaches are applied to four distinct index structures: a tree-based index structure without aggregated data, a tree-based index structure with aggregated data and two bitmap index structures. This paper presents results of the comparison with both approaches.

This publication has 2 references indexed in Scilit: