2011 Data Compression Conference 2011
DOI: 10.1109/dcc.2011.47
|View full text |Cite
|
Sign up to set email alerts
|

Search and Modification in Compressed Texts

Abstract: Text compression techniques like bzip2 lack the possibility to search or to update substrings at given positions of texts that have been compressed without prior decompression of the compressed text. We have developed Indexed Reversible Transformation (IRT), a modified version of the Burrows-Wheeler-Transformation (BWT) that in combination with run length encoding (RLE) and wavelet trees (WT) allows for position-based searching and updating substrings of compressed texts without prior decompression of the comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(16 citation statements)
references
References 16 publications
0
16
0
Order By: Relevance
“…Our contribution is based on a block-sorting technique called Indexed Reversible Transformation (IRT) [1] that modifies Burrows Wheeler Transformation (BWT) [2] in such a way that search, insertion, and deletion of the n th word are supported on the block-sorted text IRT(S). IRT(S) can then be compressed to CIRT (=compressed IRT) with run length encoding (RLE) and wavelet trees (WT).…”
Section: Motivationmentioning
confidence: 99%
See 4 more Smart Citations
“…Our contribution is based on a block-sorting technique called Indexed Reversible Transformation (IRT) [1] that modifies Burrows Wheeler Transformation (BWT) [2] in such a way that search, insertion, and deletion of the n th word are supported on the block-sorted text IRT(S). IRT(S) can then be compressed to CIRT (=compressed IRT) with run length encoding (RLE) and wavelet trees (WT).…”
Section: Motivationmentioning
confidence: 99%
“…IRT(S) can then be compressed to CIRT (=compressed IRT) with run length encoding (RLE) and wavelet trees (WT). Beyond our previous contribution [1], we present a technique called DICIRT (=Deletion and Insertion in CIRT) to directly insert the n th word into or to directly delete the n th word from a compressed text c(S) without full decompression of c(S), where c(S) is computed from S by CIRT.…”
Section: Motivationmentioning
confidence: 99%
See 3 more Smart Citations