A compression scheme for large databases

Proceedings - 11th Australasian Database Conference, ADC 2000

Volumn , Issue , 2000, Pages 6-11

  Cannane, A ^a   Williams, H E ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION ALGORITHMS; COMPRESSION SCHEME; LARGE DATABASE; MODEL-BASED OPC; SMALL TRAINING; SPACE REQUIREMENTS; TEST SETS; VERY LARGE DATABASE;

DATABASE SYSTEMS;

EID: 0005665720     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ADC.2000.819807     Document Type: Conference Paper

References (15)

1. A. Apostolico and S. Lonardi. Some theory and practice of greedy off-line textual substitution. In J. Storer and M. Cohn, editors, Proc. IEEE Data Compression Conference, pages 119-128, Snowbird, Utah, Mar. 1997. IEEE Computer Society Press, Los Alamitos, California.
2. A. Cannane and H.Williams. General-purpose compression for efficient retrieval. Technical Report TR-99-6, Department of Computer Science, RMIT, Melbourne, Australia, 1999.
3. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21(2):194-203, Mar. 1975.
4. J. Gailly. Gzip program and documentation, 1993. Available by anonymous ftp from prep.ai.mit.edu:/pub/gnu/gzip-∗.tar.
5. D. Harman. Overview of the second text retrieval conference (TREC-2). Information Processing & Management, 31(3):271-289, 1995.
6. N. Larsson and A. Moffat. Offline dictionary-based compression. In J. Storer and M. Cohn, editors, Proc. IEEE Data Compression Conference, pages 296-305, Snowbird, Utah, 1999. IEEE Computer Society Press, Los Alamitos, California.
7. A. Moffat, R. Neal, and I. Witten. Arithmetic coding revisited. ACM Transactions on Information Systems, 16(3):256-294, July 1998.
8. A. Moffat, J. Zobel, and N. Sharman. Text compression for dynamic document databases. IEEE Transactions on Knowledge and Data Engineering, 9(2):302-313, 1997.
9. C. Nevill-Manning and I. Witten. Compression and explanation using hierarchical grammars. Computer Journal, 40(2/3):103-116, 1997.
10. A. Turpin. Efficient Prefix Coding. PhD thesis, The University of Melbourne, 1999.
11. H. Williams and J. Zobel. Combined models for high-performance compression of large text collections. In String Processing and Information Retrieval (SPIRE), pages 224-231, Cancun, Mexico, 1999. IEEE Computer Society Press.
12. H. Williams and J. Zobel. Compressing integers for fast file access. Computer Journal, 42(3):193-201, 1999.
13. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23(3):337-343, 1977.
14. J. Ziv and A. Lempel. Compression of individual sequences via variable rate coding. IEEE Transactions on Information Theory, IT-24(5):530-536, 1978.
15. J. Zobel and A. Moffat. Adding compression to a full-text retrieval system. Software Practice and Experience, 25(8):891-903, Aug. 1995.