RLH: Bitmap compression technique based on run-length and huffman encoding

DOLAP: Proceedings of the ACM International Workshop on Data Warehousing and OLAP

Volumn , Issue , 2007, Pages 41-48

  Stabno, Michal ^a   Wrembel, Robert ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

bitmap compression; bitmap index; Huffman encoding; RLH; run length encoding; WAH

Indexed keywords

ENCODING (SYMBOLS); KNOWLEDGE MANAGEMENT; SIGNAL ENCODING;

BIT MAPS; BITMAP COMPRESSION; BITMAP INDEXES; COMPRESSION TECHNIQUES; HUFFMAN; HUFFMAN ENCODING; RUN LENGTH; RUN-LENGTH ENCODING; RUN-LENGTH HUFFMAN; WAH;

DATA WAREHOUSES;

EID: 79959678243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1317331.1317339     Document Type: Conference Paper

References (25)

1. G. Antoshenkov and M. Ziauddin. Query processing and optimization in oracle rdb. VLDB Journal, 5(4):229-237, 1996. (Pubitemid 126704140)
2. T. Apaydin, G. Canahuate, H. Ferhatosmanoglu, and A. S. Tosun. Approximate encoding for direct access and query processing over compressed bitmaps. In Proc. of Int. Conference on Very Large Data Bases (VLDB), pages 846-857, 2006.
3. C.Y. Chan and Y. Ioannidis. Bitmap index design and evaluation. In Proc. of ACM SIGMOD Int. Conference on Management of Data, pages 355-366, 1998.
4. K. C. Davis and A. Gupta. Indexing in data warehouses: Bitmaps and beyond. In R. Wrembel and C. Koncilia, editors, Data Warehouses and OLAP: Concepts, Architectures and Solutions. Idea Group Inc., 2007. ISBN 1-59904-364-5.
5. Scientific Data Management Research Group. Fastbit: An efficient compressed bitmap index technology. Retrieved November 10, 2006, from http://sdm.lbl.gov/fastbit/.
6. Huffman compression. Retrieved May 8, 2007, from http://www.geocities. com/SiliconValley/2151/huffman.html.
7. D. Johnson, S. Krishnan, J. Chhugani, S. Kumar, and S. Venkatasubramanian. Compressing large boolean matrices using reordering techniques. In Proc. of Int. Conference on Very Large Data Bases (VLDB), pages 13-23, 2004.
8. N. Koudas. Space efficient bitmap indexing. In Proc. of ACM Conference on Information and Knowledge Management (CIKM), pages 194-201, 2000.
9. E. O'Neil, P. O'Neil, and K. Wu. Bitmap index design choices and their performance implications. Research report, Lawrence Berkeley National Laboratory, 2007.
10. P. O'Neil. Model 204 architecture and performance. In Int. Workshop on High Performance Transactions Systems, pages 40-59. LNCS 359, 1987.
11. P. O'Neil and D. Quass. Improved query performance with variant indexes. In Proc. of ACM SIGMOD Int. Conference on Management of Data, pages 38-49, 1997.
12. A. Pinar, T. Tao, and H. Ferhatosmanoglu. Compressing bitmap indices by data reorganization. In Proc. of Int. Conference on Data Engineering (ICDE), pages 310-321, 2005.
13. F. Reiss, K. Stockinger, K. Wu, A. Shoshani, and J. M. Hellerstein. Efficient analysis of live and historical streaming data and its application to cybersecurity. Research report, Lawrence Berkeley National Laboratory, 2006.
14. D. Rinfret, P. O'Neil, and E. O'Neil. Bit-sliced index arithmetic. In Proc. of ACM SIGMOD Int. Conference on Management of Data, pages 47-57, 2001.
15. D. Rotem, K. Stockinger, and K. Wu. Optimizing candidate check costs for bitmap indices. In Proc. of ACM Conference on Information and Knowledge Management (CIKM), pages 648-655, 2005.
16. D. Rotem, K. Stockinger, and K. Wu. Optimizing i/o costs of multi-dimensional queries using bitmap indices. In Proc. of Int. Conference on Database and Expert Systems Applications (DEXA), pages 220-229. LNCS 3588, 2005.
17. M. Stabno and R. Wrembel. Rlh and rlh-1024 compression techniques: Implementation and experimental evaluation. 2007, in preparation.
18. K. Stockinger and K. Wu. Bitmap indices for data warehouses. In R. Wrembel and C. Koncilia, editors, Data Warehouses and OLAP: Concepts, Architectures and Solutions. Idea Group Inc., 2007. ISBN 1-59904-364-5.
19. K. Stockinger, K. Wu, and A. Shoshani. Evaluation strategies for bitmap indices with binning. In Proc. of Int. Conference on Database and Expert Systems Applications (DEXA), pages 120-129. LNCS 3180, 2004.
20. J. S. Vitter. Dynamic huffman coding. ACM Transactions on Mathematical Software, 15(2):158-167, 1989.
21. K.Wu, E. J. Otoo, and A. Shoshani. Compressing bitmap indexes for faster search operations. In Proc. of International Conference on Scientific and Statistical Database Management (SSDBM), pages 99-108, 2002.
22. K.Wu, E. J. Otoo, and A. Shoshani. An efficient compression scheme for bitmap indices. Research report, Lawrence Berkeley National Laboratory, 2004.
23. K.Wu, E. J. Otoo, and A. Shoshani. On the performance of bitmap indices for high cardinality attributes. In Proc. of Int. Conference on Very Large Data Bases (VLDB), pages 24-35, 2004.
24. K.L. Wu and P.S. Yu. Range-based bitmap indexing for high cardinality attributes with skew. In Int. Computer Software and Applications Conference (COMPSAC), pages 61-67, 1998.
25. M.C. Wu and A. Buchmann. Encoded bitmap indexing for data warehouses. In Proc. of Int. Conference on Data Engineering (ICDE), pages 220-230, 1998.