A text compression scheme that allows fast searching directly in the compressed file
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 113-124
- https://doi.org/10.1007/3-540-58094-8_10
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Efficient two-dimensional compressed matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Models for compression in full-text retrieval systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast text searchingCommunications of the ACM, 1992
- Storing text retrieval systems on CD-ROM: compression and encryption considerationsACM Transactions on Information Systems, 1989
- A Technique for High-Performance Data CompressionComputer, 1984
- A fast string searching algorithmCommunications of the ACM, 1977
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Efficient generation of the binary reflected gray code and its applicationsCommunications of the ACM, 1976
- Efficient string matchingCommunications of the ACM, 1975