Efficient Algorithms foe On-Line Symbol Ranking Compression

Authors:
Giovanni Manzini
Affiliations:
-
Venue:
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Year:
1999

Citing 4
Cited 1

Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Symbol Ranking Text Compressors

DCC '97 Proceedings of the Conference on Data Compression
A Fast Block-Sorting Algorithm for Lossless Data Compression

DCC '97 Proceedings of the Conference on Data Compression
Text Compression using Recency Rank with Context and Relation to Context Sorting, Block Sorting and PPM

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997

Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Symbol ranking compression algorithms are known to achieve a very good compression ratio. Off-line symbol ranking algorithms (e.g., bzip, szip) are currently the state of the art for lossless data compression because of their excellent compression/time trade-off.Some on-line symbol ranking algorithms have been proposed in the past. They compress well but their slowness make them impractical. In this paper we design some fast on-line symbol ranking algorithms by fine tuning two data structures (skip lists and ternary trees) which are well known for their simplicity and efficiency.