An experimental study of a compressed index
- 30 June 2001
- journal article
- Published by Elsevier in Information Sciences
- Vol. 135 (1-2) , 13-28
- https://doi.org/10.1016/s0020-0255(01)00098-6
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Opportunistic data structures with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Compact Suffix ArrayPublished by Springer Nature ,2000
- Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix ArrayPublished by Springer Nature ,2000
- Text Compression Using AntidictionariesPublished by Springer Nature ,1999
- String Matching in Lempel—Ziv Compressed StringsAlgorithmica, 1998
- Let Sleeping Files Lie: Pattern Matching in Z-Compressed FilesJournal of Computer and System Sciences, 1996
- The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and ImprovementsThe Computer Journal, 1996
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- A locally adaptive data compression schemeCommunications of the ACM, 1986