On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression - Computer Science > Data Structures and AlgorithmsReportar como inadecuado




On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression - Computer Science > Data Structures and Algorithms - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Much research has been devoted to optimizing algorithms of the Lempel-ZivLZ 77 family, both in terms of speed and memory requirements. Binary searchtrees and suffix trees ST are data structures that have been often used forthis purpose, as they allow fast searches at the expense of memory usage.In recent years, there has been interest on suffix arrays SA, due to theirsimplicity and low memory requirements. One key issue is that an SA can solvethe sub-string problem almost as efficiently as an ST, using less memory. Thispaper proposes two new SA-based algorithms for LZ encoding, which require nomodifications on the decoder side. Experimental results on standard benchmarksshow that our algorithms, though not faster, use 3 to 5 times less memory thanthe ST counterparts. Another important feature of our SA-based algorithms isthat the amount of memory is independent of the text to search, thus the memorythat has to be allocated can be defined a priori. These features of low andpredictable memory requirements are of the utmost importance in severalscenarios, such as embedded systems, where memory is at a premium and speed isnot critical. Finally, we point out that the new algorithms are general, in thesense that they are adequate for applications other than LZ compression, suchas text retrieval and forward-backward sub-string search.



Autor: Artur Ferreira, Arlindo Oliveira, Mario Figueiredo

Fuente: https://arxiv.org/







Documentos relacionados