Data compression and Gray-code sorting
Information Processing Letters
Monotone gray codes and the middle levels problem
Journal of Combinatorial Theory Series A
Using multiset discrimination to solve language processing problems without hashing
Theoretical Computer Science
An algorithm for suffix stripping
Readings in information retrieval
Bitmap index design and evaluation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Improving performance of sparse matrix-vector multiplication
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Space efficient bitmap indexing
Proceedings of the ninth international conference on Information and knowledge management
A performance comparison of bitmap indexes
Proceedings of the tenth international conference on Information and knowledge management
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Strategies for processing ad hoc queries on large data warehouses
Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP
Model 204 Architecture and Performance
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Byte-aligned bitmap compression
DCC '95 Proceedings of the Conference on Data Compression
CubiST++: Evaluating Ad-Hoc CUBE Queries Using Statistics Trees
Distributed and Parallel Databases
Compressing Bitmap Indices by Data Reorganization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
Integrating compression and execution in column-oriented database systems
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Minimizing I/O Costs of Multi-Dimensional Queries with Bitmap Indices
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
Heuristic design of property maps
DOLAP '06 Proceedings of the 9th ACM international workshop on Data warehousing and OLAP
Compression techniques for fast external sorting
The VLDB Journal — The International Journal on Very Large Data Bases
Multi-resolution bitmap indexes for scientific data
ACM Transactions on Database Systems (TODS)
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
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
A comparison of five probabilistic view-size estimation techniques in OLAP
Proceedings of the ACM tenth international workshop on Data warehousing and OLAP
Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes
Proceedings of the ACM 11th international workshop on Data warehousing and OLAP
Selection and pruning algorithms for bitmap index selection problem using data mining
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
NET-FLi: on-the-fly compression, archiving and indexing of streaming network traffic
Proceedings of the VLDB Endowment
Reordering columns for smaller indexes
Information Sciences: an International Journal
Improving DBSCAN's execution time by using a pruning technique on bit vectors
Pattern Recognition Letters
Variable length compression for bitmap indices
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Real-time creation of bitmap indexes on streaming network data
The VLDB Journal — The International Journal on Very Large Data Bases
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
An information content based partitioning method for the anatomical ontology matching task
Proceedings of the Third Symposium on Information and Communication Technology
Incrementally maintaining run-length encoded attributes in column stores
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Minimizing index size by reordering rows and columns
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Dynamic bitmap index recompression through workload-based optimizations
Proceedings of the 17th International Database Engineering & Applications Symposium
Polygon-Based Query Evaluation over Geospatial Data Using Distributed Hash Tables
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |
Bitmap indexes must be compressed to reduce input/output costs and minimize CPU usage. To accelerate logical operations (AND, OR, XOR) over bitmaps, we use techniques based on run-length encoding (RLE), such as Word-Aligned Hybrid (WAH) compression. These techniques are sensitive to the order of the rows: a simple lexicographical sort can divide the index size by 9 and make indexes several times faster. We investigate row-reordering heuristics. Simply permuting the columns of the table can increase the sorting efficiency by 40%. Secondary contributions include efficient algorithms to construct and aggregate bitmaps. The effect of word length is also reviewed by constructing 16-bit, 32-bit and 64-bit indexes. Using 64-bit CPUs, we find that 64-bit indexes are slightly faster than 32-bit indexes despite being nearly twice as large.