Gonzalo Navarro  Home/Search
Context Related
| dcc.uchile.cl/pub/user...jlzindex.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcc.uchile.cl/DCC/inves...reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 how to build a data structure, called the LZ-index, based on the Ziv-Lempel trie that takes 4n 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 log +(m+R) log n). We present a practical implementation of the LZ-index with average search time O(m log u + uR). It ... (Update)
Cited by: More
Indexing Text using the Ziv-Lempel Trie - Navarro (2002) (Correct)
Compressed Compact Suffix Arrays - Mäkinen, Navarro (Correct)
Active bibliography (related documents): More All
0.6: High-Order Entropy-Compressed Text Indexes - Grossi, Gupta, Vitter (Correct)
0.4: Compressed Suffix Trees with Full Functionality - Sadakane (Correct)
0.4: Advantages of Backward Searching - Efficient Secondary.. - Mäkinen, Navarro.. (Correct)
Similar documents based on text: More All
0.6: Regular Expression Searching over Ziv-Lempel Compressed Text - Navarro (2001) (Correct)
0.5: Approximate String Matching over Ziv-Lempel Compressed Text - Kärkkäinen, Navarro, Ukkonen (2000) (Correct)
0.5: A Hybrid Indexing Method for Approximate String Matching - Navarro, Baeza-Yates (2001) (Correct)
Related documents from co-citation: More All
2: Compressed text databases with ecient query algorithms based on the compressed s.. (context) - Sadakane - 2000
2: Overview of the Third Text REtrieval Conference (context) - Harman - 1995
2: Opportunistic Data Structures with Applications - Ferragina, Manzini - 2000
BibTeX entry: (Update)
G. Navarro. The LZ-index: A Text Index Based on the Ziv-Lempel Trie. Technical Report TR/DCC-2003-1, Dept. of Computer Science, Univ. of Chile, January 2003. http://citeseer.ist.psu.edu/navarro03lzindex.html More
@misc{ navarro03lzindex,
author = "G. Navarro",
title = "The LZ-index: A Text Index Based on the Ziv-Lempel Trie",
text = "G. Navarro. The LZ-index: A Text Index Based on the Ziv-Lempel Trie. Technical
Report TR/DCC-2003-1, Dept. of Computer Science, Univ. of Chile, January
2003.",
year = "2003",
url = "citeseer.ist.psu.edu/navarro03lzindex.html" }
Citations (may not include all citations):368 Text compression (context) - Bell, Cleary et al. - 1990
293 Compression of individual sequences via variable length codi.. - Ziv, Lempel - 1978
228 A technique for high performance data compression (context) - Welch - 1984
133 Geometric range searching and its relatives - Agarwal, Erickson - 1999
85 Overview of the Third Text REtrieval Conference (context) - Harman - 1995
64 Managing Gigabytes (context) - Witten, Mo et al. - 1999
59 A functional approach to data structures and its use in mult.. (context) - Chazelle - 1988
56 The myriad virtues of subword trees (context) - Apostolico - 1985
34 Opportunistic data structures with applications - Ferragina, Manzini - 2000
26 Sux arrays: a new method for on-line string searches (context) - Manber, Myers - 1993
24 Adding compression to block addressing inverted indexes - Navarro, Moura et al. - 2000
19 An experimental study of an opportunistic index - Ferragina, Manzini - 2001
16 Compressed text databases with ecient query algorithms based.. (context) - Sadakane - 1969
15 Reducing the space requirements of sux trees (context) - Kurtz - 1998
13 Lempel-Ziv parsing and sublinear-size index structures for s.. - arkk, Ukkonen - 1996
12 Compressed sux arrays and sux trees with applications to tex.. (context) - Grossi, Vitter - 2000
12 Compression of low entropy strings with Lempel-Ziv algorithm.. (context) - Kosaraju, Manzini - 1999
9 Space-ecient static trees and graphs (context) - Jacobson - 1989
9 Sparse sux trees (context) - arkk, Ukkonen - 1996
7 Sux cactus: a cross between sux tree and sux array (context) - arkk - 1995
6 Succint representation of balanced parentheses (context) - Munro, Raman - 1997
6 Optimal exact string matching based on sux arrays (context) - Abouelhoda, Ohlebusch et al. - 2002
5 Space ecient sux trees (context) - Munro, Raman et al. - 2001
4 Repetition-based text indexes (context) - arkk - 1999
3 A space and time ecient algorithm for constructing compresse.. (context) - Lam, Sadakane et al. - 2002
3 Compact sux array (context) - akinen - 2000
3 Dipartamento di Informatica (context) - Ferragina, Manzini et al. - 2002
2 Succint representations of lcp information and improvements .. (context) - Sadakane - 2002
Documents on the same site (http://www.dcc.uchile.cl/DCC/investigacion/reports.html): More
A New Data Model: Persistent Attribute-Centric Objects - Baeza-Yates, Jones, al. (1999) (Correct)
Fast Approximate String Matching in a Dictionary - Baeza-Yates, Navarro (1998) (Correct)
Automatic (Triangular) Mesh Generation Based On.. - Rivara, Hitschfeld.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC