An experimental study of a compressed index

Information Sciences

Volumn 135, Issue 1-2, 2001, Pages 13-28

  Ferragina, Paolo ^a   Manzini, Giovanni ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF EASTERN PIEDMONT   (Italy)

Author keywords

Burrows Wheeler transform; Compressed full text index; Pattern matching on compressed text; Suffix array

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; DATA REDUCTION; DATA STRUCTURES; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; MATHEMATICAL TRANSFORMATIONS; PATTERN MATCHING; QUERY LANGUAGES;

BURROWS-WHEELER TRANSFORMS; COMPRESSED FULL-TEXT INDEX; SUFFIX ARRAYS;

DATA COMPRESSION;

EID: 0035367304     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(01)00098-6     Document Type: Article

References (23)

1. Let sleeping files lie: Pattern matching in Z-compressed files
2. Block addressing indices for approximate text retrieval
3. A locally adaptive compression scheme
4. Fast algorithms for sorting and searching strings
5. Text compression using antidictionaries
6. String matching in Lempel-Ziv compressed strings
7. The Burrows-Wheeler transform for block sorting text compression: Principles and improvements
8. Opportunistic data structures with applications
9. Compressed suffix arrays and suffix trees with applications to text indexing and string matching
10. Sorting and searching
11. Compact suffix array
12. Suffix arrays: A new method for on-line string searches
13. GLIMPSE: A tool to search through entire file systems
14. Indexing compressed text
15. Fast searching on compressed text allowing errors
16. Compressed text databases with efficient query algorithms based on the compressed suffix array
17. Arithmetic coding for data compression