Search (1 results, page 1 of 1)

Did you mean:
precises%3a%2fdocuments %2f subject classification schemes%3a bliss%2c henry evelyn %2f bliss bibliographic classification %2f texts%22 1
precises%3a%2f_documents %2f subject classification schemes%3a bliss%2c henry evelyn %2f bliss bibliographic classification %2f texts%22 1
precises%3a%2fdocuments %2f subject classification schemes%3a bliss%2c heery evelyn %2f bliss bibliographic classification %2f texts%22 1
precises%3a%2fdocuments %2f subject classification schemes%3a bliss%2c henry evelyn %2f bloss bibliographic classification %2f texts%22 1
precises%3a%2fdocuments %2f subject classification schemes%3a bloss%2c henry evelyn %2f bliss bibliographic classification %2f texts%22 1

Cannane, A.; Williams, H.E.: General-purpose compression for efficient retrieval (2001) 0.00
```
0.0020356115 = product of:
  0.02849856 = sum of:
    0.02849856 = product of:
      0.05699712 = sum of:
        0.05699712 = weight(_text_:schemes in 5705) [ClassicSimilarity], result of:
          0.05699712 = score(doc=5705,freq=2.0), product of:
            0.16067243 = queryWeight, product of:
              5.3512506 = idf(docFreq=569, maxDocs=44218)
              0.03002521 = queryNorm
            0.35474116 = fieldWeight in 5705, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3512506 = idf(docFreq=569, maxDocs=44218)
              0.046875 = fieldNorm(doc=5705)
      0.5 = coord(1/2)
  0.071428575 = coord(1/14)
```
Abstract

Compression of databases not only reduces space requirements but can also reduce overall retrieval times. In text databases, compression of documents based on semistatic modeling with words has been shown to be both practical and fast. Similarly, for specific applications -such as databases of integers or scientific databases-specially designed semistatic compression schemes work well. We propose a scheme for general-purpose compression that can be applied to all types of data stored in large collections. We describe our approach -which we call RAY-in detail, and show experimentally the compression available, compression and decompression costs, and performance as a stream and random-access technique. We show that, in many cases, RAY achieves better compression than an efficient Huffman scheme and popular adaptive compression techniques, and that it can be used as an efficient general-purpose compression scheme