Optimizing bitmap indices with efficient compression

ACM Transactions on Database Systems

Volumn 31, Issue 1, 2006, Pages 1-38

  Wu, Kesheng ^a   Otoo, Ekow J ^a   Shoshani, Arie ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Bitmap index; Compression; Query processing

Indexed keywords

BITMAP INDEX; COMPRESSION; PROJECTION INDICES; QUERY PROCESSING;

OPTIMIZATION; QUERY LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS); TREES (MATHEMATICS);

IMAGE COMPRESSION;

EID: 33745215599     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1132863.1132864     Document Type: Article

References (34)

1. AMEH-YAHIA, S. AND JOHNSON, T. 2000. Optimizing queries on compressed bitmaps. In VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10-14, 2000, Cairo, Egypt, A. E. Abbadi, M. L. Brodie, S. Chakravarthy, U. Dayal, N. Kamel, G. Schlageter, and K.-Y. Whang, Eds. Morgan Kaufmann, San Francisco, CA, 329-338.
2. ANTOSHENKOV, G. 1994. Byte-aligned bitmap compression. Tech. rep. Oracle Corp., Redwood Shores, CA. U.S. Patent number 5,363,098.
3. ANTOSHENKOV, G. AND ZIAUDDIN, M. 1996. Query processing and optimization in ORACLE RDB. VLDB J. 5, 229-237.
4. CHAN, C.-Y. AND IOANNIDIS, Y. E. 1998. Bitmap index design and evaluation. In Proceedings of the 1998 ACM SIGMOD: International Conference on Management of Data. ACM Press, New York, NY, 355-366.
5. CHAN, C. Y. AND IOANNIDIS, Y. E. 1999. An efficient bitmap encoding scheme for selection queries. In SIGMOD 1999, Proceedings of the ACM SIGMOD International Conference on Management of Data, June 1-3, 1999, Philadelphia, Pennsylvania, USA, A. Delis, C. Faloutsos, and S. Ghandeharizadeh, Eds. ACM Press, New York, NY, 215-226.
6. CHAUDHURI, S. AND DAYAL, U. 1997. An overview of data warehousing and OLAP technology. ACM SIGMOD Rec. 26, 1 (Mar.), 65-74.
7. COMER, D. 1979. The ubiquitous B-tree. Comput. Surv. 11, 2, 121-137.
8. CZECH, Z. J. AND MAJEWSKI, B. S. 1993. A linear time algorithm for finding minimal perfect hash functions. Comput. J. 36, 6 (Dec.), 579-587.
9. Fox, E. A., CHEN, Q. F., DAOUD, A. M., AND HEATH, L. S. 1991. Order-preserving minimal perfect hash functions and information retrieval. ACM Trans. Inf. Syst. 9, 3, 281-308.
10. FURUSE, K., ASADA, K., AND IIZAWA, A. 1995. Implementation and performance evaluation of compressed bit-sliced signature files. In Information Systems and Data Management, 6th International Conference, CISMOD'95, Bombay, India, November 15-17, 1995, Proceedings, S. Bhalla, Ed. Lecture Notes in Computer Science, vol. 1006. Springer, Berlin, Germany, 164-177.
11. GAILLY, J. AND ADLER, M. 1998. zlib 1.1.3 manual. Source code available online at http://www.info-zip.org/pub/infozip/zlib.
12. ISHIKAWA, Y., KITAGAWA, H., AND OHBO, N. 1993. Evalution of signature files as set access facilities in OODBs. In Proceedings of the ACM SIGMOD International Conference on Management of Data, (Washington, DC May 26-28), P. Buneman and S. Jajodia, Eds. ACM Press, New York, NY, 247-256.
13. JOHNSON, T. 1999. Performance measurements of compressed bitmap indices. In VLDB'99, Proceedings of 26th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, M. P. Atkinson, M. E. Orlowska, P. Valduriez, S. B. Zdonik, and M. L. Brodie, Eds. Morgan Kaufmann, San Francisco, CA, 278-289. A longer version appeared as AT&T report number AMERICA112.
14. JÜRGENS, M. AND LENZ, H.-J. 1999. Tree based indexes vs. bitmap indexes - a performance study. In Proceedings of the International Workshop on Design and Management of Data Warehouses, DMDW'99, Heidelberg, Germany, June 14-15, 1999, S. Gatziu, M. A. Jeusfeld, M. Staudt, and Y. Vassiliou, Eds.
15. KNUTH, D. E. 1998. The Art of Computer Programming, 2nd ed. Vol. 3. Addison Wesley, Reading, MA.
16. KOUDAS, N. 2000. Space efficient bitmap indexing. In Proceedings of the Ninth International Conference on Information Knowledge Management (CIKM 2000, November 6-11, McLean, VA). ACM Press, New York, NY, 194-201.
17. LEE, D. L., KIM, Y. M., AND PATEL, G. 1995. Efficient signature file methods for text retrieval. IEEE Trans. Knowl. Data Eng. 7, 3, 423-435.
18. MOFFAT, A. AND ZOBEL, J. 1992. Parameterised compression for sparse bitmaps. In Proceedings of the ACM-SIGIR International Conference on Research and Development in Information Retrieval, (Copenhagen, Denmark, June), N. Belkin, P. Ingwersen, and A. M. Pejtersen, Eds. ACM Press, New York, NY, 274-285.
19. O'NEIL, P. 1987. Model 204 architecture and performance. In 2nd International Workshop in High Performance Transaction Systems, Asilomar, CA. Lecture Notes in Computer Science, vol. 359. Springer-Verlag, Berlin, Germany, 40-59.
20. O'NEIL, P. AND O'NEIL, E. 2000. Database: Principles, Programming, and Performance, 2nd ed. Morgan Kaugmann, San Francisco, CA.
21. O'NEIL, P. AND QUASS, D. 1997. Improved query performance with variant indices. In Proceedings of the ACM SIGMOD International Conference on Management of Data (Tucson, AZ, May 13-15), J. Peckham, Ed. ACM Press, New York, NY, 38-49.
22. O'NEIL, P. E. AND GRAEFE, G. 1995. Multi-table joins through bitmapped join indices. SIGMOD Rec. 24, 3, 8-11.
23. SHOSHANI, A., BERNARDO, L. M., NORDBERG, H., ROTEM, D., AND SIM, A. 1999. Multidimensional indexing and query coordination for tertiary storage management. In Proceedings of the 11th International Conference on Scientific and Statistical Database Management (Cleveland, OH, 28-30 July). IEEE Computer Society Press, Los Alamitos, CA, 214-225.
24. STOCKINGER, K., DUELLMANN, D., HOSCHEK, W., AND SCHIKUTA, E. 2000. Improving the performance of high-energy physics analysis through bitmap indices. In Proceedings of the 11th International Conference on Database and Expert Systems Applications (DEXA 2000, London, Greenwich, UK).
25. STOCKINGER, K., WU, K., AND SHOSHANI, A. 2002. Strategies for processing ad hoc queries on large data warehouses. In Proceedings of DOLAP'02 (McLean, VA), 72-79. A draft appeared as Tech rep. LBNL-51791, Lawrence Berkeley National Laboratory, Berkeley, CA.
26. WONG, H. K. T., LIU, H.-F., OLKEN, F., ROTEM, D., AND WONG, L. 1985. Bit transposed files. In Proceedings of VLDB 85 (Stockholm, Sweden). 448-457.
27. WU, K.-L. AND YU, P. 1996. Range-based bitmap indexing for high cardinality attributes with skew. Tech. rep. RC 20449. IBM Watson Research Division, Yorktown Heights, NY.
28. WU, M.-C. AND BUCHMANN, A. P. 1998. Encoded bitmap indexing for data warehouses. In Proceedings of the Fourteenth International Conference on Data Engineering (February 23-27, Orlando, FL). IEEE Computer Society, ACM Press, Los Alamitos, CA, 220-230.
29. WU, K., KOEGLER, W., CHEN, J., AND SHOSHANI, A. 2003. Using bitmap index for interactive exploration of large datasets. In Proceedings of SSDBM 2003 (Cambridge, MA), 65-74. A draft appeared as Tech rep. LBNL-52535, Lawrence Berkeley National Laboratory, Berkeley, CA.
30. WU, K., OTOO, E. J., AND SHOSHANI, A. 2001a. A performance comparison of bitmap indexes. In Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management (Atlanta, GA, November 5-10). ACM Press, New York, NY, 559-561.
31. WU, K., OTOO, E. J., AND SHOSHANI, A. 2002. Compressing bitmap indexes for faster search operations. In Proceedings of SSDBM'02 (Edinburgh, Scotland), 99-108. Also published as Tech rep. LBNL-49627, Lawrence Berkeley National Laboratory, Berkeley, CA.
32. WU, K., OTOO, E. J., AND SHOSHANI, A. 2004. On the performance of bitmap indices for high-cardinality attributes. In Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, August 31-September 3, 2004, M. A. Nascimento, M. T. Özsu, D. Kossmann, R. J. Miller, J. A. Blakeley, and K. B. Schiefer, Eds. Morgan Kaufmann, San Francisco, CA, 24-35.
33. WU, K., OTOO, E. J., SHOSHANI, A., AND NORDBERG, H. 2001b. Notes on design and implementation of compressed bit vectors. Tech. rep. LBNL/PUB-3161. Lawrence Berkeley National Laboratory, Berkeley, CA.
34. ZIV, J. AND LEMPEL, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theor. 23, 3, 337-343.