Variants of Huffman codes where words are taken as the source symbols are currently the
most attractive choices to compress natural language text databases. In particular, Tagged …

Semistatic byte‐oriented word‐based compression codes have been shown to be an
attractive alternative to compress natural language text databases, because of the …

We address the problem of adaptive compression of natural language text, focusing on the
case where low bandwidth is available and the receiver has little processing power, as in …

In the last years, new semistatic word-based byte-oriented compressors, such as Plain and
Tagged Huffman and the Dense Codes, have been used to improve the efficiency of text …

Lempel–Ziv–Welch (LZW) is a data compression method, which is adopted by many
applications likes Electrocardiography (ECG) data to reduce the size of transferred data …

We adapted Word-based Tagged Code (WBTC) to obtain its dynamic version. The aim of
designing a dynamic version of WBTC is to adapt it for real-time transmission. The problem …

The task of compressed pattern matching is to report all the occurrences of a given pattern P
in a text T available in compressed form. Certain compression algorithms allow for searching …

We present a new statistical compression method, which we call Phrase Based Dense Code
(PBDC), aimed at compressing large digital libraries. PBDC compresses the text collection …

Searching is arguably the most important of all problems that computer science deals with.
Very broadly speaking, this problem consists in reporting occurrences of an object (key) in a …

Inverted indexes on external storage perform best when accesses are ordered and data is
read sequentially, so that seek times are minimized. As a consequence, the various items …