Visually Lossless HTML Compression
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
A highly efficient XML compression scheme for the web
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Scarlett: coping with skewed content popularity in mapreduce clusters
Proceedings of the sixth conference on Computer systems
| Hi-index | 0.02 |
In this paper we present a PPM variation which combines traditional character based processing with stringmatching. Such an approach can effectively handle repetitive data and can be used with practically anyalgorithm from the PPM family. The algorithm, inspired by its predecessors, PPM* and PPMZ, searchesfor matching sequences in arbitrarily long, variable-length, deterministic contexts. The experimental resultsshow that the proposed technique may be very useful, especially in combination with relatively low order(up to 8) models, where the compression gains are often significant and the additional memoryrequirements are moderate.