Indexing Text Using the Ziv-Lempel Trie

Authors:
Gonzalo Navarro
Affiliations:
-
Venue:
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Year:
2002

Citing 17
Cited 6

Functional approach to data structures and its use in multidimensional searching

SIAM Journal on Computing
Text compression

Text compression
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Compression of Low Entropy Strings with Lempel--Ziv Algorithms

SIAM Journal on Computing
An experimental study of an opportunistic index

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Space efficient suffix trees

Journal of Algorithms
Adding Compression to Block Addressing Inverted Indexes

Information Retrieval
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Sparse Suffix Trees

COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Tables

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Compact Suffix Array

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Succinct representation of balanced parentheses, static trees and planar graphs

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Opportunistic data structures with applications

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On compressing and indexing data

On compressing and indexing data
A Technique for High-Performance Data Compression

Computer
Space-efficient static trees and graphs

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Compact suffix array: a space-efficient full-text index

Fundamenta Informaticae - Special issue on computing patterns in strings
Indexing text using the Ziv-Lempel trie

Journal of Discrete Algorithms - SPIRE 2002
Compressed full-text indexes

ACM Computing Surveys (CSUR)
Implementing the LZ-index: Theory versus practice

Journal of Experimental Algorithmics (JEA)
Space-efficient construction of LZ-index

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Compact Suffix Array — A Space-Efficient Full-Text Index

Fundamenta Informaticae - Computing Patterns in Strings

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let a text of u characters over an alphabet of size 驴 be compressible to n symbols by the LZ78 or LZW algorithm. We show that it is possible to build a data structure based on the Ziv-Lempel trie that takes 4n log2 n(1+o(1)) bits of space and reports the R occurrences of a pattern of length m in worst case time O(m2 log(m驴)+(m+R)log n).