Ge Ma
ABSTRACT
Compressed bitmap indexes are increasingly used in databases and search engines. By exploiting bit-level parallelism and bitwise operations, e.g. AND/OR operations, they can significantly accelerate the development of many areas. The Word Aligned Hybrid (WAH) bitmap compression scheme using run-length encoding (RLE), is commonly recognized as the most efficient scheme in terms of CPU-performance. This paper presents a new form of compressed bitmap indexes named Adaptive Partitioned Position List Encoding (APPLE), which uses packed position lists for compression. For experiments, we compare it with Huffman encoding, and two enhanced variants of WAH : Concise and COMPAX. Our empirical results show this scheme achieves significant improvement.
- G. Ma, et al. "Wireless Caching in Large-Scale Edge Access Points: A Local Distributed Approach." MobiCom. ACM, 2018.Google Scholar
- Z. Chen, et al. "A Survey of Bitmap Index Compression Algorithms for Big Data". Tsinghua Science & Technology (2015): 100--115.Google Scholar
- F. Fusco, et al. "RecoNet: An Interpretable Neural Architecture for Recommender Systems." IJCAI, 2019.Google Scholar
- F. Yang, et al. "Druid: A Real-time Analytical Data Store." SIGMOD. ACM, 2014.Google Scholar
- P. Chhikara, et al. "Data dimensionality reduction techniques for Industry 4.0: Research results, challenges, and future research directions." Software Practice and Experience 4(2020).Google Scholar
- G. Ma, et al. "BreadZip: A Combination of Network Traffic Data and Bitmap Index Encoding Algorithm." SMC. IEEE, 2014.Google Scholar
- Y. Wu, et al. "A General Analytical Model for Spatial and Temporal Performance of Bitmap Index Compression Algorithms in Big Data." ICCCN. IEEE, 2014.Google Scholar
- Y. Wen, et al. "SECOMPAX: A Bitmap Index Compression Algorithm." ICCCN. IEEE, 2014.Google Scholar
- G. Ma, et al. "Understanding Performance of Edge Content Caching for Mobile Video Streaming." JSAC (2017): 1076--1089.Google Scholar
Index Terms
APPLE: a new compression scheme for bitmap indexes: poster abstract
Recommendations
Optimizing bitmap indices with efficient compression
Bitmap indices are efficient for answering queries on low-cardinality attributes. In this article, we present a new compression scheme called Word-Aligned Hybrid (WAH) code that makes compressed bitmap indices efficient even for high-cardinality ...
Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes
DOLAP '08: Proceedings of the ACM 11th international workshop on Data warehousing and OLAPBitmap 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. ...
Better bitmap performance with Roaring bitmaps
Bitmap indexes are commonly used in databases and search engines. By exploiting bit-level parallelism, they can significantly accelerate queries. However, they can use much memory, and thus, we might prefer compressed bitmap indexes. Following Oracle's ...
Comments