A text compression scheme that allows fast searching directly in the compressed file

ACM Transactions on Information Systems

Volumn 15, Issue 2, 1997, Pages 124-136

  Manber, Udi ^a,b  

^a UNIVERSITY OF ARIZONA   (United States)

^b University of Arizona   (United States)

Author keywords

E.4 Data : Coding and Information Theory data compaction and compression; F.2.2 Analysis of Algorithms and Problem Complexity : Nonnumerical Algorithms and Problems pattern matching

Indexed keywords

ALGORITHMS; INFORMATION RETRIEVAL SYSTEMS; PATTERN RECOGNITION;

STRING MATCHING ALGORITHMS;

DATA COMPRESSION;

EID: 0031118558     PISSN: 10468188     EISSN: None     Source Type: Journal    
DOI: 10.1145/248625.248639     Document Type: Article

References (22)

1. AMIR, A. AND BENSON, G. 1992a. Two-dimensional periodicity and its application. In Proceedings of the 3rd Symposium on Discrete Algorithms. SIAM, Philadelphia, Pa., 440-452.
2. AMIR, A. AND BENSON, G. 1992b. Efficient two dimensional compressed matching. In Proceedings of the Data Compression Conference. IEEE, New York, 279-288.
3. AMIR, A., BENSON, G., AND FARACH, M. 1994. Let sleeping files lie: Pattern matching in Z-compressed files. In Proceedings of the 5th Symposium on Discrete Algorithms. SIAM, Philadelphia, Pa.
4. AHO, A. V. AND CORASICK, M. J. 1975. Efficient string matching: An aid to bibliographic search. Commun. ACM 18, 6 (June), 333-340.
5. BITNER, J. R., ERLICH, G., AND REINGOLD, E. M. 1976. Efficient generation of the binary reflected Gray code and its applications. Commun. ACM 19, 9 (Sept.), 517-521.
6. BELL, T. G., CLEARY, J. G., AND WITTEN, I. H. 1990. Text Compression. Prentice-Hall, Englewood Cliffs, N.J.
7. BOYER, R. S. AND MOORE, J. S. 1977. A fast string searching algorithm. Commun. ACM 20, 10 (Oct.), 762-772.
8. CROCHEMORE, M., CZUMAJ, A., GASIENIEC, L., JAROMINEK, S., LECROQ, T., PLANDOWSKI, W., AND RYTTER, W. 1994. Speeding up two string-matching algorithms. Algorithmica 12, 4/5 (Oct.), 247-267.
9. EILAM-TSOREFF, T. AND VISHKIN, U. 1988. Matching patterns in a string subject to multilin-ear transformations. In Proceedings of the International Workshop on Sequences, Combinatorics, Compression, Security, and Transmission.
10. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability, A Guide to the Theory of NP-completeness, W. H. Freeman, San Francisco, Calif.
11. HUME, A. AND SUNDAY, D. 1991. Fast string searching, Softw. Pract. Exper. 21 (Nov.), 1221-1248.
12. JEWELL, G. C. 1976. Text compaction for information retrieval systems. IEEE SMC Newslett. 5 (Feb.).
13. KLEIN, S. T., BOOKSTEIN, A., AND DEERWESTER, S. 1989. Storing text retrieval systems on CD-ROM: Compression and encryption considerations. ACM Trans. Inf. Syst. 7, 3 (July), 230-245.
14. MANBER, U. AND WU, S. 1994. GLIMPSE: A tool to search through entire file systems. In the Usenix Winter 1994 Technical Conference. Usenix Assoc., Berkeley, Calif., 23-32.
15. MOFFAT, A. AND ZOBEL, J. 1992. Coding for compression in full-text retrieval systems. In Proceedings of the IEEE Data Compression Conference. IEEE, New York, 72-81.
16. REVUZ, D. AND ZIPSTEIN, M. 1992. DZ, a text compression algorithm for natural languages. In the 3rd Annual Symposium on Combinatorial Pattern Matching. 193-204.
17. SNYDERMAN, M. AND HUNT, B. 1970. The myriad virtues of text compression. Datamation 16, 36-40.
18. WITTEN, I. H., BELL, T. C., AND NEVILL, C. G. 1991. Models for compression in full-text retrieval systems. In Proceedings of the Data Compression Conference. IEEE, New York, 23-32.
19. WELCH, T. A. 1984. A technique for high-performance data compression. IEEE Comput. 17 (June), 8-19.
20. WU, S. AND MANBER, U. 1992. Fast text searching allowing errors. Commun. ACM 35, 10 (Oct.), 83-91.
21. WITTEN, I. H., MOFFAT, A., AND BELL, T. C. 1994. Managing Gigabytes. Van Nostrand Reinhold, New York.
22. ZIV, J. AND LEMPEL, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory IT-23 (May), 337-343.