Direct pattern matching on compressed text

Proceedings - String Processing and Information Retrieval: A South American Symposium, SPIRE 1998

Volumn 1998-September, Issue , 1998, Pages 90-95

  De Moura, Edleno Silva ^a   Navarro, Gonzalo ^b   Ziviani, Nivio ^a   Baeza Yates, Ricardo ^b  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL;

COMPRESSION SCHEME; FAST COMPRESSIONS; HUFFMAN CODING; NATURAL LANGUAGE TEXT; SEQUENTIAL PATTERN MATCHING; WORD-BASED MODEL;

PATTERN MATCHING;

EID: 33646917099     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.1998.712987     Document Type: Conference Paper

References (21)

1. A. Amir and G. Benson. Efficient two-dimensional compressedmatching. In Proc. Second IEEE Data Compression Conference, pages 279-288, March 1992.
2. A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Patternmatching in z-compressed files. Journal of Computer and Systems Sciences, 52(2): 299-307, 1996.
3. M. D.Araújo, G. Navarro, andN. Ziviani. Large text searching allowing errors. In R. Baeza-Yates, editor, Proc. of the Fourth South AmericanWorkshopon String Processing, volume 8, pages 2-20. Carleton University Press International Informatics Series, 1997.
4. R. Baeza-Yates and G. Navarro. A faster algorithm for approximate string matching. In Proc. of Combinatorial Pattern Matching (CPM'96), volume 1075, pages 1-13. Springer-Verlag LNCS, 1996.
5. R. Baeza-Yates and G. Navarro. Multiple approximate string matching. In Proc. of Workshop on Algorithms and Data Structures (WADS'97), volume 1272, pages 174-184. Springer-Verlag LNCS, 1997.
6. J. Bentley, D. Sleator, R. Tarjan, and V. Wei. A locally adaptive data compression scheme. Communications of the ACM, 29: 320-330, 1986.
7. E. de Moura, G. Navarro, and N. Ziviani. Indexing compressed text. In R. Baeza-Yates, editor, Proc. of the Fourth South American Workshop on String Processing, volume 8, pages 95-111.Carleton University Press International Informatics Series, 1997.
8. E. de Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast text searching allowing errors. In Proc. of the ACM Sigir'98. to appear.
9. M. Farach and M. Thorup. String matching in lempel-ziv compressed strings. In Proc. 27th ACM Annual Symposium on the Theory of Computing, pages 703-712, 1995.
10. L. Gasieniec, M. Karpinksi, W. Plandowski, and W. Rytter. Efficient algorithms for lempel-ziv encodings. In Proc. of the ScandinavianWorkshop on Algorithm Theory, 1996.
11. D. K. Harman. Overview of the third text retrieval conference. In Proc. Third Text REtrieval Conference (TREC-3), pages 1-19, Gaithersburg, Maryland, 1995. National Institute of Standards and Technology Special Publication.
12. J. Heaps. Information Retrieval - Computational and Theoretical Aspects. Academic Press, 1978.
13. D. A. Huffman. A method for the construction of minimumredundancy codes. In Proc. of the I.R.E., volume 40, pages 1090-1101, 1952.
14. M.Karpinski, A. Shinohara, andW. Rytter. Patternmatching problem for strings with short descriptions. Nordic Journal of Computing, 4(2): 172-186, 1997.
15. U. Manber. A text compression scheme that allows fast searching directly in the compressed file. ACMTransactions on Information Systems, 15(2): 124-136, 1997.
16. U.Manber and S.Wu. Glimpse: A tool to search through entire file systems. TechnicalReport 93-34, Dept. of Computer Science, Univ. of Arizona, Octuber 1993.
17. A.Moffat. Word-based text compression. Software Practice and Experience, 19(2): 185-198, 1989.
18. D. Sunday. A very fast substring search algorithm. Communications of the ACM, 33(8): 133-142, 1990.
19. S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10), 1992.
20. J. Ziv and A. Lempel. On the complexity of finite sequences. IEEE Transactions on Information Theory, 22: 75-81, 1976.
21. J. Zobel and A. Moffat. Adding compression to a fulltext retrieval system. Software Practice and Experience, 25(8): 891-903, 1995.