Regular Expression Searching over Ziv-Lempel Compressed Text

We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Given a text of length u compressed into length n, and a pattern of length m, we report all the R occurrences of the pattern in the text in O(2m + mn + Rmlogm) worst case time. On average this drops to O(m2 + (n + R)logm) or O(m2 + n+ Ru=n) for most regular expressions. This is the rst nontrivial result for this problem. The experimental results show that our compressed search algorithm needs half the time necessary for decompression plus searching, which is currently the only alternative.

• Type: Conference
• Year: 2001
• Where: CPM
• Authors: Gonzalo Navarro
• Keywords: Combinatorics, Compressed Search Algorithm, CPM 2001, Regular Expressions, Worst Case Time