Multi-stream word-based compression algorithm for compressed text search

Küçük Resim Yok

Tarih

2018

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Springer Heidelberg

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Ö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.

Açıklama

Ozturk, Emir (Trakya author) Mesut, Altan (Trakya author)

Anahtar Kelimeler

Data Compression, Text Compression, Dictionary-Based Compression, Compressed Matching, MWCA, Natural-Language Text, Strings

Kaynak

Arabian Journal for Science and Engineering

WoS Q Değeri

Q3

Scopus Q Değeri

N/A

Cilt

43

Sayı

12

Künye

Öztürk, E., Mesut, A., & Diri, B. (2018). Multi-Stream Word-Based Compression Algorithm for Compressed Text Search. Arabian Journal for Science and Engineering, 43(12), 8209-8221.