Multi-Stream Word-Based Compression Algorithm for Compressed Text Search


ÖZTÜRK E., MESUT A., DİRİ B.

Arabian Journal for Science and Engineering, cilt.43, sa.12, ss.8209-8221, 2018 (SCI-Expanded, Scopus) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 43 Sayı: 12
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1007/s13369-018-3378-9
  • Dergi Adı: Arabian Journal for Science and Engineering
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.8209-8221
  • Anahtar Kelimeler: Compressed matching, Data compression, Dictionary-based compression, MWCA, Text compression
  • Trakya Üniversitesi Adresli: Evet

Özet

In this article, we present a novel word-based lossless compression algorithm for text files using a semi-static model. We named this method the ‘Multi-stream word-based compression algorithm (MWCA)’ because it stores the compressed forms of the words in three individual streams depending on their frequencies in the text and stores two dictionaries and a bit vector as side information. In our experiments, MWCA produces a compression ratio of 3.23 bpc on average and 2.88 bpc for files greater than 50 MB; if a variable length encoder such as Huffman coding is used after MWCA, the given ratios are reduced to 2.65 and 2.44 bpc, respectively. MWCA supports exact word matching without decompression, and its multi-stream approach reduces the search time with respect to single-stream algorithms. Additionally, the MWCA multi-stream structure supplies the reduction in network load by requesting only the necessary streams from the database. With the advantage of its fast compressed search feature and multi-stream structure, we believe that MWCA is a good solution, especially for storing and searching big text data.