Indexes for Data Warehouses

Indexes for Data Warehouses

• B+-tree (all systems):
  • RID-list for each search-key value

• Bitmapped [O’Neil, 87] (almost all systems):
  • Bit-vectors instead of RID-lists

• Projection [O’Neil & Quass, 97] (Sybase IQ):
  • Mirror copy of column

• Bit-sliced [O’Neil & Quass, 97] (Sybase IQ):
  • “bit-level” projection index

• Bitmapped Join Index [O’Neil & Graefe, 95] (Informix):
  • bitmapped index using RIDs to index into joining table

• These structures are typically very costly in terms of storage requirements

Previous slide

Next slide

Back to first slide

View graphic version