Query performance is critical in data warehouse applications, and bitmap indexes, which are quite different from the traditional B-tree indexes, play one of the important roles in performance tuning. The paper describes the principle of bitmap in?dexes through examples, i.e. a bitmap index is made up of an ordered series of bits, states detailedly the features (including advan?tages and disadvantages) and the usage conditions of bitmap indexes. Finally the paper concludes that using bitmap indexes proper?ly can greatly improve qu...
