Index Techniques   «Prev 

Bitmap Indices

A bitmap index is a special type of index that uses a series of bitstrings to represent the set of ID values that correspond to a given indexed data value. You can define a bitmap index for a field if the table's ID field is defined as a positive integer (see restrictions).
Bitmap indices have the following important features:
  1. Bitmaps are highly compressed: bitmap indices can be significantly smaller than standard indices. This reduces disk and cache usage considerably.
  2. Bitmaps operations are optimized for transaction processing: you can use bitmap indices within tables with no performance penalty as compared with using standard indices.
  3. Logical operations on bitmaps (counting, AND, and OR) are optimized for high performance.
  4. The SQL Engine includes a number of special optimizations that can take advantage of bitmap indices.
Subject to the restrictions listed below, bitmap indices operate in the same manner as standard indices. Indexed values are collated and you can index on combinations of multiple fields.

Region bitmap

1) In a bitmapped index, a binary array is created with one index row for each table row

2) Within each index row, there are entries for each index value (North, South, East, West)

3) Across each index row, binary values are set to zero except for the index entry where the value is true. This value is set to 1.

4) We can see that row 1 is in the East region