A performance comparison of bitmap indexes
- 5 October 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 559-561
- https://doi.org/10.1145/502585.502689
Abstract
We present a comparison of two new word-aligned schemes with some schemes for compressing bitmap indexes, including the well-known byte-aligned bitmap code (BBC). On both synthetic data and real application data, the new word-aligned schemes use only 50% more space, but perform logical operations on compressed data 12 times faster than BBC. The new schemes achieve this performance advantage by guaranteeing that during logical operations every machine instruction performs useful work on words rather than on bytes or bits as in BBC.Keywords
This publication has 2 references indexed in Scilit:
- Multidimensional indexing and query coordination for tertiary storage managementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Query processing and optimization in Oracle RdbThe VLDB Journal, 1996