Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression

Authors:
Elvira Mayordomo;Philippe Moser
Affiliations:
Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, Zaragoza, Spain 50018;Department of Computer Science, National University of Ireland Maynooth, Maynooth, Co., Kildare, Ireland
Venue:
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 13
Cited 1

Context-free languages and pushdown automata

Handbook of formal languages, vol. 1
The space complexity of approximating the frequency moments

Journal of Computer and System Sciences
A Universal Upper Bound on the Performance of the Lempel-Ziv Algorithm on Maliciously-Constructed Data

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Finite-state dimension

Theoretical Computer Science
Effective fractal dimension: foundations and applications

Effective fractal dimension: foundations and applications
Optimal approximations of the frequency moments of data streams

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Compression and Machine Learning: A New Perspective on Feature Space Vectors

DCC '06 Proceedings of the Data Compression Conference
Evaluating the Role of Context in Syntax Directed Compression of XML Documents

DCC '06 Proceedings of the Data Compression Conference
Visibly pushdown automata for streaming XML

Proceedings of the 16th international conference on World Wide Web
Type-Based Compression of XML Data

DCC '07 Proceedings of the 2007 Data Compression Conference
One-way log-tape reductions

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Dimension is compression

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Adding nesting structure to words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Grammar-based compression in a streaming model

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study the performance attained by these algorithms and show they are incomparable with both pushdown compressors and the Lempel-Ziv compression algorithm.