Extreme Bitmapping: Efficiently Sorting Data for Cloud Compression

Christian Mørup, Anders Kloborg, Daniel Enrique Lucani Rötter

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Abstract

This paper proposes Extreme Bitmapping, a new algorithm to concisely represent how a sorted sequence can be restored to its original, unsorted sequence. This concise representation is critical to the compression efficiency of newly proposed data compression and dual deduplication algorithms, e.g., Bonsai [1], but with potential implications in other fields. Extreme Bitmapping in the context of data compression leads to improved compression ratios while preserving the privacy-focused features of dual deduplication. Performance measurements on three datasets, including, HDFS log files, high-resolution TIF images, VDI images of different Linux distributions, show significant compression gains compared to Bonsai (up to three fold better compression) or similar state-of-the-art alternatives.
Original languageEnglish
Title of host publication2022 IEEE 11th International Conference on Cloud Networking (CloudNet)
Number of pages5
PublisherIEEE
Publication date2022
Pages247-251
ISBN (Print)978-1-6654-8628-6
ISBN (Electronic)978-1-6654-8627-9
DOIs
Publication statusPublished - 2022
SeriesIEEE International Conference on Cloud Networking
ISSN2771-5663

Keywords

  • Cloud Storage
  • Compression
  • Deduplication

Fingerprint

Dive into the research topics of 'Extreme Bitmapping: Efficiently Sorting Data for Cloud Compression'. Together they form a unique fingerprint.

Cite this