The Community for Technology Leaders
Data Compression Conference (2012)
Snowbird, Utah USA
Apr. 10, 2012 to Apr. 12, 2012
ISSN: 1068-0314
ISBN: 978-0-7695-4656-8
pp: 393
ABSTRACT
Text compression techniques like bzip2 lack the possibility to delete the nth word or to insert text be-fore the nth word of compressed texts without prior decompression of the compressed texts. We present a text compression technique that supports fast insertion into and deletion from compressed texts without full decompression of the compressed text. Our approach combines Indexed Reversible Transformation (IRT) [1], Run-Length-Encoding (RLE), and the Wavelet Tree (WT). For a reasona-ble size of inserted or deleted texts (more details are given in [2]), our approach is faster than modifying uncompressed text preceded by a decompression step and followed by a compression step.
INDEX TERMS
insertion, deletion, burrows wheeler transformation, BWT, text compression, wavelet trees, RLE
CITATION

S. Böttcher, R. Hartel, J. Schlüßler and A. Bültmann, "Fast Insertion and Deletion in Compressed Texts," 2012 Data Compression Conference (DCC), Snowbird, UT, 2012, pp. 393.
doi:10.1109/DCC.2012.50
103 ms
(Ver 3.3 (11022016))