Algorithm 673: Dynamic Huffman coding
ACM Transactions on Mathematical Software (TOMS)
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bitmap index design and evaluation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Space efficient bitmap indexing
Proceedings of the ninth international conference on Information and knowledge management
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Encoded Bitmap Indexing for Data Warehouses
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Range-Based Bitmap Indexing for High Cardinality Attributes with Skew
COMPSAC '98 Proceedings of the 22nd International Computer Software and Applications Conference
Compressing Bitmap Indexes for Faster Search Operations
SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
Query processing and optimization in Oracle Rdb
The VLDB Journal — The International Journal on Very Large Data Bases
Compressing Bitmap Indices by Data Reorganization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Optimizing candidate check costs for bitmap indices
Proceedings of the 14th ACM international conference on Information and knowledge management
Approximate encoding for direct access and query processing over compressed bitmaps
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Compressing large boolean matrices using reordering techniques
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
On the performance of bitmap indices for high cardinality attributes
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Optimizing i/o costs of multi-dimensional queries using bitmap indices
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
RLH: Bitmap compression technique based on run-length and Huffman encoding
Information Systems
Real-time creation of bitmap indexes on streaming network data
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
In this paper we present a technique of compressing bitmap indexes for application in data warehouses. The developed compression technique, called Run-Length Huffman (RLH), is based on the run-length encoding and on the Huffman encoding. RLH was implemented and experimentally compared to the well known Word Aligned Hybrid bitmap compression technique that has been reported to provide the shortest query execution time. The experiments discussed in this paper show that RLH offers shorter query response times than WAH, for certain cardinalities of indexed attributes. Moreover, bitmaps compressed with RLH are smaller than corresponding bitmaps compressed with WAH. Additionally, we propose a modified RLH, called RLH-1024, which is designed to better support bitmap updates.