Affiliation:
1. University of Chile, Santiago, Chile
Abstract
The LZ-index is a theoretical proposal of a lightweight data structure for text indexing, based on the Ziv-Lempel trie. If a text of
u
characters over an alphabet of size σ is compressible to
n
symbols using the LZ78 algorithm, then the LZ-index takes 4
n
log
2
n
(1+
o
(1)) bits of space (that is, 4 times the entropy of the text) and reports the
R
occurrences of a pattern of length m in worst case time
O
(
m
3
log σ + (
m
+
R
)log
n
). In this paper we face the challenge of obtaining a practical implementation of the LZ-index, which is not at all straightforward from the theoretical proposal. We end up with a prototype that takes the promised space and has average search time
O
(σ
m
log
u
+ √
uR
). This prototype is shown to be faster than other competing approaches when we take into account the time to report the positions or text contexts of the occurrences found. We show in detail the process of implementing the index, which involves interesting lessons of theory versus practice.
Funder
Fondo Nacional de Desarrollo Científico y Tecnológico
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献