Re-Store: A system for compressing, browsing, and searching large documents

Proceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001

Volumn , Issue , 2001, Pages 162-174

  Moffat, Alistair ^a   Wan, Raymond ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BROWSING TOOLS; COMPRESSION PROCESS; COMPRESSION SYSTEM; SOFTWARE SYSTEMS; SOURCE TEXT; SPACE SAVINGS; TEXT FILE;

INFORMATION RETRIEVAL;

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

References (16)

1. A. Apostolico and S. Lonardi. Off-line compression by greedy textual substitution. Proc. IEEE, 88(11):1733-1744, Nov. 2000.
2. D. Bahle, H. E. Williams, and J. Zobel. Compaction techniques for nextword indexes. In Proc. 2001 String Processing and Information Retrieval Symp. IEEE Computer Society Press, Los Alamitos, CA, Nov. 2001.
3. A. Cannane and H. E. Williams. A compression scheme for large databases. In M. E. Orlowska, editor, Proc. 11th Australasian Database Conference, pages 6-11, Canberra, Australia, Feb. 2000. IEEE Computer Society Press, Los Alamitos, CA.
4. A. Cannane and H. E. Williams. General-purpose compression for efficient retrieval. Journal of the American Society for Information Science and Technology, 2001. To appear.
5. O. de Kretser and A. Moffat. Needles and haystacks: A search engine for personal information collections. In J. Edwards, editor, Proc. 23rd Australasian Computer Science Conference, pages 58-65, Canberra, Australia, Feb. 2000. IEEE Computer Society Press, Los Alamitos, CA.
6. E. S. de Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast and flexible word searching on compressed text. ACM Transactions on Information Systems, 18(2):113-139, 2000.
7. J. Gailly. GZIP program and documentation. Source code available from ftp://prep.ai.mit.edu/pub/gnu/gzip/,1993.
8. N. J. Larsson and A. Moffat. Off-line dictionary-based compression. Proc. IEEE, 88(11):1722-1732, Nov. 2000.
9. V. Miller and M. Wegman. Variations on a theme by Ziv and Lempel. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, Volume 12, NATO ASI Series F, Berlin, 1985. Springer-Verlag.
10. S. Mitarai, M. Hirao, T. Matsumoto, A. Shinohara, M. Takeda, and S. Arikawa. Compressed pattern matching for Sequitur. In J. A. Storer and M. Cohn, editors, Proc. 2001 IEEE Data Compression Conference. IEEE Computer Society Press, Los Alamitos, CA, Mar. 2001.
11. A. Moffat and L. Stuiver. Binary interpolative coding for effective index compression. Information Retrieval, 3(1):25-47, July 2000.
12. C. G. Nevill-Manning and I. H. Witten. Compression and explanation using hierarchical grammars. Computer Journal, 40(2/3): 103-116, 1997.
13. C. G. Nevill-Manning and I. H. Witten. On-line and off-line heuristics for inferring hierarchies of repetitions in sequences. Proc. IEEE, 88(11):1745-1755, Nov. 2000.
14. C. G. Nevill-Manning, I. H. Witten, and G. W. Paynter. Browsing in digital libraries: A phrase-based approach. In Proc. ACM Digital Libraries 97, pages 230-236, July 1997.
15. A. Turpin and A. Moffat. Housekeeping for prefix coding. IEEE Transactions on Communications, 48(4):622-628, Apr. 2000. Source code available from http://www.cs.mu.oz.au/~alistair/mr-coder/.
16. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes. Morgan Kaufmann, second edition, 1999.