Skip to Main content Skip to Navigation
Conference papers

Pushdown compression

Abstract : The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation (Hariharan and Shankar 2006, League and Eng 2007), and in particular calls for a formulation of information-lossless stack or pushdown compressors that allows a formal analysis of their performance and a more ambitious use of the stack in XML compression, where so far it is mainly connected to parsing mechanisms. In this paper we introduce the model of pushdown compressor, based on pushdown transducers that compute a single injective function while keeping the widest generality regarding stack computation. The celebrated Lempel-Ziv algorithm LZ78 was introduced as a general purpose compression algorithm that outperforms finite-state compressors on all sequences. We compare the performance of the Lempel-Ziv algorithm with that of the pushdown compressors, or compression algorithms that can be implemented with a pushdown transducer. This comparison is made without any a priori assumption on the data's source and considering the asymptotic compression ratio for infinite sequences. We prove that Lempel-Ziv is incomparable with pushdown compressors.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Pascal Weil Connect in order to contact the contributor
Submitted on : Wednesday, January 30, 2008 - 1:03:24 PM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM
Long-term archiving on: : Friday, November 25, 2016 - 8:02:02 PM


Files produced by the author(s)


  • HAL Id : ensl-00175903, version 2



Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel. Pushdown compression. STACS 2008, Feb 2008, Bordeaux, France. pp.39-48. ⟨ensl-00175903v2⟩



Record views


Files downloads