448-457). Morgan Kaufmann.
Wu, K., Otoo, E. J., & Shoshani, A. (2002, July). Compressing bitmap indexes for
faster search operations. In Proceedings of the International Conference on
Scientific and Statistical Database Management (SSDBM), Edinburgh, Scotland
(pp. 99-108). Computer Society Press.
Wu, K., Otoo, E. J., & Shoshani, A. (2004, September). On the performance of
bitmap indices for high cardinality attributes. In Proceedings of the International
Conference on Very Large Data Bases (VLDB), Toronto, Canada (pp.
24-35). Morgan Kaufmann.
Wu, K., Otoo, E., & Shoshani, A. (2006). An efficient compression scheme for
bitmap indices (Tech. Rep. LBNL-49626). ACM Transactions on Database
Systems (TODS).
Wu, M.-C., & Buchmann, A. P. (1998, February). Encoded bitmap indexing for data
warehouses. In Proceedings of the International Conference on Data Engineering
(ICDE), Orlando, Florida (pp. 220-230). IEEE Computer Society Press.
Indexing in Data Warehouses
Copyright ?© 2007, Idea Group Inc. Copying or distributing in print or electronic forms without written permission
of Idea Group Inc. is prohibited.
Chapter.VIII
Indexing.in.
Data.Warehouses:
Bitmaps.and.Beyond
Karen C. Davis
University of Cincinnati, USA
Ashima Gupta
University of Cincinnati, USA
Abstract
Bitmap indexes (BIs) allow fast access to individual attribute values that are needed
to answer a query by storing a bit for each distinct value and tuple.
Pages:
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350