A review of bitmap index from an academic perspective. Several theoretical results are presented. The talk also discuss technical issues regarding sorting the tables prior to indexing, as a way to ...

A review of bitmap index from an academic perspective. Several theoretical results are presented. The talk also discuss technical issues regarding sorting the tables prior to indexing, as a way to improve the indexes.

Much of the talk is based on the following preprint:

Daniel Lemire, Owen Kaser, Kamel Aouiche, Sorting improves word-aligned bitmap indexes.

http://arxiv.org/abs/0901.3751

### Statistics

### Views

- Total Views
- 16,897
- Views on SlideShare
- 16,832
- Embed Views

### Actions

- Likes
- 16
- Downloads
- 603
- Comments
- 4

4 comments16 Likes11–4 of 4 previous next Post a comment

Full NameComment goes here.Jean-Marc Astesana, Chef de Département Modélisation mathématique et Développement agile at Renault Je travaille depuis des années sur des techniques d'inférence qui utilisent des Bitmap indexes dans un tout autre contexte que celui des BD. Votre présentation est passionnante. Merci.Cordialement.

Jean-Marc Astesana

Shireesh Kumar Mat student give me in an easy way to understand these concepts mainly on 'Optimizing Bitmap Indices With EfficientCompression' , send to my mail address, 'mskumar.kitswgl@gmail.com ', thanks

Daniel Lemire, Professor at LICEF Research Center Thanks jkff, fixed.Eugene Kirpichov, Tech Lead at Yandex The 6th slide has an error: Sun's implementation is based on 64-bit words. java.util.BitSet has a long[] inside.cagatayk5 months agoYevhen Bobrov, Software Developer 6 months agoVittorio Kanolus8 months agolin1shu8 months agoLuke Han, Sr. BI Architect at Actuate 10 months ago