Amortized efficiency of list update and paging rules
Communications of the ACM
Self-adjusting binary search trees
Journal of the ACM (JACM)
A locally adaptive data compression scheme
Communications of the ACM
Application of splay trees to data compression
Communications of the ACM
Improved Randomized On-Line Algorithms for the List Update Problem
SIAM Journal on Computing
Splay trees for data compression
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
Two New Families of List Update Algorithms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Corpus for the Evaluation of Lossless Compression Algorithms
DCC '97 Proceedings of the Conference on Data Compression
Modifications of the Burrows and Wheeler Data Compression Algorithm
DCC '99 Proceedings of the Conference on Data Compression
DCC '00 Proceedings of the Conference on Data Compression
Experimental Study of a Binary Block Sorting Compression Scheme
DCC '03 Proceedings of the Conference on Data Compression
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A simpler analysis of burrows-wheeler based compression
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
List update with probabilistic locality of reference
Information Processing Letters
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Hi-index | 0.00 |
List update algorithms have been widely used as subroutines in compression schemas, most notably as part of Burrows-Wheeler compression. The Burrows-Wheeler transform (BWT), which is the basis of many state-of-the-art general purpose compressors applies a compression algorithm to a permuted version of the original text. List update algorithms are a common choice for this second stage of BWT-based compression. In this paper we perform an experimental comparison of various list update algorithms both as stand alone compression mechanisms and as a second stage of the BWT-based compression. Our experiments show MTF outperforms other list update algorithms in practice after BWT. This is consistent with the intuition that BWT increases locality of reference and the predicted result from the locality of reference model of Angelopoulos et al. [1]. Lastly, we observe that due to an often neglected difference in the cost models, good list update algorithms may be far from optimal for BWT compression and construct an explicit example of this phenomena. This is a fact that had yet to be supported theoretically in the literature.