T. Bell, I. H. Witten and J. G. Cleary, "Modelling for Text Compression," ACM Computing Surveys, 21(4), pp. 557--591, Dec. 1989. 5 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Data Compression and Database Performance - Graefe, Shapiro (1991) (13 citations) (Correct)
....query processing by a factor much larger than the compression factor. 1. Introduction Data compression is an effective means for saving storage space and network bandwidth. A large number of compression schemes have been devised based on character encoding or on detection of repetitive strings [2, 18], Many compression schemes achieve data reduction rates to 2.3 2.5 bits per character for English text [2] i.e. compression factors of about 3 1 4. Since compression schemes are so successful for network bandwidth, the advantageous effects of data compression on I O performance in database ....
....an effective means for saving storage space and network bandwidth. A large number of compression schemes have been devised based on character encoding or on detection of repetitive strings [2, 18] Many compression schemes achieve data reduction rates to 2.3 2. 5 bits per character for English text [2], i.e. compression factors of about 3 1 4. Since compression schemes are so successful for network bandwidth, the advantageous effects of data compression on I O performance in database systems are rather obvious, i.e. its effects on disk space, bandwidth, and throughput. However, we believe ....
[Article contains additional citation context not shown here]
T. Bell, I. H. Witten and J. G. Cleary, Modelling for Text Compression, ACM Computing Surveys 21, 4 (December 1989), 557.
Computing the Entropy of User Navigation in the Web - Levene, Loizou (2000) (6 citations) (Correct)
....the context of the web is that navigation sessions are typically short and therefore it is probably better to fit a # order Markov chain model, for some # # 1, to the data. This can be done by using the techniques described in [Cha73, MGZ89] or by using an adaptive context modelling technique [Ris86, BWC89]. In our case fitting a # order Markov chain model is not practical due to the size of the model, i.e. O(n # ) since, in general, we expect only few transitions to have non zero probability. So, we propose instead a technique based on dynamic Markov modelling [CH87, BM89, TR93] which is an ....
T. Bell, I.H. Witten, and J.G. Cleary. Modelling for text compression. ACM Computing Surveys, 21:557--591, 1989.
Computing the Entropy of User Navigation in the Web - Levene, Loizou (1999) (6 citations) (Correct)
....in the context of the web is that navigation sessions are typically short and therefore it is probably better to fit a order Markov chain model, for some 1, to the data. This can be done by using the techniques described in [Cha73, MGZ89] or by using an adaptive context modelling technique [Ris86, BWC89]. In our case fitting a order Markov chain model is not practical due to the size of the model, i.e. O(n ) since, in general, we expect only few transitions to have non zero probability. So, we propose instead a technique based on dynamic Markov modelling [CH87, BM89, TR93] which is an ....
T. Bell, I.H. Witten, and J.G. Cleary. Modelling for text compression. ACM Computing Surveys, 21:557--591, 1989.
LZW Text Compression in Haskell - Sanders (1992) (2 citations) (Correct)
....important to choose an application where speed is of interest so that it can be judged whether or not these criticisms are still valid. A version of the compress program has been implemented in Haskell [2] on a Sun workstation. 2 LZW Compression There are many algorithms for data compression [3]. LZW compression [4] is a classic being found in an advanced variant on most Unix systems as the program compress. The algorithm works by maintaining a table of strings and associated code values which grows as the input is processed. The key feature of the algorithm is that every string in the ....
....and so is not directly comparable; we will refer to it in the tables however to provide a reference for the order of performance we should be aiming at. The performance results have been obtained by running each program on three of the benchmark files from the Calgary Text Compression Corpus 1 [3]: bib (a bibliography unusual English, 111Kb) paper1 (troff source usual English, 53Kb) and geo (non ascii data file, 101Kb) 3.1.1 Performance Speed Table 2 shows average CPU times recorded for running the programs on the benchmarks, together with the slowdown factor compared with the ....
T Bell, I Witten, and J Cleary. Modelling for text compression. ACM Computing Surveys, 21(4), December 1989.
Unknown - (Correct)
No context found.
T. Bell, I. H. Witten and J. G. Cleary, "Modelling for Text Compression," ACM Computing Surveys, 21(4), pp. 557--591, Dec. 1989. 5
Unknown - (2003) (Correct)
No context found.
T. Bell, I. H. Witten and J. G. Cleary, "Modelling for Text Compression," ACM Computing Surveys, 21(4), pp. 557--591, Dec. 1989. 5
Out-of-Core Compression and Decompression of Large .. - Ibarria.. (2003) (Correct)
No context found.
T. Bell, I. H. Witten and J. G. Cleary, "Modelling for Text Compression," ACM Computing Surveys, 21(4), pp. 557--591, Dec. 1989. 5
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC