PPMexe: PPM for Compressing Software

PPMexe: PPM for Code Compression

With the emergence of software delivery platforms such as Microsoft’s .NET, code compression has become one of the core enabling technologies strongly affecting system performance. In this paper, we present compression mechanisms for executables that explore their syntax and semantics to achieve superior compression rates. The fundament of our compression codec is the generic paradigm of predic...

Generic Adaptive Syntax-Directed Compression for Mobile Code

We propose a new scheme for compressing mobile programs. Our proposal is meant as part of a larger infrastructure for code distribution and deployment. In this paper we show how to effectively compress programs on the source level by compressing abstract syntax trees (ASTs) which are equivalent to source code (modulo comments and layout). We compress ASTs by adapting the wellknown PPM (predicti...

Compressing XML with Multiplexed Hierar hi al PPM

On Compression of Parse Trees

We consider methods for compressing parse trees, especially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of the path from the root of a tree to a node x as the context of a node x. The contexts are augmented with branching information of the nodes. By applying the text compression algorithm PPM on such contexts we achieve good compressi...

A memory versus compression ratio trade-off in PPM via compressed context modeling

Since its introduction prediction-by-partial-matching (PPM) has always been a de facto gold standard in lossless text compression, where many variants improving the compression ratio and speed have been proposed. However, reducing the high space requirement of PPM schemes did not gain that much attention. This study focuses on reducing the memory consumption of PPM via the recently proposed com...