Polylog空间压缩、下推压缩和Lempel-Ziv是无法比拟的
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
摘要：
XML文档高效压缩方案的迫切需求最近集中在堆栈计算上，特别是要求制定信息无损堆栈或下推压缩器，允许对其性能进行正式分析，并在XML压缩中更雄心勃勃地使用堆栈，到目前为止，它主要与解析机制有关。在本文中，我们介绍了下推压缩器的模型，下推传感器计算一个单内射函数，同时保持最广泛的通用性，关于堆栈计算的基础上。我们还考虑在线压缩算法，最多使用多对数空间（plogon）。这些算法对应于数据流模型中的压缩器。我们比较这两个家庭的压缩机的性能与彼此和通用Lempel-Ziv算法。这种比较是在没有任何先验假设的数据的来源，并考虑到无限序列的渐近压缩比。我们证明，在所有情况下，他们是无与伦比的。
英文摘要：
The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation, 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. We also consider online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We compare the performance of these two families of compressors with each other and with the general purpose Lempel-Ziv algorithm. 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 in all cases they are incomparable.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
