下推压缩
Pushdown Compression
摘要：
XML文档高效压缩方案的迫切需求最近集中在堆栈计算上[6，9]，特别是要求制定信息无损堆栈或下推压缩器，允许对其性能进行正式分析，并在XML压缩中更雄心勃勃地使用堆栈，到目前为止，它主要与解析机制有关。在本文中，我们介绍了下推压缩器的模型，下推传感器计算一个单内射函数，同时保持最广泛的通用性，关于堆栈计算的基础上。著名的Lempel-Ziv算法LZ 78 [10]是作为一种通用压缩算法引入的，它在所有序列上都优于有限状态压缩器。我们比较的Lempel-Ziv算法的下推压缩器，或压缩算法，可以实现下推换能器的性能。这种比较是在没有任何先验假设的数据的来源，并考虑到无限序列的渐近压缩比。我们证明了Lempel-Ziv是不可比拟的下推压缩。
英文摘要：
The pressing need for eficient compression schemes for XML documents has recently been focused on stack computation [6, 9], 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 [10] 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
